766 search results - page 26 / 154 » Clustering high dimensional data using subspace and projecte... |
299
click to vote
DAWAK
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
142
click to vote
SOCO
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...
145
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
163
click to vote
ICDM
2007
IEEE
16 years 4 hour ago
2007
IEEE
Support vector clustering transforms the data into a high dimensional feature space, where a decision function is computed. In the original space, the function outlines the bounda...
153
click to vote
SIGIR
2004
ACM
15 years 11 months ago
2004
ACM
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...