Hierarchical Document Clustering Using Frequent Itemsets [chapter]

Benjamin C.M. Fung, Ke Wang, Martin Ester
2003 Proceedings of the 2003 SIAM International Conference on Data Mining  
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, each document often contains a small fraction of words in the vocabulary. These features require special handlings. Another requirement is hierarchical clustering where clustered documents can be browsed according to the increasing specificity of topics. In this paper, we propose to use the notion of frequent itemsets,
more » ... which comes from association rule mining, for document clustering. The intuition of our clustering criterion is that each cluster is identified by some common words, called frequent itemsets, for the documents in the cluster. Frequent itemsets are also used to produce a hierarchical topic tree for clusters. By focusing on frequent items, the dimensionality of the document set is drastically reduced. We show that this method outperforms best existing methods in terms of both clustering accuracy and scalability.
doi:10.1137/1.9781611972733.6 dblp:conf/sdm/FungWE03 fatcat:cb6xz4azhba7nfvzvo2poohuvm