Sciweavers

234 search results - page 12 / 47
» Spectral Clustering with Perturbed Data
Sort
View
NIPS
2004
13 years 9 months ago
Self-Tuning Spectral Clustering
We study a number of open issues in spectral clustering: (i) Selecting the appropriate scale of analysis, (ii) Handling multi-scale data, (iii) Clustering with irregular backgroun...
Lihi Zelnik-Manor, Pietro Perona
JCC
2008
105views more  JCC 2008»
13 years 7 months ago
Retrieval of spectral and dynamic properties from two-dimensional infrared pump-probe experiments
Abstract: We have developed a fitting algorithm able to extract spectral and dynamic properties of a three level oscillator from a two-dimensional infrared spectrum (2D-IR) detecte...
Riccardo Chelli, Victor V. Volkov, Roberto Righini
IJCNN
2007
IEEE
14 years 1 months ago
Spectral Clustering of Synchronous Spike Trains
— In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of syn...
António R. C. Paiva, Sudhir Rao, Il Park, J...
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 8 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
COLT
2004
Springer
14 years 28 days ago
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...