Generalized Expansion Dimension
Authors:
- Michael E. HouleMHMichael E. Houle
- Hisashi KashimaHKHisashi Kashima
- Michael NettMNMichael Nett
- 1 December 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23759232,p. 587-594
Abstract
In this paper we propose a framework for modeling the intrinsic dimensionality of data sets. The models can be viewed as generalizations of the expansion dimension, which was originally proposed for the analysis of certain similarity search indices using the Euclidean distance metric. Here, we extend the original model to other metric spaces: vector spaces with the L p or vector angle (cosine similarity) distance measures, as well as product spaces for categorical data. We also provide a practical guide for estimating both local and global intrinsic dimensionality. The estimates of data complexity can subsequently be used in the design and analysis of algorithms for data mining applications such as search, clustering, classification, and outlier detection.Keywords
This publication has 18 references indexed in Scilit:
- Dimensional Testing for Multi-step Similarity Search2012
- Density-preserving projections for large-scale local anomaly detectionKnowledge and Information Systems, 2011
- Finding Local Anomalies in Very High Dimensional Space2010
- Combinatorial Algorithms for Nearest Neighbors, Near-Duplicates and Small-World Design2009
- The Relevant‐Set Correlation Model for Data ClusteringStatistical Analysis and Data Mining: An ASA Data Science Journal, 2008
- Disorder inequality2008
- Cover trees for nearest neighbor2006
- Volumes of Generalized Unit BallsMathematics Magazine, 2005
- Bounded geometries, fractals, and low-distortion embeddings2004
- LOF2000