Generalized expansion dimension

Proceedings - 12th IEEE International Conference on Data Mining Workshops, ICDMW 2012

Volumn , Issue , 2012, Pages 587-594

  Houle, Michael E ^a   Kashima, Hisashi ^b   Nett, Michael ^a,b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CATEGORICAL DATA; COSINE SIMILARITY; DATA COMPLEXITY; DATA MINING APPLICATIONS; DATA SETS; DESIGN AND ANALYSIS OF ALGORITHMS; DISTANCE MEASURE; EUCLIDEAN DISTANCE; METRIC SPACES; ORIGINAL MODEL; OUTLIER DETECTION; PRACTICAL GUIDE; SIMILARITY SEARCH; VECTOR ANGLE;

DATA MINING;

EID: 84873108061     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDMW.2012.94     Document Type: Conference Paper

References (25)

1. K. S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When is "nearest neighbor" meaningful?" in ICDT, 1999, pp. 217-235.
2. V. Pestov, "On the geometry of similarity search: dimensionality curse and concentration of measure," Inf. Process. Lett., vol. 73, no. 1-2, pp. 47-51, 2000.
3. M. Radovanovic, A. Nanopoulos, and M. Ivanovic, "Hubs in space: Popular nearest neighbors in high-dimensional data," Journal of Machine Learning Research, vol. 11, pp. 2487-2531, 2010.
4. M. E. Houle, H.-P. Kriegel, P. Kröger, E. Schubert, and A. Zimek, "Can shared-neighbor distances defeat the curse of dimensionality?" in SSDBM, 2010, pp. 482-500.
5. A. Belussi and C. Faloutsos, "Estimating the selectivity of spatial queries using the 'correlation' fractal dimension," in VLDB, 1995, pp. 299-310.
6. B.-U. Pagel, F. Korn, and C. Faloutsos, "Deflating the dimensionality curse using multiple fractal dimensions," in ICDE, San Diego, CA, USA, 2000, pp. 589-598.
7. C. Faloutsos and I. Kamel, "Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension," in PODS, 1994, pp. 4-13.
8. K. L. Clarkson, "Nearest neighbor queries in metric spaces," Discrete & Comput. Geom., vol. 22, pp. 63-93, 1999.
9. X. Yang, S. Michea, and H. Zha, "Conical dimension as an intrinsic dimension estimator and its applications," in SDM, 2007, pp. 169-179.
10. D. R. Karger and M. Ruhl, "Finding nearest neighbors in growthrestricted metrics," in STOC, 2002, pp. 741-750.
11. A. Beygelzimer, S. Kakade, and J. Langford, "Cover trees for nearest neighbor," in ICML, 2006, pp. 97-104.
12. M. E. Houle and M. Nett, "Rank-Based Similarity Search: Reducing the Dimensional Dependence," National Institute of Informatics, Tech. Rep. NII-2012-004E, June 2012.
13. A. Gupta, R. Krauthgamer, and J. R. Lee, "Bounded geometries, fractals, and low-distortion embeddings," in FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, p. 534.
14. N. Goyal, Y. Lifshits, and H. Schütze, "Disorder inequality: a combinatorial approach to nearest neighbor search," in WSDM, 2008, pp. 25-32.
15. Y. Lifshits and S. Zhang, "Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design," in SODA, 2009, pp. 318-326.
16. M. E. Houle, X. Ma, M. Nett, and V. Oria, "Dimensional testing for multi-step similarity search," in ICDM, 2012.
17. T. de Vries, S. Chawla, and M. E. Houle, "Finding local anomalies in very high dimensional space," in ICDM, 2010, pp. 128-137.
18. - - , "Density-preserving projections for large-scale local anomaly detection," Knowl. Inf. Syst., vol. 32, no. 1, pp. 25-52, 2012.
19. J. Han and M. Kamber, Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000.
20. M. E. Houle, "The relevant-set correlation model for data clustering," in SDM, 2008, pp. 775-786.
21. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, "A density-based algorithm for discovering clusters in large spatial databases with noise," in KDD, 1996, pp. 226-231.
22. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander, "LOF: identifying density-based local outliers," in SIGMOD, 2000, pp. 93-104.
23. X. Wang, "Volumes of Generalized Unit Balls," Mathematics Magazine, vol. 78, no. 5, 2005.
24. M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan, "Time bounds for selection," J. Comput. Syst. Sci., vol. 7, no. 4, pp. 448-461, 1973.
25. V. Chvátal, "The tail of the hypergeometric distribution," Discrete Math., pp. 285-287, 1979.