Frequent-pattern based iterative projected clustering

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2003, Pages 689-692

  Yiu, Man Lung ^a   Mamoulis, Nikos ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 20844440247     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. C. C. Aggarwal, J. L. Wolf, P. S. Yu, C. Procopiuc, and J. S. Park. Fast algorithms for projected clustering. In ACM SIGMOD, 1999.
2. C. C. Aggarwal and P. S. Yu. Finding generalized projected clusters in high dimensional spaces. In ACM SIGMOD, 2000.
3. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In ACM SIGMOD, 1998.
4. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, 1994.
5. K. S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? In ICDT, 1999.
6. C. Blake and C. Merz. UCI repository of machine learning databases, www.ics.uci.edu/~mlearn/mlrepository.html, 1998.
7. C. Faloutsos and K.-I. Lin. Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In ACM SIGMOD, 1995.
8. S. Guha, R. Rastogi, and K. Shim. Rock: A robust clustering algorithm for categorical attributes. In IEEE ICDE, 1999.
9. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM SIGMOD, 2000.
10. C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A monte carlo algorithm for fast projective clustering. In ACM SIGMOD, 2002.