Sciweavers

581 search results - page 1 / 117
» EM in High Dimensional Spaces
Sort
View

Publication
110views
13 years 4 months ago
EM in High Dimensional Spaces
B. Draper, D.L. Elliott, J. Hayes, and K. Baek
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
13 years 10 months ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...
NIPS
1997
13 years 6 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
EM
2010
134views Management» more  EM 2010»
13 years 5 months ago
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
Abstract. The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and...
Hans D. Mittelmann, Frank Vallentin
PCM
2001
Springer
183views Multimedia» more  PCM 2001»
13 years 9 months ago
An Adaptive Index Structure for High-Dimensional Similarity Search
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
Peng Wu, B. S. Manjunath, Shivkumar Chandrasekaran