On the design and applicability of distance functions in high-himensional data space

IEEE Transactions on Knowledge and Data Engineering

Volumn 21, Issue 4, 2009, Pages 523-536

  Hsu, Chih Ming ^a   Chen, Ming Syan ^a,b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b RESEARCH CENTER FOR INFORMATION TECHNOLOGY INNOVATION   (Taiwan)

Author keywords

Classification; Curse of dimensionality; Data clustering; Nearest neighbor search

Indexed keywords

CLASSIFICATION; CLUSTERING APPLICATIONS; CURSE OF DIMENSIONALITY; DATA CLUSTERING; DATA SPACES; DATA-MINING PROBLEMS; DISTANCE DISTRIBUTIONS; DISTANCE FUNCTIONS; DISTANCE-BASED; EFFECTIVE DISTANCES; EUCLIDEAN SPACES; HIGH-DIMENSIONAL DATA SPACES; HIGH-DIMENSIONAL SPACES; NEAREST NEIGHBOR SEARCH; THEORETICAL RESULTS; UNSTABILITY;

CLUSTERING ALGORITHMS; ELECTRIC NETWORK ANALYSIS; IMAGE RETRIEVAL; INFORMATION MANAGEMENT;

CLUSTER ANALYSIS;

EID: 61449115942     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2008.178     Document Type: Article

References (28)

1. C.C. Aggarwal, "Re-Designing Distance Functions and Distance-Based Applications for High Dimensional Data," SIGMOD Record, vol. 30, pp. 13-18, 2001.
2. C.C. Aggarwal, A. Hinneburg, and D.A. Keim, "On the Surprising Behavior of Distance Metrics in High Dimensional Spaces," Proc. Eighth Int'l Conf. Database Theory (ICDT '01), vol. 1973, pp. 420-434, 2001.
3. C.C. Aggarwal and P.S. Yu, "The IGrid Index: Reversing the Dimensionality Curse for Similarity Indexing in High Dimensional Space," Proc. Sixth ACM SIGKDD Int'l Conf. Knowledge Discovert) and Data Mining (KDD '00), pp. 119-129, 2000.
4. K.P. Bennett, U. Fayyad, and D. Geiger, "Density-Based Indexing for Approximate Nearest-Neighbor Queries," Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '99), pp. 233-243, 1999.
5. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When is Nearest Neighbors Meaningful?" Proc. Seventh Int'l Conf. Database Theory (ICDT '99), vol. 1540, pp. 217-235, 1999.
6. A. Hinneburg, C.C. Aggarwal, and D.A. Keim, "What is the Nearest Neighbor in High Dimensional Spaces?" Proc. 26th Int'l Conf. Very Large Data Bases (VLDB '00), pp. 506-515, 2000.
7. C.C. Aggarwal, "Towards Systematic Design of Distance Functions for Data Mining Applications," Proc. Ninth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '03), pp. 9-18, 2003.
8. D. Francois, M.-V. Wertz, and S.M.-M. Verleysen, "The Concentration of Fractional Distances," IEEE Trans. Knowledge and Data Eng., vol. 19, no. 7, pp. 873-886, July 2007.
9. N. Katayama and S. Satoh, "Distinctiveness-Sensitive Nearest Neighbor Search for Efficient Similarity Retrieval of Multimedia Information," Proc. 17th Int'l Conf. Data Eng. (ICDE '01), pp. 493-502, 2001.
10. M. Ledoux, The Concentration of Measure Phenomenon. Am. Math. Soc, 2001.
11. V.D. Milman and G. Schechtman, Asymptotic Theory of Finite Dimensional Normed Spaces. Springer-Verlag, 1986.
12. V. Pestov, "On the Geometry of Similarity Search: Dimensionality Curse and Concentration of Measure," Information Processing Letters, vol. 73, nos. 1/2, pp. 47-51, 2000.
13. A.C. Tamhane and D.D. Dunlop, Statistics and Data Analysis: From Elementary to Intermediate. Prentice Hall, 2000.
14. W.Q. Meeker and L.A. Meeker, Statistical Methods for Reliability Data. Wiley, 1998.
15. W.J. Ewens and G.R. Grant, Statistical Methods in Bioinformatics, second ed. Springers, 2005.
16. P.J. Bickel and K.A. Doksum, Mathematical Statistics: Basic Ideas and Selected Topics, second ed., vol. 1. Prentice Hall, 2001.
17. V.K. Rohatgi and A.K.M.E. Saleh, Introduction to Probability and Statistics, second ed. Wiley, 2001.
18. G.G. Roussas, A Course in Mathematical Statistics, second ed. Academic Press, 1997.
19. B. Efron and R. Tibshirani, An Introduction to the Bootstrap. Chapman and Hall, 1993.
20. E.L. Lehmann, Testing Statistical Hypotheses, second ed. 1997.
21. T.F. Cox and M.A. Cox, Multidimensional Scaling. Chapman and Hall, 1994.
22. I. Guyon, S. Gunn, M. Nikravesh, and L.A. Zadeh, Feature Extraction: Foundations and Applications. Springer-Verlag, 2006.
23. L. Ertöz, M. Steinbach, and V. Kumar, "Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data," Proc. Third SIAM Int'l Conf. Data Mining (SDM), 2003.
24. A.K. Jain, M.N. Murty, and P.J. Flynn, "Data Clustering: A Review," ACM Computing Surveys, vol. 31, no. 3, pp. 264-323, 1999.
25. H. Zhou and D. Woodruff, "Clustering via Matrix Powering," Proc. 23rd ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS '04), pp. 136442, 2004.
26. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning. Springer, 2001.
27. K.L. Chung, A Course in Probability Theory, third ed. Academic Press, 2001.
28. H.A. David and H.N. Nagaraja, Order Statistics, third ed. John Wiley & Sons, 2003.