An efficient clustering algorithm for small text documents

Seventh International Conference on Web-Age Information Management Workshops, WAIM 2006

Volumn , Issue , 2006, Pages 16-

  Yubao, Liu ^a   Jiarong, Cai ^a   Jian, Yin ^a   Ahilan, Huang ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; COMPUTATIONAL METHODS; NUMERICAL ANALYSIS; PROBLEM SOLVING; TEXT PROCESSING;

CLUSTERING TEXT DOCUMENTS; EFFICIENT CLUSTERING ALGORITHMS; K-MEANS ALGORITHMS; PING-PONG ALGORITHMS; TEXT DOCUMENTS;

CLUSTERING ALGORITHMS;

EID: 35348819587     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WAIMW.2006.4     Document Type: Conference Paper

References (11)

1. L. Bottou and Y. Bengio, "Convergence properties of the K-means algorithms", Advances in Neural Information Processing Systems 7, The MIT Press, Cambridge, MA, 1995, pp. 585-592.
2. S. Z. Selim and M. A. Ismail, "K-means-type algorithms: a generalized convergence theorem and characterization of local optimality", IEEE Trans. Pattern Analysis and Machine Intelligence, 1984, pp.81-87.
3. E. Forgy, "Cluster analysis of multivariate data: Efficiency vs. inter-pretability of classifications", Biometrics, vol. 21, 1965, pp. 768-780.
4. E. Rasmussen, "Clustering algorithms", In William B. Frakes and Ricardo Baeza-Yates, edi-tors, Information Retrieval: Data Structures and Algorithms, Prentice Hall, Englewood Cliffs, New Jersey, 1992, pp.419-442.
5. I. S. Dhillon and D. S. Modha, "Concept decompositions for large sparse text data using clustering", Machine Learning, 2001, pp.143-175.
6. A. Strehl, J. Ghosh, and R. Mooney, "Impact of similarity measures on web-page clustering", In AAAI 2000 Workshop on AI for Web Search, July 2000, pp.58-64.
7. Steinbach M., Karypis G., Kumar V., "A Comparison of Document Clustering Techniques", In: Proc. of Text Mining Workshop, KDD 2000,2000, pp.1-20.
8. Douglass R.Cutting, David R. Karger, Jan O.Pedersen and John W. Tukey. Scater/Gather., "A Cluster-based Approach to Browsing Large Document Collections", In: Proc. of 15th Ann SIGIR 1992, Denmark, 1992, pp.318-329.
9. D. S. D. Hochbaum, "A best possible heuristic for the k-center problem", Mathematics of Operations Research, 1985, pp.180-184.
10. M.Ester, H-P.Kriegel, Sander J., X Xu., "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise", In: Proc. of KDD 1996, 1996, pp. 226-231.
11. I.S. Dhillon, Y. Guan, and J. Kogan, "Refining Clusters in High-Dimensional Text Data", In: Proc. of SIAM on Data Mining, 2002, pp.71-82.