Robust projected clustering

Knowledge and Information Systems

Volumn 14, Issue 3, 2008, Pages 273-298

  Moise, Gabriela ^a   Sander, Jörg ^a   Ester, Martin ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Clustering numerical and categorical data; Projected clustering; Subspace clustering

Indexed keywords

PARAMETER ESTIMATION;

CATEGORICAL DATA; DISJOINT CLUSTERS; HIGH DIMENSIONAL SPACES; MINIMIZING THE NUMBER OF; OVERLAPPING CLUSTERS; PROJECTED CLUSTERING; ROBUST ALGORITHM; SUB-SPACE CLUSTERING;

CLUSTERING ALGORITHMS;

EID: 41149085604     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-007-0090-6     Document Type: Article

References (26)

1. Aggarwal C, Procopiuc C, Wolf J, Yu P, and Park J (1999) Fast algorithms for projected clustering. In: Delis A, Faloutsos C, Ghandeharizadeh S (eds) Proceedings of the ACM SIGMOD international conference on management of data, Philadelphia, pp 61-72
2. Aggarwal C, Yu P (2000) Finding generalized projected clusters in high dimensional spaces. In: Chen W, Naughton J, Bernstein P (eds) Proceedings of the ACM SIGMOD international conference on management of data, Dallas, pp 70-81
3. Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: Haas L, Tiwary A (eds) Proceedings of the ACM SIGMOD international conference on management of data, Seattle, pp 94-105
4. Agrawal R, Srikan R (1994) Fast algorithms for mining association rules. In: Bocca J, Jarke M, Zaniolo C (eds) Proceedings of the international conference on very large data bases VLDB, Santiago de Chile, Chile, pp 487-499
5. Alon U, Barkai N, Notterman D, Gish K, Ybarra S, Mack D and Levine A (1999). Broad patterns of gene expression revealed by clustering of tumor and normal colon tissues probed by oligonucleotide arrays. Proc Natl Acad Sci USA 96(12):6745-6750
6. Andritsos P, Tsaparas P, Miller J, Sevcik K (2004) LIMBO: Scalable clustering of categorical data. In Proceedings of international conference on extending database technology EDBT, Heraklion, Greece, pp 123-146
7. Beyer K, Goldstein J, Ramakrishnan R, Shaft U (1999) When is nearest neighbor meaningful? Lecture Notes in Computer Science, vol. 1540. Springer, Berlin, pp 217-235
8. Dempster A, Laird N and Rubin D (1977). Maximum likelihood for incomplete data via the EM algorithm. J Roy Stat Soc 39:1-38
9. Gan G and Wu J (2004). Subspace clustering for high dimensional categorical data. ACM SIGKDD Explor Newslett 6(2):87-94
10. Ganti V, Gehrke J, Ramakrishnan R (1999) CACTUS - clustering categorical data using summaries. In: ACM SIGKDD international conference on knowledge discovery and data mining, San Diego, pp 73-83
11. Hinneburg A and Keim D (2003). A general approach to clustering in large databases with noise. Knowl Inf Syst 5(4):387-415
12. Kailing K, Kriegel H, Kröger P (2004) Density-connected subspace clustering for high-dimensional data. In: Berry M, Dayal U, Kamath C, Skilicorn D (eds) Proceedings of the SIAM international conference on data mining, Lake Buena Vista, April 2004, pp 1-11
13. Kriegel H, Kröger P, Renz M, Wurst S (2005) A generic framework for efficient subspace clustering of high-dimensional data. In: Proceedings of the IEEE ICDM international conference on data mining, Houston, pp 250-257
14. Moise G, Sander J, Ester M (2006) P3C: A robust projected clustering algorithm. In: Proceedings of the IEEE ICDM international conference on data mining, Hong Kong, pp 414-425
15. Nagesh H, Goil S, Choudhary A (2001) Adaptive grids for clustering massive data sets. In: Proceedings of the SIAM international conference on data mining, Chicago, pp 1-17
16. Ng K, Fu A and Wong C (2005). Projective clustering by histograms. IEEE Trans Knowl Data Eng 17(3):369-383
17. Parsons L, Haque E and Liu H (2004). Subspace clustering for high dimensional data: A review. ACM SIGKDD Explor Newslett 6(1):90-105
18. Procopiuc C, Jones M, Agarwal P, Murali T (2002) A Monte Carlo algorithm for fast projective clustering. In: Franklin M, Moon B, Ailamaki A (eds) Proceedings of the ACM SIGMOD international conference on management of data, Madison, pp 418-427
19. Rousseeuw P and Van Zomeren B (1990). Unmasking multivariate outliers and leverage points. J Am Stat Assoc 85(411):633-651
20. Snedecor G and Cochran W (1989). Statistical methods. Iowa State University Press, Cambridge
21. Tang J, Chen J, Fu A and Cheung W (2007). Capabilities of outlier detection schemes in large datasets, framework and methodologies. Knowl Inf Syst 11(1):45-84
22. Wang J and Karypis G (2006). On efficiently summarizing categorical databases. Knowl Inf Syst 9(1):19-37
23. Yip K, Cheung D and Ng M (2004). HARP: A practical projected clustering algorithm. IEEE Trans Knowl Data Eng 16(11):1387-1397
24. Yip K, Cheung D, Ng M (2005) On discovery of extremely low-dimensional clusters using semi- supervised projected clustering. In: Proceedings of the IEEE ICDE international conference on data engineering, Tokyo, pp 329-340
25. Yiu M and Mamoulis N (2005). Frequent-pattern based iterative projected clustering. IEEE Trans Knowl Data Eng 17(2):176-189
26. Zaki M, Peters M, Assent I, Seidl T (2005) CLICKS: An effective algorithm for mining subspace clusters in categorical datasets. In: Grossman R, Bayardo R, Bennett K (eds) Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining, Chicago, pp 733-742