Hierarchic document classification using Ward's clustering method
Abdelmoula El-Hamdouchi, Peter Willett · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · 1986
In this paper, we discuss the application of a recent hierarchic clustering algorithm to the automatic classification of files of documents. Whereas most hierarchic clustering algorithms involve the generation and updating of an inter-object dissimilarity matrix, this new algorithm is based upon a series of nearest neighbor searches. Such an approach is appropriate to several clustering methods, including Ward's method which has been shown to perform well in experimental studies of hierarchic document clustering. A description is given of heuristics which can increase the efficiency of the new algorithm when it is used to cluster three document collections by Ward's method.
Cited by 65 works. doi:10.1145/253168.253200 Open-access PDF
Authors
References
- Introduction to Modern Information Retrieval
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems
- The use of hierarchic clustering in information retrieval
- Optimal Expected-Time Algorithms for Closest Point Problems
- A Survey of Recent Advances in Hierarchical Clustering Algorithms
- The nearest neighbour problem in information retrieval
- A probabilistic algorithm for nearest neighbour searching
- Tests of Methods for Evaluating Bibliographic Databases: An Analysis of the National Library of Medicine's Handling of Literatures in the Medical Behavioral Sciences