Sciweavers

325 search results - page 8 / 65
» On Clusterings - Good, Bad and Spectral
Sort
View
ECML
2007
Springer
14 years 1 months ago
Spectral Clustering and Embedding with Hidden Markov Models
Abstract. Clustering has recently enjoyed progress via spectral methods which group data using only pairwise affinities and avoid parametric assumptions. While spectral clustering ...
Tony Jebara, Yingbo Song, Kapil Thadani
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 7 months ago
Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurements
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
Blake Hunter, Thomas Strohmer
CIMCA
2005
IEEE
14 years 29 days ago
A New Evolutionary Algorithm for Determining the Optimal Number of Clusters
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
Wei Lu, Issa Traoré
BMCBI
2005
120views more  BMCBI 2005»
13 years 7 months ago
SpectralNET - an application for spectral graph analysis and visualization
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
Joshua J. Forman, Paul A. Clemons, Stuart L. Schre...
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 8 months ago
Clustering by weighted cuts in directed graphs
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
Marina Meila, William Pentney