Sciweavers

169 search results - page 3 / 34
» Reductions among high dimensional proximity problems
Sort
View
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
14 years 14 days ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...
SIGMOD
2001
ACM
142views Database» more  SIGMOD 2001»
14 years 7 months ago
Outlier Detection for High Dimensional Data
The outlier detection problem has important applications in the eld of fraud detection, network robustness analysis, and intrusion detection. Most such applications are high dimen...
Charu C. Aggarwal, Philip S. Yu
ICDE
2002
IEEE
91views Database» more  ICDE 2002»
14 years 14 days ago
Lossy Reduction for Very High Dimensional Data
We consider the use of data reduction techniques for the problem of approximate query answering. We focus on applications for which accurate answers to selective queries are requi...
Chris Jermaine, Edward Omiecinski
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
14 years 7 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
VISSYM
2003
13 years 9 months ago
Visual Hierarchical Dimension Reduction for Exploration of High Dimensional Datasets
Traditional visualization techniques for multidimensional data sets, such as parallel coordinates, glyphs, and scatterplot matrices, do not scale well to high numbers of dimension...
Jing Yang, Matthew O. Ward, Elke A. Rundensteiner,...