Sciweavers

298 search results - page 11 / 60
» Subspace Clustering of High Dimensional Data
Sort
View
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
15 years 2 months ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy
PR
2006
116views more  PR 2006»
15 years 10 days ago
Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
Clustering algorithms are routinely used in biomedical disciplines, and are a basic tool in bioinformatics. Depending on the task at hand, there are two most popular options, the ...
Stefano Rovetta, Francesco Masulli
ICML
1995
IEEE
16 years 1 months 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
NIPS
2008
15 years 1 months ago
Diffeomorphic Dimensionality Reduction
This paper introduces a new approach to constructing meaningful lower dimensional representations of sets of data points. We argue that constraining the mapping between the high a...
Christian Walder, Bernhard Schölkopf
113
Voted
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
15 years 5 months ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos