Identifying well-formed biomedical phrases in MEDLINE® text

被引:3
|
作者
Kim, Won [1 ]
Yeganova, Lana [1 ]
Comeau, Donald C. [1 ]
Wilbur, W. John [1 ]
机构
[1] Natl Lib Med, CBB, NCBI, NIH, Bethesda, MD 20894 USA
关键词
Machine learning; Imbalanced data; Biomedical phrases; Statistical phrase identification; Unified medical language system; Abbreviation full forms;
D O I
10.1016/j.jbi.2012.05.005
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In the modern world people frequently interact with retrieval systems to satisfy their information needs. Humanly understandable well-formed phrases represent a crucial interface between humans and the web, and the ability to index and search with such phrases is beneficial for human-web interactions. In this paper we consider the problem of identifying humanly understandable, well formed, and high quality biomedical phrases in MEDLINE documents. The main approaches used previously for detecting such phrases are syntactic, statistical, and a hybrid approach combining these two. In this paper we propose a supervised learning approach for identifying high quality phrases. First we obtain a set of known well-formed useful phrases from an existing source and label these phrases as positive. We then extract from MEDLINE a large set of multiword strings that do not contain stop words or punctuation. We believe this unlabeled set contains many well-formed phrases. Our goal is to identify these additional high quality phrases. We examine various feature combinations and several machine learning strategies designed to solve this problem. A proper choice of machine learning methods and features identifies in the large collection strings that are likely to be high quality phrases. We evaluate our approach by making human judgments on multiword strings extracted from MEDLINE using our methods. We find that over 85% of such extracted phrase candidates are humanly judged to be of high quality. Published by Elsevier Inc.
引用
收藏
页码:1035 / 1041
页数:7
相关论文
共 50 条
  • [31] Educating Social Workers to Establish Well-Formed Goals
    Van Voorhis, Rebecca
    Bennett, Robert
    Chang, Valerie
    JOURNAL OF TEACHING IN SOCIAL WORK, 2006, 26 (1-2) : 147 - 161
  • [32] Verification of well-formed communicating recursive state machines
    Bozzelli, Laura
    La Torre, Salvatore
    Peron, Adriano
    THEORETICAL COMPUTER SCIENCE, 2008, 403 (2-3) : 382 - 405
  • [33] Well-formed decompositions of generalized additive independence models
    Michel Grabisch
    Christophe Labreuche
    Mustapha Ridaoui
    Annals of Operations Research, 2022, 312 : 827 - 852
  • [34] Well-formed semantic model for co-learning
    Alomari, Jehad
    Hussain, Mohammed
    Turki, Skander
    Masud, Mehedi
    COMPUTERS IN HUMAN BEHAVIOR, 2015, 51 : 821 - 828
  • [35] Grammatical illusions - well-formed local - global deviant
    Haider, Hubert
    ZEITSCHRIFT FUR SPRACHWISSENSCHAFT, 2011, 30 (02): : 223 - 257
  • [36] Expressiveness and efficient analysis of stochastic well-formed nets
    Franceschinis, G
    APPLICATIONS AND THEORY OF PETRI NETS 2005, PROCEEDINGS, 2005, 3536 : 1 - +
  • [37] A NOTE ON GENERATING WELL-FORMED PARENTHESIS STRINGS LEXICOGRAPHICALLY
    ER, MC
    COMPUTER JOURNAL, 1983, 26 (03): : 205 - 207
  • [38] Well-formed decompositions of generalized additive independence models
    Grabisch, Michel
    Labreuche, Christophe
    Ridaoui, Mustapha
    ANNALS OF OPERATIONS RESEARCH, 2022, 312 (02) : 827 - 852
  • [39] Flexible query techniques for well-formed XML documents
    Damiani, E
    Tanca, L
    KES'2000: FOURTH INTERNATIONAL CONFERENCE ON KNOWLEDGE-BASED INTELLIGENT ENGINEERING SYSTEMS & ALLIED TECHNOLOGIES, VOLS 1 AND 2, PROCEEDINGS, 2000, : 708 - 711
  • [40] Parametric stochastic well-formed nets and compositional modelling
    Ballarini, P
    Donatelli, S
    Franceschinis, G
    APPLICATION AND THEORY OF PETRI NETS 2000, PROCEEDINGS, 2000, 1825 : 43 - 62