112 search results - page 2 / 23 » Spectral Clustering for a Large Data Set by Reducing the Sim... |
SDM
2003
SIAM
13 years 6 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
ESANN
2007
13 years 6 months ago
2007
Spectral data often have a large number of highly-correlated features, making feature selection both necessary and uneasy. A methodology combining hierarchical constrained clusteri...
DIS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examini...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
UAI
2003
13 years 6 months ago
2003
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...