188 search results - page 9 / 38 » A new meta-method for graph partitioning |
PAKDD
2004
ACM
14 years 1 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
WEA
2009
Springer
14 years 13 days ago
2009
Springer
We present initial results from the first empirical evaluation of a graph partitioning algorithm inspired by the Arora-Rao-Vazirani algorithm of [5], which combines spectral and ...
SODA
1997
ACM
13 years 9 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
Publication
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...