Analyzing high-dimensional data by subspace validity

Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, Daniel Keim, Markus Wawryniuk

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We are proposing a novel method that makes it possible to analyze high dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method lies the idea of subspace validity. We map the data in a way that allows us to test the quality of subspaces using statistical tests. Experimental results, both on synthetic and real data sets, demonstrate the potential of our method.

Original languageEnglish
Title of host publicationProceedings - 3rd IEEE International Conference on Data Mining, ICDM 2003
Pages473-476
Number of pages4
StatePublished - 2003
Event3rd IEEE International Conference on Data Mining, ICDM '03 - Melbourne, FL, United States
Duration: 19 Nov 200322 Nov 2003

Publication series

NameProceedings - IEEE International Conference on Data Mining, ICDM
ISSN (Print)1550-4786

Conference

Conference3rd IEEE International Conference on Data Mining, ICDM '03
Country/TerritoryUnited States
CityMelbourne, FL
Period19/11/0322/11/03

Fingerprint

Dive into the research topics of 'Analyzing high-dimensional data by subspace validity'. Together they form a unique fingerprint.

Cite this