Sciweavers

475 search results - page 13 / 95
» A Distance-Based Packing Method for High Dimensional Data
Sort
View
ADAC
2010
110views more  ADAC 2010»
13 years 5 months ago
Robust classification for skewed data
In this paper we propose a robust classification rule for skewed unimodal distributions. For low dimensional data, the classifier is based on minimizing the adjusted outlyingness t...
Mia Hubert, Stephan Van der Veeken
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
SDM
2004
SIAM
253views Data Mining» more  SDM 2004»
13 years 9 months ago
Density-Connected Subspace Clustering for High-Dimensional Data
Several application domains such as molecular biology and geography produce a tremendous amount of data which can no longer be managed without the help of efficient and effective ...
Peer Kröger, Hans-Peter Kriegel, Karin Kailin...
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 9 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
PAKDD
2005
ACM
133views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Feature Selection for High Dimensional Face Image Using Self-organizing Maps
: While feature selection is very difficult for high dimensional, unstructured data such as face image, it may be much easier to do if the data can be faithfully transformed into l...
Xiaoyang Tan, Songcan Chen, Zhi-Hua Zhou, Fuyan Zh...