Sciweavers

165 search results - page 9 / 33
» Adaptive dimension reduction for clustering high dimensional...
Sort
View
BMCBI
2007
123views more  BMCBI 2007»
14 years 11 months ago
Robust clustering in high dimensional data using statistical depths
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
Yuanyuan Ding, Xin Dang, Hanxiang Peng, Dawn Wilki...
APWEB
2006
Springer
15 years 3 months ago
Generalized Projected Clustering in High-Dimensional Data Streams
Clustering is to identify densely populated subgroups in data, while correlation analysis is to find the dependency between the attributes of the data set. In this paper, we combin...
Ting Wang
ICDM
2003
IEEE
111views Data Mining» more  ICDM 2003»
15 years 5 months 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
ICML
1995
IEEE
16 years 15 days ago
Visualizing High-Dimensional Structure with the Incremental Grid Growing Neural Network
Understanding high-dimensional real world data usually requires learning the structure of the data space. The structure maycontain high-dimensional clusters that are related in co...
Justine Blackmore, Risto Miikkulainen
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
13 years 2 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...