165 search results - page 13 / 33 » Adaptive dimension reduction for clustering high dimensional... |
CSB
2003
IEEE
15 years 5 months ago
2003
IEEE
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
SDM
2010
SIAM
15 years 1 months ago
2010
SIAM
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
105
click to vote
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
CSDA
2006
14 years 11 months ago
2006
An approach to simultaneous document classification and word clustering is developed using a two-way mixture model of Poisson distributions. Each document is represented by a vect...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the problem of dimensionality reduction, where given high-dimensional data we want to estimate two mappings: from high to low dimension (dimensionality reduction) and f...