Hypergraph models and algorithms for data-pattern-based clustering

Data Mining and Knowledge Discovery

Volumn 9, Issue 1, 2004, Pages 29-57

  Ozdal, Muhammet Mustafa ^a   Aykanat, Cevdet ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Clustering; Data mining; Data patterns; Hypergraph models

Indexed keywords

CLUSTERING; DATA PATTERNS; HYPERGRAPH MODELS; PATTERN SEMANTICS;

ALGORITHMS; COMPUTER SIMULATION; DATA MINING; DIGITAL STORAGE; GRAPH THEORY; GROUP TECHNOLOGY; MATHEMATICAL MODELS; METRIC SYSTEM; SEMANTICS; SET THEORY;

DATABASE SYSTEMS;

EID: 3543126522     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:DAMI.0000026903.59233.2a     Document Type: Article

References (42)

1. Aggarwal, C.C., Procopiuc, C., Wolf, J.L., Yu, P.S., and Park, J.S. 1999. Fast algorithms for projected clustering. In Proceedings of ACM SIGMOD Conference on Management of Data, pp. 61-72.
2. Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining associations between sets of items in massive databases. In Proc. of the 1993 ACM-SIGMOD Int'l Conf. on Management of Data, pp. 207-216.
3. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proc. of the 20th Int'l Conference on Very Large Databases, pp. 487-498.
4. Agrawal, R., Gehrke, J., Gunopulos, D., and Raghavan, P. 1998. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of ACM SIGMOD'98 International Conference on Management of Data, pp. 94-105.
5. Baker, D. and McCallum, A. 1998. Distributional clustering of words for text classification. In Proc. of SIGIR'98, Melbourne, pp. 96-103.
6. Bayardo, R.J. 1998. Efficiently mining long patterns from databases. In Proc. of the 1998 ACM-SIGMOD Int'l Conf. on Management of Data, pp. 85-93.
7. Bayardo, R.J., Agrawal, R., and Gunopulos, D. 2000. Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery, 4:217-240.
8. Berge, C. 1976. Graphs and Hypergraphs. American Elsevier.
9. Bradley, P.S., Fayyad, U., and Reina, C. 1998. Scaling clustering algorithms to large databases. In Proc. 4th Int. Conf. on Knowledge Discovery and Data Mining. AAAI Press, pp. 9-15.
10. Brin, S., Motwani, R., Ullman, J., and Tsur, S. 1997. Dynamic itemset counting and implication rules for market basket data. In Proc. of the 1997 ACM-SIGMOD Int'l Conf. on the Management of Data, pp. 255-264.
11. Catalyurek, U. and Aykanat, C. 1999. Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication. IEEE Transactions on Parallel and Distributed Systems, 10(7):673-693.
12. Cheng, C., Fu, A., and Zhang, Y. 1999. Entropy-based Subspace Clustering for Mining Numerical Data. KDD-99, San Diego, CA, pp. 84-93.
13. Aggarwal, C.C. and Yu, P.S. 2000 Finding generalized projected clusters in high dimensional spaces. SIGMOD Conference.
14. Chiu, T., Fang, D., Chen, J., and Wang, Y. 2001. A robust and scalable clustering algorithm for mixed type attributes in large database environments. KDD-2001, San Francisco, CA, pp. 263-268.
15. Faloutsos, C. and Lin, L-I. 1995. Fastmap: A fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets. SIGMOD Conference, pp. 163-174.
16. Fasulo, D. 1999. An analysis of recent work on clustering algorithms. Available at http://www.cs.washington.edu/ homes/dfasulo/clustering.ps.
17. Feldman, R., Aumann, Y., Amir, A., and Mannila, H. 1997. Efficient algorithms for discovering frequent sets in incremental databases. In 2nd SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.
18. Ganti, V., Ramakrishnan, R., Gehrke, J., Powell, A., and French, J. 1999. Clustering large datasets in arbitrary metric spaces. In Proceedings of the 15th International Conference on Data Engineering, pp. 502-511.
19. Ganti, V., Gehrke, J., and Ramakrishnan, R. 1999. CACTUS - Clustering categorical data using summaries. In Proc. of the 5th Int'l Conf. on Knowledge Discovery and Data Mining (KDD-99), pp. 73-83.
20. Guha, S., Rastogi, R., and Shim, K. 1999. ROCK: A robust clustering algorithm for categorical attributes. In Proc. of the 15th Int'l Conf. on Data Eng.
21. Guha, S., Rastogi, R., and Shim, K. 1998. CURE: An efficient clustering algorithm for large databases. In Proc. of ACM SIGMOD Int'l Conference on Management of Data, pp. 73-84.
22. Han, E.H., Karypis, G., and Mobasher, B. 1997. Clustering in a high dimensional space using hypergraph models. In Technical Report, University of Minnesota, Department of Computer Science, pp. 97-019.
23. Huang, Z. 1997. A fast clustering algorithm to cluster very large categorical data sets in data mining. In Proc. SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery.
24. Jain, A.K., Murty, M.N., and Flynn, P.J. 1999. Data clustering: A review. ACM Computing Surveys, 31(3):264-323.
25. Jolliffe, I.T. 1986. Principal Component Analysis. New York: Springer Verlag.
26. Karypis, G., Aggarwal, R., Kumar, V., and Shekhar, S. 1997. Multilevel hypergraph partitioning: Application in VLSI domain. In Proceedings ACM/IEEE Design Automation Conference.
27. Karypis, G., Han, E., and Kumar, V. 1999. Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer, 32:68-75.
28. Kaufman, L. and Rousseeuw, P.J. 1990. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, Inc.
29. King, B. 1967. Step-wise clustering procedures. J. Am. Stat. Assoc, 69:86-101.
30. Lengauer, T. 1990. Combinatorial Algorithms for Integrated Circuit Layout. Chichester, U.K. Wiley.
31. MacQueen, J. 1967. Some methods for classification and analysis of multivariate observations. Proc. 5th Berkeley Symposium, 1:281-297.
32. Nagesh, H., Goil, S., and Choudhary, A. 1999. MAFIA: Efficient and scalable subspace clustering for very large data sets. Technical Report 9906-010, Northwestern University, June.
33. Ng, R.T. and Han, J. 1994. Efficient and effective clustering methods for spatial data mining. In Proceedings of the Twentieth International Conference on Very Large Databases, pp. 144-155.
34. Park, J.S., Chen, M.S., and Yu, P.S. 1996. An effective hash based algorithm for mining association rules. In Proc. of the 1995 SIGMOD Conf. on the Management of Data, pp. 175-186.
35. Salton, G. and Buckley, C. 1988. Term weighting approaches in automatic text retrieval. Information Processing and Management, 24(5):513-523.
36. Silverstein, C., Brin, S., and Motwani, R. 1998. Beyond market baskets: Generalizing association rules to dependence rules. Knowledge Discovery and Data Mining, 2(1):39-68. Kluwer Academic Publishers.
37. Sneath, P.H.A. and Sokal, R.R. 1973. Numerical Taxonomy. London, UK: Freeman.
38. Voorhees, E.M. 1986. Implementing agglomerative hierarchic clustering algorithms for use in document retrieval. Information Processing & Management, 22(6):465-476.
39. Ward, J.H. 1963. Hierarchical grouping to optimize an objective function. J. Am. Stat. Assoc, 58:236-244.
40. Zait, M. and Messatfa, H. 1997. A comparative study of clustering methods. Future Generation Computer Systems, 13:149-159.
41. Zaki, M.J., Parthasarathy, S., Ogihara, M., and Li, W. 1997. New algorithms for fast discovery of association rules. In Proc. of the Third Int'l Conf. on Knowledge Discovery in Databases and Data Mining, pp. 283-286.
42. Zhang, T., Ramakrishnan, R., and Livny, M. 1996. BIRCH: An efficient data clustering method for very large databases. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 103-114.