Sciweavers

103 search results - page 8 / 21
» Projective ART for clustering data sets in high dimensional ...
Sort
View
ICPP
2000
IEEE
13 years 11 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
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
NIPS
2003
13 years 8 months ago
Locality Preserving Projections
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
Xiaofei He, Partha Niyogi
SSDBM
2006
IEEE
123views Database» more  SSDBM 2006»
14 years 1 months ago
Mining Hierarchies of Correlation Clusters
The detection of correlations between different features in high dimensional data sets is a very important data mining task. These correlations can be arbitrarily complex: One or...
Elke Achtert, Christian Böhm, Peer Kröge...
CIBCB
2006
IEEE
14 years 1 months ago
Visualization of Support Vector Machines with Unsupervised Learning
– The visualization of support vector machines in realistic settings is a difficult problem due to the high dimensionality of the typical datasets involved. However, such visuali...
Lutz Hamel