The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Automated Phrase Mining from Massive Text Corpora
Open accessAbstract
As one of the fundamental tasks in text analysis, phrase mining aims at extracting quality phrases from a text corpus and has various downstream applications including information extraction/retrieval, taxonomy construction, and topic modeling. Most existing methods rely on complex, trained linguistic analyzers, and thus likely have unsatisfactory performance on text corpora of new domains and genres without extra but expensive adaption. None of the state-of-the-art models, even data-driven models, is fully automated because they require human experts for designing rules or labeling phrases. In this paper, we propose a novel framework for automated phrase mining, AutoPhrase, which supports any language as long as a general knowledge base (e.g., Wikipedia) in that language is available, while benefiting from, but not requiring, a POS tagger. Compared to the state-of-the-art methods, AutoPhrase has shown significant improvements in both effectiveness and efficiency on five real-world datasets across different domains and languages. Besides, AutoPhrase can be extended to model single-word quality phrases.
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
Geurts, P., Ernst, D., & Wehenkel, L. (2006) · Machine Learning · doi:10.1007/s10994-006-6226-1 · Cited by 9,300
TextRank: Bringing Order into Text
Mihalcea, R. F., & Tarau, P. (2004) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · Cited by 3,631
Generating Typed Dependency Parses from Phrase Structure Parses
de Marneffe, M.-C., MacCartney, B., & Manning, C. D. (2006) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/3wtkaidk6ea8 · Cited by 2,258
Meme-tracking and the dynamics of the news cycle
Leskovec, J., Backstrom, L., & Kleinberg, J. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557077 · Cited by 1,530
Universal Dependencies v1: A Multilingual Treebank Collection
Nivre, J., de Marneffe, M.-C., Ginter, F., Goldberg, Y., Hajič, J., Manning, C. D., McDonald, R., Petrov, S., Pyysalo, S., Silveira, N., et al. (2016) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/2hnj7od8afy8 · Cited by 1,028
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
Non-projective dependency parsing using spanning tree algorithms
McDonald, R., Pereira, F., Ribarov, K., & Hajič, J. (2005) · Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05 · doi:10.3115/1220575.1220641 · Cited by 847
Automatic recognition of multi-word terms:. the C-value/NC-value method
Frantzi, K., Ananiadou, S., & Mima, H. (2000) · International Journal on Digital Libraries · doi:10.1007/s007999900023 · Cited by 829
TextRank: Bringing Order into Texts
Mihalcea, R., & Tarau, P. (2004) · University of North Texas Digital Library (University of North Texas) · Cited by 632
Simple Semi-supervised Dependency Parsing
Koo, T., Carreras, X., & Collins, M. (2008) · RECERCAT (Consorci de Serveis Universitaris de Catalunya) · Cited by 428
Randomizing Outputs to Increase Prediction Accuracy
Breiman, L. (2000) · Machine Learning · doi:10.1023/a:1007682208299 · Cited by 276
Is it harder to parse Chinese, or the Chinese Treebank?
Lévy, R., & Manning, C. D. (2003) · Annual Meeting of the Association for Computational Linguistics (ACL) · doi:10.3115/1075096.1075152 · Cited by 251
Scalable topical phrase mining from text corpora
El-Kishky, A., Song, Y., Wang, C., Voss, C. R., & Han, J. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2735508.2735519 · Cited by 211
Self-citationMining Quality Phrases from Massive Text Corpora
Liu, J., Shang, J., Wang, C., Ren, X., & Han, J. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2751523 · Cited by 190
Self-citationThe Use of Classifiers in Sequential Inference
Punyakanok, V., & Roth, D. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0111003 · Cited by 168
A Comparative Evaluation of Term Recognition Algorithms
Zhang, Z., Iria, J., Brewster, C., & Ciravegna, F. (2008) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/4jz3ofdiea49 · Cited by 158
Conundrums in Unsupervised Keyphrase Extraction: Making Sense of the State-of-the-Art
Hasan, K. S., & Ng, V. (2010) · Cited by 154
Park, Y. H., Byrd, R. J., & Boguraev, B. (2002) · International Conference on Computational Linguistics · doi:10.3115/1072228.1072370 · Cited by 144
Switching class labels to generate classification ensembles
Martínez-Muñoz, G., & Suárez, A. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.02.020 · Cited by 95
Parameswaran, A., García-Molina, H., & Rajaraman, A. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920914 · Cited by 73
Automatic Keyphrase Extraction by Bridging Vocabulary Gap
Liu, Z., Chen, X., Zheng, Y., & Sun, M. (2011) · Cited by 69
Extracting noun phrases from large-scale texts: a hybrid approach and its automatic evaluation
Chen, K., & Chen, H. (1994) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981732.981764 · Cited by 62
Automatic Construction and Ranking of Topical Keyphrases on Collections of Short Documents
Danilevsky, M., Wang, C., Desai, N., Ren, X., Guo, J., & Han, J. (2014) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611973440.46 · Cited by 57
Self-citationA unified statistical model for the identification of English baseNP
Xun, E., Huang, C., & Zhou, M. (2000) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/1075218.1075233 · Cited by 52
TSAKE: A topical and structural automatic keyphrase extractor
Asl, J. R., & Nickabadi, A. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.05.014 · Cited by 29
Comparative Analysis of Viterbi Training and Maximum Likelihood Estimation for HMMsPreprint
ALLAHVERDYAN, A. E., & Galstyan, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1312.4551 · Cited by 19
Cited by
Empower Sequence Labeling with Task-Aware Neural Language Model
Liu, L., Shang, J., Ren, X., Xu, F., Gui, H., Peng, J., & Han, J. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.12006 · Cited by 333
Self-citationHeterogeneous Network Representation Learning: A Unified Framework With Survey and Benchmark
Yang, C., Xiao, Y., Zhang, Y., Sun, Y., & Han, J. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3045924 · Cited by 324
Self-citationJiang (2019) · doi:10.1145/3292500.3330942 · Cited by 39
Goal-Driven Explainable Clustering via Language Descriptions
Wang, Z., Shang, J., & Zhong, R. (2023) · arXiv · doi:10.48550/arxiv.2305.13749 · Cited by 24
Self-citationTri-Train: Automatic Pre-Fine Tuning between Pre-Training and Fine-Tuning for SciNER
Zeng, Q., Yu, W., Yu, M., Jiang, T., Weninger, T., & Jiang, M. (2020) · Findings of the Association for Computational Linguistics: EMNLP 2020 · doi:10.18653/v1/2020.findings-emnlp.429 · Cited by 10
Self-citation
Metadata
- Authors
- Shang, J., Liu, J., Jiang, M., Ren, X., Voss, C. R., & Han, J.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2018-10-01
- Volume
- 30
- Issue
- 10
- Pages
- 1825-1837
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W2593560537
- Cited by
- 301
- References
- 26
- FWCI
- 24.19
- 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.