The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Generic summarization and keyphrase extraction using mutual reinforcement principle and sentence clustering
Abstract
A novel method for simultaneous keyphrase extraction and generic text summarization is proposed by modeling text documents as weighted undirected and weighted bipartite graphs. Spectral graph clustering algorithms are useed for partitioning sentences of the documents into topical groups with sentence link priors being exploited to enhance clustering quality. Within each topical group, saliency scores for keyphrases and sentences are generated based on a mutual reinforcement principle. The keyphrases and sentences are then ranked according to their saliency scores and selected for inclusion in the top keyphrase list and summaries of the document. The idea of building a hierarchy of summaries for documents capturing different levels of granularity is also briefly discussed. Our method is illustrated using several examples from news articles, news broadcast transcripts and web documents.
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
Cites
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Text Chunking Using Transformation-Based Learning
Ramshaw, L. A., & Marcus, M. P. (1999) · Text, Speech and Language Technology · doi:10.1007/978-94-017-2390-9_10 · Cited by 1,460
A trainable document summarizer
Kupiec, J., Pedersen, J., & Chen, F. (1995) · Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '95 · doi:10.1145/215206.215333 · Cited by 1,330
Refining Initial Points for K-Means Clustering
Bradley, P. S., & Fayyad, U. M. (1998) · Cited by 1,031
Generic text summarization using relevance measure and latent semantic analysis
Gong, Y., & Liu, X. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383955 · Cited by 848
Mani, I. (2001) · Natural Language Processing · doi:10.1075/nlp.3 · Cited by 834
Spectral Relaxation for K-means Clustering
Hongyuan Zha, B., He, X., Ding, C. H. Q., Gu, M., & Simon, H. D. (2001) · neural information processing systems · Cited by 687
Advances in Automatic Text Summarization
Liddy, E. (2001) · Information Retrieval · doi:10.1023/a:1011476409104 · Cited by 685
Advances in automatic text summarization
(2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)90017-8 · Cited by 681
Automatic text structuring and summarization
Salton, G., Singhal, A., Mitra, M., & Buckley, C. (1997) · Information Processing & Management · doi:10.1016/s0306-4573(96)00062-3 · Cited by 495
OCELOT: a system for summarizing Web pages
Berger, A. L., & Mittal, V. O. (2000) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/345508.345565 · Cited by 145
Extracting sentence segments for text summarization: a machine learning approach
Chuang, W. T., & Yang, J. (2000) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/345508.345566 · Cited by 144
Cited by
Recent automatic text summarization techniques: a survey
Gambhir, M., & Gupta, V. (2017) · Artificial Intelligence Review · doi:10.1007/s10462-016-9475-9 · Cited by 727
Automatic Keyphrase Extraction: A Survey of the State of the Art
Hasan, K. S., & Ng, V. (2014) · Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.3115/v1/p14-1119 · Cited by 518
PositionRank: An Unsupervised Approach to Keyphrase Extraction from Scholarly Documents
Florescu, C., & Caragea, C. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1102 · Cited by 331
A cross-collection mixture model for comparative text mining
Zhai, C., Velivelli, A., & Yu, B. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014150 · Cited by 272
Dynamics of Conflicts in Wikipedia
Yasseri, T., Sumi, R., Rung, A., Kornai, A., & Kertész, J. (2012) · PLoS ONE · doi:10.1371/journal.pone.0038869 · Cited by 257
Metadata
- Authors
- Zha, H.
- Venue
- Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2002-08-11
- Pages
- 113-120
- OpenAlex
- W2034721576
- Cited by
- 252
- References
- 14
- FWCI
- 3.53
- 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
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.