Projection-based partitioning for large, high-dimensional datasets

Journal of Computational and Graphical Statistics

Volumn 19, Issue 2, 2010, Pages 474-492

  Ilies, Iulian ^a   Wilhelm, Adalbert ^a  

^a JACOBS UNIVERSITY BREMEN   (Germany)

Author keywords

Average shifted histogram; Excess mass; Local minimum; Principal component analysis; Sampling

Indexed keywords

EID: 77956707404     PISSN: 10618600     EISSN: None     Source Type: Journal    
DOI: 10.1198/jcgs.2010.08038     Document Type: Article

References (43)

1. Aggarwal, C. C., and Yu, P. S. (2000), "Finding Generalized Projected Clusters in High Dimensional Spaces," in Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, New York: ACM, pp. 70-81. [476]
2. Aggarwal, C. C., Hinneburg, A., and Keim, D. A. (2001), "On the Surprising Behavior of Distance Metrics in High Dimensional Spaces," in Proceedings of the 8th International Conference on Database Theory, Berlin: Springer, pp. 420-434. [475,485]
3. Aggarwal, C. C, Wolf, J. L., Yu, P. S., Procopiuc, C, and Park, J. S. (1999), "Fast Algorithms for Projected Clustering," in Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, New York: ACM, pp. 61-72. [476]
4. Agrawal, R., Gehrke, J., Gunopulos, D., and Raghavan, P. (1998), "Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications," in Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, New York: ACM, pp. 94-105. [475,478]
5. Ankerst, M., Breunig, M. M., Kriegel, H.-P, and Sander, J. (1999), "OPTICS: Ordering Points to Identify the Clustering Structure," in Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, New York: ACM, pp. 49-60. [475]
6. Asuncion, A., and Newman, D. J. (2007), "UCI Machine Learning Repository," University of California at Irvine, School of Information and Computer Science, Irvine, CA, available at http://www.ics.uci.edu/~mlearn/ MLRepository.html. [486]
7. Becher, J., Berkhin, P., and Freeman, E. (2000), "Automating Exploratory Data Analysis for Efficient Data Mining," in Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York: ACM, pp. 424-429. [475,488]
8. Berkhin, P. (2006), "A Survey of Clustering Data Mining Techniques," in Grouping Multidimensional Data: Recent Advances in Clustering, eds. J. Kogan, C. Nicholas, and M. Teboulle, Berlin: Springer, pp. 25-71. [475]
9. Boley, D. (1998), "Principal Direction Divisive Partitioning," Data Mining and Knowledge Discovery, 2 (4), 325-344. [475,478]
10. Breunig, M., Kriegel, H.-P, Kröger, P., and Sander, J. (2001), "Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering," in Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, New York: ACM, pp. 79-90. [475]
11. Candillier, L., Tellier, I., Torre, F, and Bousquet, O. (2005), "SSC: Statistical Subspace Clustering," in Machine Learning and Data Mining in Pattern Recognition: 4th International Conference, Berlin: Springer, pp. 100-109. [476]
12. Chang, W. C. (1983), "On Using Principal Components Before Separating a Mixture of Two Multivariate Normal Distributions," Journal of the Royal Statistical Society, Ser. C, 32 (3), 267-275. [483]
13. Faloutsos, C, and Lin, K. (1995), "FastMap: A Fast Algorithm for Indexing, Data Mining and Visualization of Traditional and Multimedia Datasets," in Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, New York: ACM, pp. 163-174. [475]
14. Fern, X. Z., and Brodley, C. E. (2003), "Random Projection for High Dimensional Data Clustering: A Cluster Ensemble Approach," in Proceedings of the 20th International Conference on Machine Learning, Menlo Park, CA: AIII Press, pp. 186-193. [476]
15. Fraley, C, and Raftery, A. E. (1999), "MCLUST: Software for Model-Based Cluster Analysis," Journal of Classification, 16 (2), 297-306. [485]
16. Ganti, V., Ramakrishnan, R., Gehrke, J., Powell, A., and French, J. (1999), "Clustering Large Datasets in Arbitrary Metric Spaces," in Proceedings of the 15th International Conference on Data Engineering, Washington: IEEE Computer Society, pp. 502-511. [475]
17. Guha, S., Rastogi, R., and Shim, K. (1998), "CURE: An Efficient Clustering Algorithm for Large Databases," in Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, New York: ACM, pp. 73-84. [475]
18. Hartigan, J. A. (1981), "Consistency of Single Linkage for High-Density Clusters," Journal of the American Statistical Association, 76 (374), 388-394. [476]
19. - (1987), "Estimation of a Convex Density Contour in Two Dimensions," Journal of the American Statis tical Association, 82 (397), 267-270. [481]
20. Hartigan, J. A., and Hartigan, P. M. (1985), "The Dip Test of Unimodality," The Annals of Statistics, 13 (1), 70-84. [479]
21. Hennig, C. (2004), "Asymmetric Linear Dimension Reduction for Classification," Journal of Computational and Graphical Statistics, 13 (4), 930-945. [488]
22. Hinneburg, A., and Keim, D. A. (1999), "Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering," in Proceedings of the 25th International Conference on Very Large Data Bases, San Francisco, CA: Kaufmann, pp. 506-517. [475,476,478,481, 489]
23. Huber, P. J. (1985), "Projection Pursuit," The Annals of Statistics, 13 (2), 435-475. [476,483,484]
24. Hubert, L., and Arabie, P. (1985), "Comparing Partitions," Journal of Classification, 2 (1), 193-218. [475,478]
25. Ilies, I., and Wilhelm, A. (2008), "Projection-Based Clustering for High-Dimensional Data Sets," in COMPSTAT 2008: Proceedings in Computational Statistics, Heidelberg: Physica Verlag. [482]
26. Kogan, J. (2007), Introduction to Clustering Large and High-Dimensional Data, New York, NY: Cambridge University Press. [475]
27. Liu, B., Xia, Y, and Yu, P. S. (2000), "Clustering Through Decision Tree Construction," in Proceedings of the 9th International Conference on Information and Knowledge Management, New York: ACM, pp. 20-29. [476,477]
28. Mangasarian, O. L., and Wolberg, W. H. (1990), "Cancer Diagnosis via Linear Programming," SIAM News, 23 (5), 1-18. [486]
29. Milenova, B. L., and Campos, M. M. (2002), "O-Cluster: Scalable Clustering of Large High Dimensional Data Sets," in Proceedings of the 2002 IEEE International Conference on Data Mining, Washington: IEEE Computer Society, pp. 290-297. [476,478,481]
30. Nagesh, H., Goil, S., and Choudhary, A. (2001), "Adaptive Grids for Clustering Massive Data Sets," in Proceedings of the First SIAM Conference on Data Mining, Philadelphia, PA: SIAM. [476]
31. Parsons, L., Haque, E., and Liu, H. (2004), "Subspace Clustering for High Dimensional Data: A Review," ACM SIGKDD Explorations Newsletter, 6 (1), 90-105. [475]
32. Procopiuc, C. M., Jones, M., Agarwal, P. K., and Murali, T. M. (2002), "A Monte Carlo Algorithm for Fast Projective Clustering," in Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, New York: ACM, pp. 418-427. [476]
33. Quinlan, L. R. (1986), "Induction of Decision Trees," Machine Learning, 1 (1), 81-106. [477]
34. Raftery, A. E., and Dean, N. (2006), "Variable Selection for Model-Based Clustering," Journal of the American Statistical Association, 101 (473), 168-178. [476]
35. Savaresi, S. M., Boley, D. L., Bittanti, S., and Gazzaniga, G. (2002), "Cluster Selection in Divisive Clustering Algorithms," in Proceedings of the 2nd SIAM International Conference on Data Mining, Philadelphia, PA: SIAM, pp. 299-314. [477]
36. Schölkopf, B., Smola, A., and Müller, K.-R. (1998), "Nonlinear Component Analysis as a Kernel Eigenvalue Problem," Neural Computation, 10(5), 1299-1319. [489]
37. Scott, D. W. (1992), Multivariate Density Estimation: Theory, Practice, and Visualization, New York: Wiley. [477,480,481]
38. Siebert, J. P. (1987), "Rule-Based Vehicle Recognition," Research memorandum, Turing Institute, Glasgow, U.K. [486]
39. Sigillito, V G., Wing, S. P., Hutton, L. V, and Baker, K. B. (1989), "Classification of Radar Returns From the Ionosphere Using Neural Networks," Johns Hopkins APL Technical Digest, 10 (3), 262-266. [486]
40. Stuetzle, W (2003), "Estimating the Cluster Tree of a Density by Analyzing the Minimal Spanning Tree of a Sample," Journal of Classification, 20 (1), 25-47. [481]
41. Stuetzle, W, and Nugent, R. (2010), "A Generalized Single Linkage Method for Estimating the Cluster Tree of a Density," Journal of Computational and Graphical Statistics, 19, 397-418. [481,489]
42. Teboulle, M., and Kogan, J. (2005), "Deterministic Annealing and a £-Means Type Smoothing Optimization Algorithm for Data Clustering," in Proceedings of the Workshop on Clustering High Dimensional Data and Its Applications, pp. 13-22, available at http://www.siam.org/meetings/sdm05/ downloads.htm. [475]
43. Zhang, T, Ramakrishnan, R., and Livny, M. (1997), "BIRCH: A New Data Clustering Algorithm and Its Applications," Data Mining and Knowledge Discovery, 1 (2), 141-182. [475]