High-speed rough clustering for very large document collections

Journal of the American Society for Information Science and Technology

Volumn 61, Issue 6, 2010, Pages 1092-1104

  Kishida, Kazuaki ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING RESULTS; DOCUMENT CLUSTERING; DOCUMENT COLLECTION; GROUPING TECHNIQUE; HIGH-SPEED; LEADER-FOLLOWER; LEADER-FOLLOWER CLUSTERING; MERGING TECHNIQUES; PROCESSING TIME; REUTERS; ROUGH CLUSTERING; TWO STAGE;

COMPUTATIONAL COMPLEXITY; EXPERIMENTS;

CLUSTERING ALGORITHMS;

EID: 77952961013     PISSN: 15322882     EISSN: 15322890     Source Type: Journal    
DOI: 10.1002/asi.21311     Document Type: Article

References (29)

1. Boley, D., Gini, M., Gross, R., Han, E.-H., Hastings, K., Karypis, G., et al. (1999). Document categorization and query generation on the World Wide Web using WebACE. Artificial Intelligence Review, 13(5/6), 365-391. (Pubitemid 30594817)
2. Can, F., & Ozkarahan, E.A. (1984). Two partitioning type clustering algorithms. Journal of the American Society for Information Science, 35(5), 268-276. (Pubitemid 14622407)
3. Can, F., & Ozkarahan, E.A. (1985). Similarity and stability analysis of the two partitioning type clustering algorithms. Journal of the American Society for Information Science, 36(1), 3-14. (Pubitemid 15458978)
4. Can, F., & Ozkarahan, E.A. (1987). Computation of term/document discrimination values by use of the cover coefficient concept. Journal of the American Society for Information Science, 38(3), 171-183. (Pubitemid 17588915)
5. Can, F., & Ozkarahan, E.A. (1990). Concepts and effectiveness of the cover-coefficient-based clustering methodology for text databases. ACM Transactions on Database Systems, 15(4), 483-517.
6. Croft, W.B. (1977). Clustering large files of documents using the single-link method. Journal of the American Society for Information Science, 28(6), 341-344.
7. Crouch, D.B. (1975). A file organization and maintenance procedure for dynamic document collections. Information Processing & Management, 11(1/2), 11-21.
8. Cutting, D.R., Karger, D.R., Pedersen, J.O., & Tukey, J.W. (1992). Scatter/Gather: A cluster-based approach to browsing large document collections. In Proceedings of the 15 th Annual International Conference on Research and Development in Information Retrieval (pp. 318-329). New York: ACM Press.
9. Dhillon, I., Kogan, J., & Nicholas, C. (2004). Feature selection and document clustering. In M.W. Berry (Ed), Survey of text mining (pp. 73-100). New York: Springer.
10. Duda, R.O., Hart, P.E., & Stork, D.O. (2001). Pattern classification (2nd ed). New York: Wiley.
11. Frigui, H., & Nasraoui, O. (2004). Simultaneous clustering and dynamic keyword weighting for text documents. In M.W. Berry (Ed.), Survey of text mining (pp. 45-72). New York: Springer.
12. Jardine, N., & van Rijsbergen, C.J. (1971). The use of hierarchic clustering in information retrieval. Information Storage and Retrieval, 7(5), 217-240.
13. Kogan, J. (2001). Means clustering for text data. In Proceedings of the Workshop on Text Mining at the First SIAM International Conference on Data Mining (pp. 47-57). Philadelphia: SIAM.
14. Lewis, D.D., Yang, Y., Rose, T.G., & Li, F. (2004). RCV1: A new benchmark collection for text categorization research. Journal of Machine Learning Research, 5, 361-397.
15. Liu, X., Gong, Y., Xu, W., & Zhu, S. (2002). Document clustering with cluster refinement and model selection capabilities. In. Proceedings of the 25th Annual International Conference on Research and Development in Information Retrieval (pp. 191-198). New York: ACM Press.
16. Murtagh, F. (1983). A survey of recent advances in hierarchical clustering algorithms. Computer Journal, 26(4), 354-359.
17. Nilsson, M. (2002). Hierarchical clustering using non-greedy principal direction divisive partitioning. Information Retrieval, 5, 311-321.
18. Rasmussen, E. (1992). Clustering algorithm. In W.B. Frakes & R. BaezaYates (Eds.), Information, retrieval: Data structures & algorithms (pp. 419-442). Englewood Cliffs, NJ: PTR Prentice Hall.
19. Rasmussen, E., & Willett, P. (1987). Non-hierarchic document clustering using the ICL distributed array processor. In Proceedings of the 10th Annual International Conference on Research and Development in Information Retrieval (pp. 132-139).
20. Rasmussen, E., & Willett, P. (1989). Efficiency of hierarchic agglomerative clustering using the ICL distributed array processor. Journal of Documentation, 45(1), 1-24.
21. Sedgewick, R. (1998). Algorithms in C++, Parts 1-4 (3rd ed). Reading, MA: Addison-Wesley.
22. Steinbach, M., Karypis, G., & Kumar, V. (2000, August). A comparison of document clustering techniques. Paper presented at the Sixth SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2000), Boston, MA. Retrieved February 9, 2010, from http://www.cs.cmu.edu/~dunja/ PapersWshKDD2000.html
23. van Rijsbergen, C.J. (1974). Further experiments with, hierarchic document clustering in document retrieval. Information Storage and Retrieval, 10(1), 1-14.
24. van Rijsbergen, C.J., & Croft, W.B. (1975). Document clustering: An evaluation of some experiments with the Cranfield 1400 collection. Information Processing & Management, 11(5/7), 171-182.
25. Voorhees, E.M. (1986). Implementing agglomerative hierarchic clustering algorithms for use in document retrieval. Information Processing & Management, 22(6), 465-476.
26. Willett, P. (1980). Document clustering using an inverted file approach. Journal of Information Science, 2(5), 223-231.
27. Willett, P. (198.1). A fast procedure for the calculation of similarity coefficients in automatic classification. Information Processing & Management, 17, 53-60.
28. Willett, P. (1988). Recent trends in hierarchic document clustering: A critical review. Information Processing & Management, 24(5), 577-597.
29. Zhao, Y., & Karypis, G. (2002). Evaluation of hierarchical clustering algorithms for document databases. In Proceedings of the 2002 ACM International Conference on Information and Knowledge Management (pp. 515-524). New York: ACM Press.