The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
KeyGraph: automatic indexing by co-occurrence graph based on building construction metaphor
Abstract
Presents an algorithm for extracting keywords representing the asserted main point in a document, without relying on external devices such as natural-language processing tools or a document corpus. Our algorithm, KeyGraph, is based on the segmentation of a graph, representing the co-occurrence between terms in a document, into clusters. Each cluster corresponds to a concept on which an author's idea is based, and the top-ranked terms are selected as keywords using a statistic based on each term's relationship to these clusters. This strategy comes from considering that a document is constructed like a building for expressing new ideas based on traditional concepts. The experimental results show that the thus-extracted terms match the author's main point quite accurately, even though KeyGraph does not use each term's average frequency in a corpus, i.e. KeyGraph is a content-sensitive, domain-independent indexing device.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1992) · Cited by 23,431
Term-weighting approaches in automatic text retrieval
Salton, G., & Buckley, C. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90021-0 · Cited by 9,740
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 9,680
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
Introduction to modern information retrieval
Dillon, M. (1983) · Information Processing & Management · doi:10.1016/0306-4573(83)90062-6 · Cited by 5,909
A Statistical Approach to Mechanized Encoding and Searching of Literary Information
Luhn, H. P. (1957) · IBM Journal of Research and Development · doi:10.1147/rd.14.0309 · Cited by 1,093
Lexical cohesion computed by thesaural relations as an indicator of the structure of text
Morris, J., & Hirst, G. (1991) · OLAC - Open Language Archives Community · doi:10.5555/971738.971740 · Cited by 950
Multi-paragraph segmentation of expository text
Hearst, M. A. (1994) · Proceedings of the 32nd annual meeting on Association for Computational Linguistics - · doi:10.3115/981732.981734 · Cited by 584
ON THE SPECIFICATION OF TERM VALUES IN AUTOMATIC INDEXING
SALTON, G., & YANG, C. S. (1973) · Journal of Documentation · doi:10.1108/eb026562 · Cited by 583
WebWatcher: A Learning Apprentice for the World Wide Web
Armstrong, R., Freitag, D., Joachims, T., & Mitchell, T. (1995) · doi:10.21236/ada640219 · Cited by 500
Cited by
KEYWORD EXTRACTION FROM A SINGLE DOCUMENT USING WORD CO-OCCURRENCE STATISTICAL INFORMATION
MATSUO, Y., & ISHIZUKA, M. (2004) · International Journal on Artificial Intelligence Tools · doi:10.1142/s0218213004001466 · Cited by 788
Event Detection and Tracking in Social Streams
Sayyadi, H., Hurst, M., & Maykov, A. (2009) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v3i1.13970 · Cited by 295
Metadata
- Authors
- Ohsawa, Y., Benson, N. E., & Yachida, M.
- Venue
- Proceedings IEEE International Forum on Research and Technology Advances in Digital Libraries -ADL'98-
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-27
- Pages
- 12-18
- OpenAlex
- W1638133288
- Cited by
- 422
- References
- 12
- FWCI
- 10.87
- 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: KeyGraph: automatic indexing by co-occurrence graph based on building construction metaphor. https://app.cochat.ai/papers/10.1109/adl.1998.670375
- The paper
- Ohsawa, Y., Benson, N. E., & Yachida, M. (2002). KeyGraph: automatic indexing by co-occurrence graph based on building construction metaphor. Proceedings IEEE International Forum on Research and Technology Advances in Digital Libraries -ADL'98-. https://doi.org/10.1109/adl.1998.670375
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.