Results 1  10
of
670,588
Clustering by weighted cuts in directed graphs
 In Proceedings of the 2007 SIAM International Conference on Data Mining
, 2007
"... In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends several popular criteria like the normalized cut and the averaged cut to asymmetric affinity data. We show that this problem ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends several popular criteria like the normalized cut and the averaged cut to asymmetric affinity data. We show that this problem
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
in the flow value then, provided the capacities are integral, a maximum flow will be determined within at most 1 + logM/(M1) if(t, S) augmentations, wheref*(t, s) is the value of the maximum flow and M is the maximum number of arcs across a cut. Next a new algorithm is given for the minimumcost flow
The Study of Dynamic Milk Ultrafiltration Performance Influenced by Membrane Molecular Weight Cut off
, 2007
"... ABSTRACT: The effect of membrane molecular weight cut off (MWCO) at three levels (10, 20 & 50 kD) ..."
Abstract
 Add to MetaCart
ABSTRACT: The effect of membrane molecular weight cut off (MWCO) at three levels (10, 20 & 50 kD)
Eightyfive per cent of what? Discrepancies in the weight cutoff for anorexia nervosa substantially affect the prevalence of underweight
"... Background. DSMIV cites <85 % of expected body weight (EBW) as a guideline for the diagnosis of anorexia nervosa (AN) but does not require a specific method for calculating EBW. The purpose of the present study was to determine the degree to which weight cutoff calculations vary across studies ..."
Abstract
 Add to MetaCart
Background. DSMIV cites <85 % of expected body weight (EBW) as a guideline for the diagnosis of anorexia nervosa (AN) but does not require a specific method for calculating EBW. The purpose of the present study was to determine the degree to which weight cutoff calculations vary across
Computing geodesics and minimal surfaces via graph cuts
 in International Conference on Computer Vision
, 2003
"... Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D ..."
Abstract

Cited by 251 (26 self)
 Add to MetaCart
D). We show how to build a grid graph and set its edge weights so that the cost of cuts is arbitrarily close to the length (area) of the corresponding contours (surfaces) for any anisotropic Riemannian metric. There are two interesting consequences of this technical result. First, graph cut
The Complexity of Multiterminal Cuts
 SIAM Journal on Computing
, 1994
"... In the Multiterminal Cut problem we are given an edgeweighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the mincut, maxflow problem, and ..."
Abstract

Cited by 193 (0 self)
 Add to MetaCart
In the Multiterminal Cut problem we are given an edgeweighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the mincut, maxflow problem
Weighted graph cuts without eigenvectors: A multilevel approach
 IEEE TRANS. PATTERN ANAL. MACH. INTELL
, 2007
"... A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel kmeans are two of the main methods. In this paper, we discuss an equivalence between the objective functions used in these seemingly different methods—in par ..."
Abstract

Cited by 172 (22 self)
 Add to MetaCart
—in particular, a general weighted kernel kmeans objective is mathematically equivalent to a weighted graph clustering objective. We exploit this equivalence to develop a fast highquality multilevel algorithm that directly optimizes various weighted graph clustering objectives, such as the popular ratio cut
A simple min cut algorithm
, 1994
"... We present an algorithm for nding the minimum cut of an edgeweighted graph. It is simple in every respect It has a short and compact description is easy to implement and has a surprisingly simple proof of correctness Its runtime matches that of the fastest algorithm known The runtime analysis i ..."
Abstract

Cited by 187 (1 self)
 Add to MetaCart
We present an algorithm for nding the minimum cut of an edgeweighted graph. It is simple in every respect It has a short and compact description is easy to implement and has a surprisingly simple proof of correctness Its runtime matches that of the fastest algorithm known The runtime analysis
A Minmax Cut Algorithm for Graph Partitioning and Data Clustering
, 2001
"... An important application of graph partitioning is data clustering using a graph model  the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information for clustering. Here we propose a new algorithm for graph partition with an objec ..."
Abstract

Cited by 214 (15 self)
 Add to MetaCart
An important application of graph partitioning is data clustering using a graph model  the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information for clustering. Here we propose a new algorithm for graph partition
IL = interleukin; IM = inflammatory mediators; MWCO = molecular weight cutoff; SC = sieving coefficient. Hemofiltration, adsorption, sieving and the challenge of sepsis therapy design
, 2002
"... Circulating inflammatory mediators (IM) spilling into the circulation from sites of active inflammation are considered the source of remote tissue injury and associated organ dysfunction in sepsis. Hemofiltration has been proposed as a therapy for sepsis based on its ability to remove circulating I ..."
Abstract
 Add to MetaCart
adsorption, which is quite different from conventional hemoadsorption. If sepsis is a manifestation of a nonlinear dynamic control system out of control, then filtration at modest doses with a large pore filter may succeed as well as highvolume hemofiltration with a conventional cutoff filter
Results 1  10
of
670,588