Sciweavers

419 search results - page 7 / 84
» Spectral Methods for Automatic Multiscale Data Clustering
Sort
View
ICMLA
2008
13 years 9 months ago
Farthest Centroids Divisive Clustering
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
Haw-ren Fang, Yousef Saad
PRL
2010
130views more  PRL 2010»
13 years 6 months ago
Automatic configuration of spectral dimensionality reduction methods
In this paper, our main contribution is a framework for the automatic configuration of any spectral dimensionality reduction methods. This is achieved, first, by introducing the m...
Michal Lewandowski, Dimitrios Makris, Jean-Christo...
BMCBI
2010
151views more  BMCBI 2010»
13 years 8 months ago
Data reduction for spectral clustering to analyze high throughput flow cytometry data
Background: Recent biological discoveries have shown that clustering large datasets is essential for better understanding biology in many areas. Spectral clustering in particular ...
Habil Zare, Parisa Shooshtari, Arvind Gupta, Ryan ...
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
ICML
2010
IEEE
13 years 6 months ago
Multiple Non-Redundant Spectral Clustering Views
Many clustering algorithms only find one clustering solution. However, data can often be grouped and interpreted in many different ways. This is particularly true in the high-dim...
Donglin Niu, Jennifer G. Dy, Michael I. Jordan