A customizable hybrid approach to data clustering

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2003, Pages 485-489

  Qian, Yu ^a   Zhang, Kang ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA MINING; DATABASE SYSTEMS; GRAPH THEORY;

DATA CLUSTERING;

COMPUTER SCIENCE;

EID: 0038675379     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/952613.952628     Document Type: Conference Paper

References (20)

1. S. E. Hambrusch, C-M. Liu, and H-S. Lim, Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees, Journal of Graph Algorithms and Applications, Vol. 4, No. 4, pp. 1-26 (2000).
2. V. Batagelj, A. Mrvar, and M. Zaversnik, Partitioning Approaches to Clustering in Graphs, Proc. GD'1999, LNCS, pp. 90-97 (2000).
3. D. Harel and Y. Koren, A Fast Multi-scale Method for Drawing Large Graphs, Proc. GD'2000, LNCS, pp. 183-196 (2001).
4. A. Quigley and P. Eades, FADE: Graph Drawing, Clustering, and Visual Abstraction, Proc. GD '2000, LNCS, pp. 197-210 (2001).
5. J. May-Six, Vistool: A Tool For Visualizing Graphs, PhD Thesis, The University of Texas at Dallas (2000).
6. P. K. Agarwal and C. M. Procopiuc, Exact and Approximation Algorithms for Clustering, Proc. 9th ACM-SIAM Symp., Discrete Algorithms (1998).
7. J. May-Six and I. G. Tollis, Effective Graph Visualization Via Node Grouping, Proc. IEEE Symposium on information Visualization 2001, pp. 51-58 (2001).
8. M.Ester, H. P. Kriegel, J.Sander, and X.Xu, A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining (KDD-96), AAAI Press, pp. 226-231 (1996).
9. M. Ester, H. P. Kriegel, J. Sander, and X. Xu, Clustering for Mining in Large Spatial Databases. KI (Artificial Intelligence), Special Issue on Data Mining, ScienTec Publishing, pp. 18-24 (1998).
10. R. T. Ng and J. Han, Efficient and Effective Clustering Methods for Spatial Data Mining, Proc. 20th Int. Conf. on Very Large Data Bases, Morgan Kaufmann, pp. 144-155 (1994).
11. W. Wang, J. Yang, and R. Muntz, STING: A Statistical Information Grid Approach to Spatial Data Mining, Proc. 23rd Int. Conf. on Very Large Data Bases, Morgan Kaufmann, pp. 186-195 (1997).
12. T. Zhang, R. Ramakrishnan, and M. Linvy, BIRCH: An Efficient Data Clustering Method for Very Large Databases, Proc. ACMSIGMOD Int'l Conf. on Management of Data, ACM Press, pp. 103-114 (1996).
13. M. S. Chen, J. Han and P. S. Yu, Data Mining: An Overview from Database Perspective, IEEE Transactions on Knowledge and Data Engineering, IEEE Computer Society Press, Vol. 8, No.6, pp. 866-883 (1996).
14. th Int'l Conf. Knowledge Discovery and Data Mining (KDD-2001), ACM Press, New York, pp. 281-286 (2001).
15. G. Karypis, E. Han, and V. Kumar, CHAMELEON, A Hierarchical Clustering Algorithm Using Dynamic Modeling, IEEE Computer pp. 68-75, 32 (1999).
16. th Int'l Conf. on Geocomputation, Geo Computation CD-ROM: GC049, ISBN 0-9533477-2-9 (2000).
17. I. Jonyer, L. B. Holder and D. J. Cook, Graph-Based Hierarchical Conceptual Clustering, Proc. of the Thirteenth Annual Florida AI Research Symposium (2000).
18. A. K. Jain, M. N. Murty, and P. J. Flynn, Data Clustering: A Review, ACM Computing Surveys, Vol.31, No. 3, pp. 264-323 (1999).
19. W. T. McCormick, P. J. Sweitzer, and T. W. White: Problem decomposition and data reorganization by a clustering technique. Oper. Res., (September-October), pp. 993-1009 (1972).
20. K. Zhang and N. Gorla, Locality Metrics and Program Physical Structures, Journal of Systems and Software, 54 (2000), pp. 159-166 (2000).