434 search results - page 2 / 87 » Dimensionality Reduction of Clustered Data Sets |
VISSYM
2003
13 years 6 months ago
2003
Traditional visualization techniques for multidimensional data sets, such as parallel coordinates, glyphs, and scatterplot matrices, do not scale well to high numbers of dimension...
SDM
2004
SIAM
13 years 6 months ago
2004
SIAM
Clustering suffers from the curse of dimensionality, and similarity functions that use all input features with equal relevance may not be effective. We introduce an algorithm that...
KDD
2000
ACM
13 years 9 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
SDM
2010
SIAM
13 years 6 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...
NIPS
2004
13 years 6 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...