The retrieval effectiveness of five clustering algorithms as a function of indexing exhaustivity

Abstract

The retrieval effectiveness of five hierarchical clustering methods (single link, complete link, group average, Ward's method, and weighted average) is examined as a function of indexing exhaustivity with four test collections (CF, Cranfield, Medlars, and Time). Evaluations of retrieval effectiveness, based on three measures of optimal retrieval performance, confirm earlier findings that the performance of a retrieval system based on single‐link clustering varies as a function of indexing exhaustively but fail to find similar patterns for other clustering methods. The data also confirm earlier findings regarding the poor performance of single‐link clustering in a retrieval environment. The poor performance of single‐link clustering appears to derive from that method's tendency to produce a small number of large, ill‐defined document clusters. By contrast, the data examined here found the retrieval performance of the other clustering methods to be generally comparable. The data presented here also provide an opportunity to examine the theoretical limits of cluster‐based retrieval and to compare these theoretical limits to the effectiveness of operational implementations. Performance standards for the four document collections examined here were found to vary widely, and the effectiveness of operational implementations were found to be in the range defined as “unacceptable.” Further improvements in search strategies and document representations warrant investigation. © 1995 John Wiley & Sons, Inc.

Efficiency and effectiveness of query processing in cluster-based retrieval

“…4. Another research direction is definition of document vectors with different levels of indexing exhaustivity [Burgin, 1995] or by latent semantic indexing (LSI) and measuring the system performance [Lee, 1997;Schütze, Silverstein, 1997].…”

“…Most clustering research in IR is related to cluster search effectiveness [Griffiths et al, 1986;Willett, 1988;Burgin 1995;Shaw et al 1997;Schütze, Craig 1997]. The research on efficiency aspects of cluster searches is limited.…”

News Article Classification Based on a Vector Representation Including Words’ Collocations

“…Hierarchical clustering algorithms have been intensively studied as well as neural network models. Several methods are used as Support vector machines, Naïve Bayes or Neural networks [11], where Naïve Bayes outperforms the others [2].…”

An intelligent information system for organizing online text documents

“…Specifically, we adopt the complete-linkage HAC method, which is known to produce tightly bound and compact clusters (Burgin, 1995) even though other types of HAC clustering algorithms such as Ward's method (El-Hamdouchi and Willett, 1986) and average-group method (Voorhees, 1986) can also be used. Another common way of clustering, namely partitional clustering, is possible.…”