164 search results - page 4 / 33 » HD-Eye - Visual Clustering of High dimensional Data |
SIGMOD
2000
ACM
13 years 10 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
VLDB
2000
ACM
13 years 10 months ago
2000
ACM
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...
SDM
2012
SIAM
11 years 8 months ago
2012
SIAM
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 ...
ECML
2006
Springer
13 years 10 months ago
2006
Springer
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
BMCBI
2007
13 years 6 months ago
2007
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...