Sciweavers

1775 search results - page 89 / 355
» Learning Spectral Clustering
Sort
View
ICPR
2008
IEEE
15 years 4 months ago
Graph drawing using quantum commute time
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
David Emms, Edwin R. Hancock, Richard C. Wilson
IJON
2008
116views more  IJON 2008»
14 years 10 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter
ICML
2007
IEEE
15 years 10 months ago
Robust non-linear dimensionality reduction using successive 1-dimensional Laplacian Eigenmaps
Non-linear dimensionality reduction of noisy data is a challenging problem encountered in a variety of data analysis applications. Recent results in the literature show that spect...
Samuel Gerber, Tolga Tasdizen, Ross T. Whitaker
ECML
2006
Springer
15 years 1 months ago
Efficient Prediction-Based Validation for Document Clustering
Recently, stability-based techniques have emerged as a very promising solution to the problem of cluster validation. An inherent drawback of these approaches is the computational c...
Derek Greene, Padraig Cunningham
SDM
2004
SIAM
225views Data Mining» more  SDM 2004»
14 years 11 months ago
Active Semi-Supervision for Pairwise Constrained Clustering
Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constra...
Sugato Basu, Arindam Banerjee, Raymond J. Mooney