Computer-Assisted Keyword and Document Set Discovery from Unstructured Text

被引:94
作者
King, Gary [1 ]
Lam, Patrick [2 ]
Roberts, Margaret E. [3 ]
机构
[1] Harvard Univ, Inst Quantitat Social Sci, 1737 Cambridge St, Cambridge, MA 02138 USA
[2] Thresher, Dudley, England
[3] Univ Calif San Diego, Dept Polit Sci, Social Sci Bldg 301,9500 Gilman Dr,0521, La Jolla, CA 92093 USA
关键词
INFORMATION-RETRIEVAL; CLASSIFICATION; COVERAGE; MEDIA;
D O I
10.1111/ajps.12291
中图分类号
D0 [政治学、政治理论];
学科分类号
0302 ; 030201 ;
摘要
The (unheralded) first step in many applications of automated text analysis involves selecting keywords to choose documents from a large text corpus for further study. Although all substantive results depend on this choice, researchers usually pick keywords in ad hoc ways that are far from optimal and usually biased. Most seem to think that keyword selection is easy, since they do Google searches every day, but we demonstrate that humans perform exceedingly poorly at this basic task. We offer a better approach, one that also can help with following conversations where participants rapidly innovate language to evade authorities, seek political advantage, or express creativity; generic web searching; eDiscovery; look-alike modeling; industry and intelligence analysis; and sentiment and topic analysis. We develop a computer-assisted (as opposed to fully automated or human-only) statistical approach that suggests keywords from available text without needing structured data as inputs. This framing poses the statistical problem in a new way, which leads to a widely applicable algorithm. Our specific approach is based on training classifiers, extracting information from (rather than correcting) their mistakes, and summarizing results with easy-to-understand Boolean search strings. We illustrate how the technique works with analyses of English texts about the Boston Marathon bombings, Chinese social media posts designed to evade censorship, and others.
引用
收藏
页码:971 / 988
页数:18
相关论文
共 35 条
  • [1] [Anonymous], 2016, THESIS
  • [2] [Anonymous], 2011, arXiv
  • [3] [Anonymous], 1971, SMART RETRIEVAL SYST
  • [4] Introduction to semi-supervised learning
    Goldberg, Xiaojin
    [J]. Synthesis Lectures on Artificial Intelligence and Machine Learning, 2009, 6 : 1 - 116
  • [5] Comparisons of Online Recruitment Strategies for Convenience Samples: Craigslist, Google AdWords, Facebook, and Amazon Mechanical Turk
    Antoun, Christopher
    Zhang, Chan
    Conrad, Frederick G.
    Schober, Michael F.
    [J]. FIELD METHODS, 2016, 28 (03) : 231 - 246
  • [6] BAI J., 2005, Proceedings of ACM CIKM 05, P688, DOI DOI 10.1145/1099554.1099725
  • [7] Bauml K.H., 2008, LEARNING MEMORY COMP, VII, P195, DOI DOI 10.1016/B978-012370509-9.00155-8
  • [8] Bishop CM, 1995, Neural Networks for Pattern Recognition
  • [9] Carpineto C, 2004, J UNIVERS COMPUT SCI, V10, P985
  • [10] A Survey of Automatic Query Expansion in Information Retrieval
    Carpineto, Claudio
    Romano, Giovanni
    [J]. ACM COMPUTING SURVEYS, 2012, 44 (01)