1385 search results - page 7 / 277 » Clustering by Random Projections |
ICML
2007
IEEE
16 years 13 days ago
2007
IEEE
We introduce a new inference algorithm for Dirichlet process mixture models. While Gibbs sampling and variational methods focus on local moves, the new algorithm makes more global...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...
112
click to vote
CVPR
2011
IEEE
14 years 3 months ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
104
click to vote
ICASSP
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper, we examine the problem of learning from noisecontaminated data in high-dimensional space. A new learning approach based on projections onto multi-dimensional ellips...
106
click to vote
ICASSP
2010
IEEE
14 years 11 months ago
2010
IEEE
Random projection has been suggested as a means of dimensionality reduction, where the original data are projected onto a subspace using a random matrix. It represents a computati...