Clicks: An effective algorithm for mining subspace clusters in categorical datasets

Data and Knowledge Engineering

Volumn 60, Issue 1, 2007, Pages 51-70

  Zaki, Mohammed J ^a   Peters, Markus ^b   Assent, Ira ^b   Seidl, Thomas ^b  

^a Rensselaer Polytechnic Institute   (United States)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Categorical data; Clustering; k Partite graph; Maximal cliques

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; KNOWLEDGE ACQUISITION; REAL TIME SYSTEMS;

CATEGORICAL DATA; HIGH-DIMENSIONAL DATASETS; K-PARTITE GRAPHS; MAXIMAL CLIQUES;

DATA MINING;

EID: 33845981111     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2006.01.005     Document Type: Article

References (23)

1. Han J., and Kamber M. Data Mining: Concepts and Techniques (2001), Morgan Kaufmann Publishers, San Francisco, CA
2. Madeira S.C., and Oliveira A.L. Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Transactions on Computational Biology and Bioinformatics 1 1 (2004) 24-45
3. R. Agrawal, J. Gehrke, D. Gunopulos, P. Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, in: SIGMOD Conf., 1997.
4. H. Nagesh, S. Goil, A. Choudhary, Adaptive grids for clustering massive data sets, in: SIAM Data Mining Conf., 2002.
5. K. Sequeira, M. Zaki, SCHISM: a new approach for interesting subspace mining, in: IEEE Int'l Conf. on Data Mining, 2004.
6. C.M. Procopiuc, M. Jones, P.K. Aggarwal, T.M. Murali, A Monte Carlo algorithm for fast projective clustering, in: SIGMOD Conf., 2002.
7. C.C. Aggarwal, P.S. Yu, Finding generalized projected clusters in high dimensional spaces, in: SIGMOD Conf., 2000.
8. K. Kailing, H. Kriegel, P. Kroeger, S. Wanka, Ranking interesting subspaces for clustering high dimensional data, in: PKDD Conf., 2003.
9. Y. Cheng, G. Chruch, Biclustering of expression data, in: ISMB Conf., 2000.
10. M. Ester, H. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, in: SIGKDD Conf., 1996.
11. C. Ordonez, Clustering binary data streams with k-means, in: SIGMOD DMKD Workshop, 2003.
12. K. Wang, C. Xu, B. Liu, Clustering transactions using large items, in: CIKM Conf., 1999.
13. M. Koyutürk, A. Grama, Proximus: a framework for analyzing very high-dimensional discrete attributed datasets, in: SIGKDD Conf., 2003.
14. E. Han, G. Karypis, V. Kumar, B. Mobasher, Clustering based on association rule hypergraphs, in: SIGMOD DMKD Workshop, 1997.
15. Z. Huang, A fast clustering algorithm to cluster very large categorical data sets in data mining, in: SIGMOD DMKD Workshop, 1997.
16. D. Barbara, Y. Li, J. Couto, Coolcat: an entropy-based algorithm for categorical clustering, in: CIKM Conf., 2002.
17. D. Cristofor, D. Simovici, An information-theoretical approach to clustering categorical databases using genetic algorithms, in: SIAM Workshop on clustering high dimensional data, 2002.
18. P. Andritsos, P. Tsaparas, R.J. Miller, K.C. Sevcik, LIMBO: scalable clustering of categorical data, in: 9th Int'l Conf. on Extending DataBase Technology, 2004.
19. D. Gibson, J. Kleinberg, P. Raghavan, Clustering categorical data: an approach based on dynamical systems, in: VLDB Conf., 1998.
20. V. Ganti, J. Gehrke, R. Ramakrishnan, CACTUS: clustering categorical data using summaries, in: SIGKDD Conf., 1999.
21. S. Guha, R. Rastogi, K. Shim, Rock: a robust clustering algorithm for categorical attributes, in: ICDE Conf., 1999.
22. Johnston H. Cliques of a graph-variations on the Bron-Kerbosch algorithm. International Journal of Computer and Information Sciences 5 3 (1976) 209-238
23. K. Gouda, M.J. Zaki, Efficiently mining maximal frequent itemsets, in: ICDM Conf., 2001.