Clustering high dimensional data

Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery

Volumn 2, Issue 4, 2012, Pages 340-350

  Assent, Ira ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA MINING;

ALGORITHMIC APPROACH; CLUSTER DETECTION; COMPUTATIONAL PROBLEM; CURSE OF DIMENSIONALITY; HIGH DIMENSIONAL DATA; HIGH DIMENSIONAL SPACES; RECENT RESEARCHES; TRADITIONAL CLUSTERING;

CLUSTERING ALGORITHMS;

EID: 84866466048     PISSN: 19424787     EISSN: 19424795     Source Type: Journal    
DOI: 10.1002/widm.1062     Document Type: Article

References (53)

1. Jiang D, Tang C, Zhang A. Cluster analysis for gene expression data: a survey. IEEE Trans Knowl Data Eng 2004, 16:1370-1386.
2. Bhaskar H, Hoyle D, Singh S. Machine learning in bioinformatics: a brief survey and recommendations for practitioners. Comput Biol Med 2006, 36:1104-1125.
3. Kailing K, Kriegel H, Kröger P, Wanka S. Ranking interesting subspaces for clustering high dimensional data. In: Knowledge Discovery in Databases: PKDD 2003. Cavtat-Dubrovnik, Croatia: Springer; 2003, 241-252.
4. Jain A, Murty M, Flynn P. Data clustering: a review. ACM Comput Surv 1999, 31:264-323.
5. Xu R, Wunsch D. Survey of clustering algorithms. IEEE Trans Neural Netw 2005, 16:645-678.
6. Berkhin P. A survey of clustering data mining techniques. In: Kogan J, Nicholas C, Teboulle M, eds. Grouping Multidimensional Data, Recent Advances in Clustering. Heidelberg: Springer; 2006, 25-71.
7. Eisen M, Spellman P, Brown P, Botstein D. Cluster analysis and display of genome-wide expression patterns. Proc Natl Acad Sci USA 1998, 95:14863-14868.
8. Murtagh F, Contreras P. Algorithms for hierarchical clustering: an overview. Wiley Interdiscip Rev: Data Min Knowl Discov 2012, 2:86-97.
9. Bellman R. Dynamic Programming. Princeton, NJ: Princeton University Press; 1957.
10. Kuo F, Sloan I. Lifting the curse of dimensionality. Notices Am Math Soc 2005, 52:1320.
11. Beyer K, Goldstein J, Ramakrishnan R, Shaft U. When is nearest neighbor meaningful? In: Beeri C, Buneman P, eds. Database Theory ICDT99. Lecture Notes in Computer Science. Vol. 1540. Berlin/Heidelberg: Springer; 1999, 217-235.
12. Kaufman L, Rousseeuw P. Finding Groups in Data: An Introduction to Cluster Analysis. New York: John Wiley & Sons; 1990.
13. Xiao Y, Yu J. Partitive clustering (K-means family). Wiley Interdiscip Rev: Data Min Knowl Discov 2012, 2:209-225.
14. Hinneburg A, Aggarwal C, Keim D. What Is the Nearest Neighbor in High Dimensional Spaces? In: Proceedings of the 26th International Conference on Very Large Data Bases. San Francisco, CA: Morgan Kaufmann; 2000, 515.
15. Aggarwal C, Hinneburg A, Keim D. On the surprising behavior of distance metrics in high dimensional space. In: Database Theory ICDT 2001. London, UK: Springer; 2001, 420-434.
16. Ester M, Kriegel H, Sander J, Xu X. A densitybased algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining. Vol. 96. Portland, Oregon: AAAI Press; 1996, 226-231.
17. Kriegel HP, Kröger P, Sander J, Zimek A. Densitybased clustering. Wiley Interdiscip Rev: Data Min Knowl Discov 2011, 1:231-240.
18. Assent I, Krieger R, Müller E, Seidl T. DUSC: dimensionality unbiased subspace clustering. In: Seventh IEEE International Conference on Data Mining. ICDM 2007. Omaha, Nebraska: IEEE; 2008, 409-414.
19. Hinneburg A, Keim D. An efficient approach to clustering in large multimedia databases with noise. In: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining. New York City, NY: American Association for Artificial Intelligence; 1998:58.
20. Silverman B. Density estimation for statistics and data analysis. In: Monographs on Statistics and Applied Probability. New York: Chapman and Hall; 1986.
21. Joliffe I. Principal Component Analysis. New York: Springer-Verlag; 1986.
22. Yang L. Distance-preserving dimensionality reduction. Wiley Interdiscip Rev: Data Min Knowl Discov 2011, 1:369-380. [http://dx.doi.org/10.1002/widm.39].
23. Ding C, He X, Zha H, Simon H. Adaptive dimension reduction for clustering high dimensional data. In: Proceedings of the 2002 IEEE International Conference on Data Mining. Maebashi City, Japan: IEEE Computer Society; 2002, 147.
24. Fern X, Brodley C. Random projection for high dimensional data clustering: a cluster ensemble approach. In: Fawcett T, MishraN, eds. The Twentieth International Conference on Machine Learning. Menlo Park, CA: AAAI Press; 2003.
25. Liu H, Yu L. Toward integrating feature selection algorithms for classification and clustering. IEEE Trans Knowl Data Eng 2005, 17:491-502.
26. Agrawal R, Gehrke J, Gunopulos D, Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. ACM SIGMOD Record 1998, 27:94-105.
27. Kriegel H, Kröger P, Zimek A. Clustering highdimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans Knowl Discov Data 2009, 3:1-58.
28. Müller E, Günnemann S, Assent I, Seidl T. Evaluating clustering in subspace projections of high dimensional data. PVLDB 2009, 2:1270-1281.
29. Moise G, Zimek A, Kröger P, Kriegel H, Sander J. Subspace and projected clustering: experimental evaluation and analysis. Knowl Inf Syst 2009, 21:299-326.
30. Parsons L, Haque E, Liu H. Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor Newslett 2004, 6:90-105.
31. Domeniconi C, Gunopulos D, Ma S, Yan B, Al Razgan M, Papadopoulos D. Locally adaptive metrics for clustering high dimensional data. Data Min Knowl Discov 2007, 14:63-97.
32. Dempster A, Laird N, Rubin D. Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc B 1977, 39:1-38.
33. Cheng C, Fu A, Zhang Y. Entropy-based subspace clustering for mining numerical data. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. San Diego, CA: ACM; 1999, 84-93.
34. Ankerst M, Breunig M, Kriegel H, Sander J. OPTICS: ordering points to identify the clustering structure. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. Philadelphia, PA: ACM; 1999, 49-60.
35. Madeira S, Oliveira A. Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Trans Computat Biol Bioinf 2004, 1:24-45.
36. Busygin S, Prokopyev O, Pardalos PM. Biclustering in data mining. Comput Oper Res 2008, 35:2964-2987.
37. Sheikholeslami G, Chatterjee S, Zhang A.Wavecluster: a multi-resolution clustering approach for very large spatial databases. In: In Proceedings of the 24th VLDB Conference. 1998, 289-304.
38. Wang W, Yang J, Muntz R. STING: a statistical information grid approach to spatial data mining. In: Proceedings of the International Conference on Very LargeData Bases. Athens, Greece: Morgan Kaufmann; 1997, 186-195.
39. Hinneburg A, Keim D. Optimal grid-clustering: towards breaking the curse of dimensionality in highdimensional clustering. In: Proceedings of the 25th International Conference on Very Large Data Bases. Edinburgh, Scotland: Morgan Kaufmann. 1999, 506-517.
40. Milenova B, Campos M. O-Cluster: scalable clustering of large high dimensional data sets. In: Proceedings of 2002 IEEE International Conference on Data Mining, 2002. ICDM 2002. Maebashi City, Japan: IEEE; 2003, 290-297.
41. Verleysen M, François D. The curse of dimensionality in data mining and time series prediction. In: Cabestany J, Prieto A, Hernández FS, eds. Computational Intelligence and Bioinspired Systems. Lecture Notes in Computer Science. Heidelberg: Springer; 2005, 758-770.
42. Keogh E, Kasetty S. On the need for time series data mining benchmarks: a survey and empirical demonstration. Data Min Knowl Discov 2003, 7:349-371.
43. Liao W. Clustering of time series data-a survey. Pattern Recognit 2005, 38:1857-1874.
44. Lin J, Keogh E, Wei L, Lonardi S. Experiencing SAX: a novel symbolic representation of time series. Data Min Knowl Discov 2007, 15:107-144.
45. Zhao Y, Karypis G. Empirical and theoretical comparisons of selected criterion functions for document clustering. Mach Learn 2004, 55:311-331.
46. Steinbach M, Ertöz L, Kumar V. The challenges of clustering high-dimensional data. In: Wille LT, ed., New Directions in Statistical Physics: Bioinformatics and Pattern Recognition. Heidelberg: Springer; 2003, 273-307.
47. France SL, Carroll JD, Xiong H. Distance metrics for high dimensional nearest neighborhood recovery: compression and normalization. Inf Sci 2012, 184:92-110.
48. Cai D, He X, Han J. Document clustering using locality preserving indexing. IEEE Trans Knowl Data Eng 2005, 17:1624-1637.
49. Dhillon I. Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. San Francisco, CA: ACM; 2001, 269-274.
50. Dhillon I, Guan Y, Kulis B. Kernel k-means: spectral clustering and normalized cuts. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Seattle, WA: ACM; 2004, 551-556.
51. Filippone M, Camastra F, Masulli F, Rovetta S. A survey of kernel and spectral methods for clustering. Pattern Recognit 2008, 41:176-190.
52. Andrews N.O., Fox E.A. Recent developments in document clustering. Technical Report TR-07-35, Department of Computer Science, Virginia Tech. Blacksburg, VA; 2007.
53. Strehl A, Ghosh J. Relationship-based clustering and visualization for high-dimensional data mining. INFORMS J Comput 2003, 15:208-230.