Projective clustering ensembles

Data Mining and Knowledge Discovery

Volumn 26, Issue 3, 2013, Pages 452-511

  Gullo, Francesco ^a   Domeniconi, Carlotta ^b   Tagarelli, Andrea ^c  

^a DEIS Department University of Calabria ^*

^b UNIVERSITY OF CALABRIA   (Italy)

^c Krasnow Institute for Advanced Study   (United States)

Author keywords

Clustering; Clustering ensembles; Multi objective optimization; Projective clustering

Indexed keywords

CLUSTER ANALYSIS; MULTIOBJECTIVE OPTIMIZATION; PROBLEM SOLVING;

CLUSTERING; CLUSTERING ENSEMBLE; CONSENSUS CLUSTERING; EXPERIMENTAL EVALUATION; OPTIMIZATION PROBLEMS; PROJECTIVE CLUSTERING; SINGLE OBJECTIVE OPTIMIZATION; TWO-OBJECTIVE OPTIMIZATION;

CLUSTERING ALGORITHMS;

EID: 84902551612     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-012-0266-x     Document Type: Article

References (86)

1. Achtert E, Böhm C, Kriegel H-P, Kröger P, Müller-Gorman I, Zimek A (2006) Finding hierarchies of subspace clusters. In: Proceedings of the European conference on principles and practice of knowledge discovery in databases (PKDD), pp 446-453
2. Achtert E, Böhm C, Kriegel H-P, Kröger P, Müller-Gorman I, Zimek A (2007) Detection and visualization of subspace cluster hierarchies. In: Proceedings of the international conference on database systems for advanced applications (DASFAA), pp 152-163
3. Aggarwal CC, Procopiuc CM,Wolf JL, Yu PS, Park JS (1999) Fast algorithms for projected clustering. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 61-72 (Pubitemid 129597324)
4. Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings ACM SIGMOD international conference on management of data, pp 94-105
5. Ankerst M, Breunig MM, Kriegel H-P, Sander J (1999) OPTICS: ordering points to identify the clustering structure. In: Proceedings ACMSIGMOD international conference on management of data, pp 49-60 (Pubitemid 129597323)
6. Assent I, Krieger R, Müller E, Seidl T (2008) EDSC: efficient density-based subspace clustering. In: Proceedings ACM conference on information and knowledge management (CIKM), pp 1093-1102
7. Asuncion A, Newman DJ (2010) UCI machine learning repository. http://archive.ics.uci.edu/ml/
8. Ayad H, KamelMS (2003) Finding natural clusters using multi-clusterer combiner based on shared nearest neighbors. In: Proceedings of the international workshop on multiple classifier systems (MCS), pp 166-175
9. Barthélemy JP, Leclerc B (1995) The median procedure for partitions. Partit Data Sets 19:3-33
10. Bellman R (1961) Adaptive control processes: a guided tour. Princeton University Press, Princeton
11. Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is "nearest neighbor" meaningful? In: Proceedings of the international conference on database theory (ICDT), pp 217-235
12. Böhm C, Kailing K, Kriegel HP, Kröger P (2004) Density connected clustering with local subspace preferences. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 27-34
13. Boulis C, Ostendorf M (2004) Combining multiple clustering systems. In: Proceedings of the European conference on principles and practice of knowledge discovery in databases (PKDD), pp 63-74
14. Bradley PS, Fayyad UM (1998) Refining initial points for k-means clustering. In: Proceedings of the international conference on machine learning (ICML), pp 91-99
15. Breiman L (1996) Bagging predictors. Mach Learn 24(2):123-140 (Pubitemid 126724382)
16. Caruana R, Elhawary MF, Nguyen N, Smith C (2006) Meta clustering. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 107-118
17. Chen L, Jiang Q, Wang S (2008) A probability model for projective clustering on high dimensional data. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 755-760
18. Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York
19. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182-197 (Pubitemid 34555372)
20. Dempster AP, LairdNM, RdinDB (1977) Maximum likelihood from incomplete data via theEMalgorithm. J R Stat Soc 39:1-38
21. Dimitriadou E, Weingesse A, Hornik K (2001) Voting-merging: an ensemble method for clustering. In: Proceedings of the international conference on artificial neural networks (ICANN), pp 217-224
22. Domeniconi C, Al-Razgan M (2009) Weighted cluster ensembles: methods and analysis. In: ACM Trans Knowl Disc Data (TKDD), 2(4)
23. Domeniconi C, Gunopulos D,MaS,YanB,Al-Razgan M, PapadopoulosD (2007) Locally adaptive metrics for clustering high dimensional data. Data Min Knowl Disc 14(1):63-97 (Pubitemid 46345356)
24. Dudoit S, Fridlyand J (2003) Bagging to improve the accuracy of a clustering procedure. Bioinformatics 19(9):1090-1099 (Pubitemid 36790010)
25. Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the international conference on knowledge discovery and data mining (KDD), pp 226-231
26. Fern XZ, Brodley CE (2004) Solving cluster ensemble problems by bipartite graph partitioning. In: Proceedings of the international conference on machine learning (ICML), pp 281-288 (Pubitemid 40290819)
27. Fern XZ, Lin W (2008) Cluster Ensemble Selection. In proceedings of the SIAM international conference on data mining (SDM), pp 787-797
28. Fischer B, Buhmann JM (2003) Bagging for path-based clustering. IEEE Trans Patt Anal Mach Intell (TPAMI) 25(11):1411-1415
29. FredALN(2001) Finding consistent clusters in data partitions. In: Proceedings of the internationalworkshop on multiple classifier systems (MCS), pp 309-318
30. Fred ALN, JainAK(2002) Data clustering using evidence accumulation. In: Proceedings of the internationalconference on pattern recognition (ICPR), pp 276-280
31. Gan G, Ma C, Wu J (2007) Data clustering: theory, algorithms, and applications. ASA-SIAM series on statistics and applied probability
32. Ghaemi R, bin Sulaiman N, Ibrahim H, Mustapha N (2011) A review: accuracy optimization in clustering ensembles using genetic algorithms. Artif Intell Rev 35(4):287-318
33. Ghosh J, Acharya A (2011) Cluster ensembles. Wiley interdisciplinary reviews. Data Min Knowl Disc 1(4):305-315
34. Gionis A,Mannila H, Tsaparas P (2007) Clustering aggregation. In: ACMTrans Knowl Disc Data (TKDD), 1(1)
35. Gullo F, Domeniconi C, Tagarelli A (2009a) Projective clustering ensembles. In: Proceedings of the international conference on data mining (ICDM), pp 794-799
36. Gullo F, Tagarelli A, Greco S (2009b) Diversity-based weighting schemes for clustering ensembles. In: Proceedings of the SIAM international conference on data mining (SDM), pp 437-448
37. Gullo F, Domeniconi C, Tagarelli A (2010) Enhancing single-objective projective clustering ensembles. In: proceedings of the IEEE international conference on data mining (ICDM), pp 833-838
38. Gullo F, Domeniconi C, Tagarelli A (2011) Advancing data clustering via projective clustering ensembles. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 733-744
39. Günnemann S, Boden B, Seidl T (2011a) DB-CSC: a density-based approach for subspace clustering in graphs with feature vectors. In: Proceedings of the European conference on machine learning and knowledge discovery in databases (ECML/PKDD), pp 565-580
40. Günnemann S, Färber I, Müller E, Assent I, Seidl T (2011b) External evaluationmeasures for subspace clustering. In: Proceedings of the ACM conference on information and knowledge management (CIKM), pp 1363-1372
41. Hinneburg A, Aggarwal CC, Keim DA (2000) What is the nearest neighbor in high dimensional spaces? In: Proceedings of the international conference on very large data bases (VLDB), pp 506-515
42. Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice-Hall, Englewood Cliffs
43. Ka Ka Ng E, Wai-Chee Fu A, Chi-Wing Wong R (2005) Projective clustering by histograms. IEEE Trans Knowl Data Eng (TKDE) 17(3):369-383
44. Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359-392 (Pubitemid 128689516)
45. Karypis G, Aggarwal R, Kumar V, Shekhar S (1997) Multilevel hypergraph partitioning: applications in VLSI domain. In: Proceedings of the design automation conference (DAC), pp 526-529
46. Keogh E, Xi X, Wei L, Ratanamahatana CA (2003) The UCR time series classification/clustering page. http://www.cs.ucr.edu/~eamonn/time-series-data/
47. Kriegel H-P, Kroger P, Renz M, Wurst S (2005) A generic framework for efficient subspace clustering of high-dimensional data. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 250-257 (Pubitemid 47385700)
48. Kriegel H-P, Kröger P, Zimek A (2009) Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACMTrans Knowl Disc Data (TKDD) 3(1):1-58
49. Krivánek M, Morávek J (1986) NP-hard problems in hierarchical-tree clustering. Acta Inform 23(3):311- 323
50. Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logist Q 2:83-97
51. Kuncheva LI,Hadjitodorov ST, Todorova LP (2006) Experimental comparison of cluster ensemble methods. In: Proceedings of the international conference on information fusion, pp 1-7
52. Lewis DD,Yang Y, Rose T, Li F (2004) RCV1: a newbenchmark collection for text categorization research. J Mach Learn Res 5:361-397
53. Li T, Ding C (2008)Weighted consensus clustering. In: Proceedings of the SIAM international conference on data mining (SDM), pp 798-809
54. Li T, Ding C, Jordan MI (2007) Solving consensus and semi-supervised clustering problems using nonnegative matrix factorization. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 577-582
55. Liu B, Xia B, Yu PS (2000) Clustering through decision tree construction. In: Proceedings of the international conference on information and knowledge management (CIKM), pp 20-29
56. MeilaM(2005) Comparing clusterings: an axiomatic view. In: Proceedings of the international conference on machine learning (ICML), pp 577-584
57. Moise G, Sander J, Ester M (2008) Robust projected clustering. Knowl Inf Syst 14(3):273-298
58. MoiseG, Zimek A, Kröger P,Kriegel H-P, Sander J (2009) Subspace and projected clustering: experimental evaluation and analysis. Knowl Inf Syst 21(3):299-326
59. Müller E, Assent I, Günnemann S, Krieger R, Seidl T (2009a)Relevant subspace clustering: mining themost interesting non-redundant concepts in high dimensional data. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 377-386
60. Müller E, Günnemann S, Assent I, Seidl T (2009b) Evaluating clustering in subspace projections of high dimensional data. Proc VLDB Endow (PVLDB) 2(1):1270-1281
61. Müller E, Günnemann S, Assent I, Seidl T (2009c) Evaluating clustering in subspace projections of high dimensional data. http://dme.rwth-aachen.de/en/OpenSubspace/evaluation
62. Müller E, Assent I, Günnemann S, Seidl T (2011) Scalable density-based subspace clustering. In: Proceedings of the ACM conference on information and knowledge management (CIKM), pp 1077-1086
63. Ng AY, Jordan MI, Weiss Y (2001) On spectral clustering: analysis and an algorithm. In: Proceedings of the international conference on neural information processing systems (NIPS), pp 849-856
64. Nguyen N, Caruana R (2007) Consensus clustering. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 607-612
65. Parsons L, Haque E, LiuH (2004) Subspace clustering for high dimensional data: a review. SIGKDD Explor 6(1):90-105
66. Patrikainen A, Meila M (2006) Comparing subspace clusterings. IEEE Trans Knowl Data Eng (TKDE) 18(7):902-916 (Pubitemid 44143900)
67. Procopiuc CM, Jones M, Agarwal PK, Murali TM (2002) A Monte Carlo algorithm for fast projective clustering. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 418-427 (Pubitemid 34985566)
68. Schapire R (1990) The strength of weak learnability. Mach Learn 5(2):197-227
69. Sequeira K, Zaki M (2004) SCHISM: a new approach for interesting subspace mining. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 186-193 (Pubitemid 40731030)
70. Srinivas N, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221-248
71. Strehl A, Ghosh J (2002) Cluster ensembles - a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3:583-617
72. Strehl A, Ghosh J,Mooney R (2000) Impact of similarity measures on web-page clustering. In: Proceedings of the AAAI workshop on artificial intelligence for web search, pp 58-64
73. Tomasev N, Radovanovic M, Mladenic D, IvanovicM(2011) The role of hubness in clustering high-dimensional data. In: Proceedings of the Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD), pp 183-195
74. Topchy AP, Jain AK, Punch WF (2004) A mixture model for clustering ensembles. In: Proceedings of the SIAM international conference on data mining (SDM), pp 379-390
75. Topchy AP, Jain AK, Punch WF (2005) Clustering ensembles: models of consensus and weak partitions. IEEE Trans Pattern Anal Mach Intell (TPAMI) 27(12):1866-1881 (Pubitemid 43051385)
76. van Rijsbergen CJ (1979) Information retrieval. Butterworths, London
77. Wang H, Shan H, Banerjee A (2009) Bayesian cluster ensembles. In Proceedings of the SIAM international conference on data mining (SDM), pp 209-220
78. Wang H, Shan H, Banerjee A (2011) Bayesian cluster ensembles. Stat Anal Data Min 4(1):54-70
79. Wang P, Domeniconi C, Laskey KB (2010) Nonparametric Bayesian clustering ensembles. In: Proceedings of the European conference on machine learning and knowledge discovery in databases (ECML/PKDD), pp 435-450
80. Wang P, Laskey KB, Domeniconi C, Jordan M (2011) Nonparametric Bayesian co-clustering ensembles. In: Proceedings of the SIAM international conference on data mining (SDM), pp 331-342
81. Woo K-G, Lee J-H, KimM-H, Lee Y-J (2004) FINDIT: a fast and intelligent subspace clustering algorithm using dimension voting. Inf Softw Technol 46(4):255-271
82. Yang Y, KamelMS (2006) An aggregated clustering approach using multi-ant colonies algorithms. Pattern Recog 39(7):1278-1289
83. Yip KY, Cheung DW, NgMK (2004) HARP: a practical projected clustering algorithm. IEEE Trans Knowl Data Eng (TKDE) 16(11):1387-1397 (Pubitemid 40242327)
84. YipKY, CheungDW,NgMK(2005) On discovery of extremely low-dimensional clusters using semi-supervised projected clustering. In: Proceedings of the IEEE international conference on data engineering (ICDE), pp 329-340
85. Yiu ML, Mamoulis N (2005) Iterative projected clustering by subspace mining. IEEE Trans Knowl Data Eng (TKDE) 17(2):176-189 (Pubitemid 40320177)
86. Zeng Y, Tang J, Garcia-Frias J, Gao GR (2002) An adaptive meta-clustering approach: combining the information from different clustering results. In: Proceedings of the IEEE computer society bioinformatics conference (CSB), pp 330-332