The DOI matches its Crossref record.
A hierarchical monothetic document clustering algorithm for summarization and browsing search results
Abstract
Organizing Web search results into a hierarchy of topics and sub-topics facilitates browsing the collection and locating results of interest. In this paper, we propose a new hierarchical monothetic clustering algorithm to build a topic hierarchy for a collection of search results retrieved in response to a query. At every level of the hierarchy, the new algorithm progressively identifies topics in a way that maximizes the coverage while maintaining distinctiveness of the topics. We refer the proposed algorithm to as DisCover. Evaluating the quality of a topic hierarchy is a non-trivial task, the ultimate test being user judgment. We use several objective measures such as coverage and reach time for an empirical comparison of the proposed algorithm with two other monothetic clustering algorithms to demonstrate its superiority. Even though our algorithm is slightly more computationally intensive than one of the algorithms, it generates better hierarchies. Our user studies also show that the proposed algorithm is superior to the other algorithms as a summarizing and browsing tool.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Improving recommendation lists through topic diversification
Ziegler, C.-N., McNee, S. M., Konstan, J. A., & Lausen, G. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060754 · Cited by 1,892
Phan, X.-H., Nguyen, L.-M., & Horiguchi, S. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367510 · Cited by 740
A survey of Web clustering engines
Carpineto, C., Osiński, S., Romano, G., & Weiss, D. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541884 · Cited by 399
Self-Tuned Descriptive Document Clustering Using a Predictive Network
Brockmeier, A. J., Mu, T., Ananiadou, S., & Goulermas, J. Y. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2781721 · Cited by 15
Metadata
- Authors
- Kummamuru, K., Lotlikar, R., Roy, S., Singal, K., & Krishnapuram, R.
- Venue
- Proceedings of the 13th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2004-05-17
- Pages
- 658-665
- OpenAlex
- W2160799467
- Cited by
- 190
- References
- 0
- FWCI
- 15.24
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A hierarchical monothetic document clustering algorithm for summarization and browsing search results. https://app.cochat.ai/papers/10.1145/988672.988762
- The paper
- Kummamuru, K., Lotlikar, R., Roy, S., Singal, K., & Krishnapuram, R. (2004). A hierarchical monothetic document clustering algorithm for summarization and browsing search results. Proceedings of the 13th international conference on World Wide Web. https://doi.org/10.1145/988672.988762
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.