Sciweavers

474 search results - page 16 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
IPMI
2007
Springer
14 years 8 months ago
Probabilistic Clustering and Quantitative Analysis of White Matter Fiber Tracts
A novel framework for joint clustering and point-by-point mapping of white matter fiber pathways is presented. Accurate clustering of the trajectories into fiber bundles requires p...
Mahnaz Maddah, William M. Wells III, Simon K. Warf...
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
COCOON
2005
Springer
14 years 1 months ago
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
Jinsong Tan, Kok Seng Chua, Louxin Zhang
JCSS
2002
199views more  JCSS 2002»
13 years 7 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...