Sciweavers

103 search results - page 3 / 21
» Projective ART for clustering data sets in high dimensional ...
Sort
View
DMIN
2008
152views Data Mining» more  DMIN 2008»
13 years 8 months ago
PCS: An Efficient Clustering Method for High-Dimensional Data
Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database ap...
Wei Li 0011, Cindy Chen, Jie Wang
ICDM
2003
IEEE
111views Data Mining» more  ICDM 2003»
14 years 20 days ago
OP-Cluster: Clustering by Tendency in High Dimensional Space
Clustering is the process of grouping a set of objects into classes of similar objects. Because of unknownness of the hidden patterns in the data sets, the definition of similari...
Jinze Liu, Wei Wang 0010
VLDB
2000
ACM
229views Database» more  VLDB 2000»
13 years 11 months ago
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
Many emerging application domains require database systems to support efficient access over highly multidimensional datasets. The current state-of-the-art technique to indexing hi...
Kaushik Chakrabarti, Sharad Mehrotra
PR
2007
100views more  PR 2007»
13 years 6 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
CIDM
2007
IEEE
14 years 1 months ago
Scalable Clustering for Large High-Dimensional Data Based on Data Summarization
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulk...