Sciweavers

1775 search results - page 116 / 355
» Learning Spectral Clustering
Sort
View
MLDM
2007
Springer
15 years 4 months ago
Kernel MDL to Determine the Number of Clusters
In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...
Ivan O. Kyrgyzov, Olexiy O. Kyrgyzov, Henri Ma&ici...
SODA
2001
ACM
147views Algorithms» more  SODA 2001»
14 years 11 months ago
Sublinear time approximate clustering
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
Nina Mishra, Daniel Oblinger, Leonard Pitt
ICONIP
2009
14 years 7 months ago
A Study on Clustering Method by Self-Organizing Map and Information Criteria
In this paper, we propose a clustering method by SOM and information criteria. In this method, initial cluster-candidates are derived by SOM, and then these candidates are merged a...
Satoru Kato, Tadashi Horiuchi, Yoshio Itoh
ICML
2004
IEEE
15 years 11 months ago
Automated hierarchical mixtures of probabilistic principal component analyzers
Many clustering algorithms fail when dealing with high dimensional data. Principal component analysis (PCA) is a popular dimensionality reduction algorithm. However, it assumes a ...
Ting Su, Jennifer G. Dy
SSDBM
2008
IEEE
114views Database» more  SSDBM 2008»
15 years 4 months ago
A General Framework for Increasing the Robustness of PCA-Based Correlation Clustering Algorithms
Abstract. Most correlation clustering algorithms rely on principal component analysis (PCA) as a correlation analysis tool. The correlation of each cluster is learned by applying P...
Hans-Peter Kriegel, Peer Kröger, Erich Schube...