The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Learning Algorithms for Keyphrase Extraction
Open accessAbstract
Many academic journals ask their authors to provide a list of about five to fifteen keywords, to appear on the first page of each article. Since these key words are often phrases of two or more words, we prefer to call them keyphrases. There is a wide variety of tasks for which keyphrases are useful, as we discuss in this paper. We approach the problem of automatically extracting keyphrases from text as a supervised learning task. We treat a document as a set of phrases, which the learning algorithm must learn to classify as positive or negative examples of keyphrases. Our first set of experiments applies the C4.5 decision tree induction algorithm to this learning task. We evaluate the performance of nine different configurations of C4.5. The second set of experiments applies the GenEx algorithm to the task. We developed the GenEx algorithm specifically for automatically extracting keyphrases from text. The experimental results support the claim that a custom-designed algorithm (GenEx), incorporating specialized procedural domain knowledge, can generate better keyphrases than a general-purpose algorithm (C4.5). Subjective human evaluation of the keyphrases generated by GenEx suggests that about 80% of the keyphrases are acceptable to human readers. This level of performance should be satisfactory for a wide variety of applications.
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
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
The Automatic Creation of Literature Abstracts
Luhn, H. P. (1958) · IBM Journal of Research and Development · doi:10.1147/rd.22.0159 · Cited by 3,246
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
New Methods in Automatic Extracting
Edmundson, H. P. (1969) · Journal of the ACM · doi:10.1145/321510.321519 · Cited by 1,466
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
Quinlan, J. R. (1996) · National Conference on Artificial Intelligence · Cited by 1,262
Machine Learning for the Detection of Oil Spills in Satellite Radar Images
Kubat, M., Holte, R. C., & Matwin, S. (1998) · Machine Learning · doi:10.1023/a:1007452223027 · Cited by 1,243
Development of a Stemming Algorithm
Lovins, J. B. (1968) · Mech. Transl. Comput. Linguistics · Cited by 1,115
Whitley, L. D. (1989) · international conference on Genetic algorithms · Cited by 992
Viewing morphology as an inference process
Krovetz, R. (1993) · Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '93 · doi:10.1145/160688.160718 · Cited by 656
Domain-specific keyphrase extraction
Frank, E., Paynter, G. W., Witten, I. H., Gutwin, C. A., & Nevill-Manning, C. G. (1999) · Research Commons (University of Waikato) · Cited by 647
Constructing literature abstracts by computer: Techniques and prospects
Paice, C. D. (1990) · Information Processing & Management · doi:10.1016/0306-4573(90)90014-s · Cited by 381
Automatic condensation of electronic publications by sentence selection
Brandow, R., Mitze, K., & Rau, L. F. (1995) · Information Processing & Management · doi:10.1016/0306-4573(95)00052-i · Cited by 363
Learning to Extract Keyphrases from TextPreprint
Turney, P. (1999) · arXiv (Cornell University) · doi:10.4224/8913245 · Cited by 295
Self-citationAutomatic Analysis, Theme Generation, and Summarization of Machine-Readable Texts
Salton, G., Allan, J., Buckley, C., & Singhal, A. (1994) · Science · doi:10.1126/science.264.5164.1421 · Cited by 265
An empirical evaluation of bagging and boosting
Maclin, R., & Opitz, D. W. (1997) · Cited by 265
Improving browsing in digital libraries with keyphrase indexes
Gutwin, C., Paynter, G., Witten, I., Nevill-Manning, C., & Frank, E. (1999) · Decision Support Systems · doi:10.1016/s0167-9236(99)00038-x · Cited by 262
The use of phrases and structured queries in information retrieval
Croft, W. B., Turtle, H. R., & Lewis, D. D. (1991) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/122860.122864 · Cited by 262
Assessing Credit Card Applications Using Machine Learning
Carter, C., & Catlett, J. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307093 · Cited by 204
DECISION TREES AS PROBABILISTIC CLASSIFIERS
Quinlan, J. R. (1987) · Proceedings of the Fourth International Workshop on MACHINE LEARNING · doi:10.1016/b978-0-934613-41-5.50007-6 · Cited by 184
Megainduction : machine learning on very large databases
Catlett, J. (1991) · Medical Entomology and Zoology · Cited by 169
Quinlan, J. R. (1990) · Elsevier eBooks · doi:10.1016/b978-0-08-051055-2.50011-0 · Cited by 159
Probability and Statistics: Theory and Applications.
Rohatgi, V. K., & Fraser, D. A. S. (1977) · Journal of the American Statistical Association · doi:10.2307/2286492 · Cited by 81
Probability and Statistics: Theory and Applications
Iosifescu, M., Fraser, D. A. S., & Rohatgi, V. K. (1977) · International Statistical Review · doi:10.2307/1402549 · Cited by 53
Lyberg, L. E., & Cassel, C. M. (2001) · Elsevier eBooks · doi:10.1016/b0-08-043076-7/00496-4 · Cited by 7
(1996)
Cited by
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Mining the Web for Synonyms: PMI-IR versus LSA on TOEFL
Turney, P. D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44795-4_42 · Cited by 1,285
Self-citationImproved automatic keyword extraction given more linguistic knowledge
Hulth, A. (2003) · Proceedings of the 2003 conference on Empirical methods in natural language processing - · doi:10.3115/1119355.1119383 · Cited by 951
Wikify!: linking documents to encyclopedic knowledge
Mihalcea, R., & Csomai, A. (2007) · Proceedings of the sixteenth ACM conference on Conference on information and knowledge management · doi:10.1145/1321440.1321475 · Cited by 909
KEA: practical automatic keyphrase extraction
Witten, I. H., Paynter, G. W., Frank, E., Gutwin, C., & Nevill-Manning, C. G. (1999) · Proceedings of the fourth ACM conference on Digital libraries · doi:10.1145/313238.313437 · Cited by 859
Metadata
- Authors
- Turney, P. D.
- Venue
- Information Retrieval
- Published
- 2000-05
- Volume
- 2
- Issue
- 4
- Pages
- 303-336
- ISSN
- 1386-4564 (ISSN-L)
- 1573-7659
- OpenAlex
- W2145766604
- Cited by
- 889
- References
- 28
- FWCI
- 15.41
- Type
- journal article
- Language
- en
- Open access
- green
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.