Understanding large text corpora via sparse machine learning. (10th May 2013)

• Record Type: Journal Article
• Authors: El Ghaoui, Laurent; Pham, Vu; Li, Guan‐Cheng; Duong, Viet‐An; Srivastava, Ashok; Bhaduri, Kanishka
• Is Part Of: Statistical analysis and data mining. Volume 6:Number 3(2013)
• Page Start: 221
• Page End: 242
• Publication Date: 2013-05-10
• Subjects: Data mining -- Statistical methods -- Periodicals; 006.312
• DOI: 10.1002/sam.11187
• Languages: English
• ISSNs: 1932-1864

Abstract

<abstract abstract-type="main" xml:lang="en"> <title>Abstract</title> <p>Sparse machine learning has recently emerged as powerful tool to obtain models of high‐dimensional data with high degree of interpretability, at low computational cost. The approach has been successfully used in many areas, such as signal and image processing. This article posits that these methods can be extremely useful in the analysis of large collections of text documents, without requiring user expertise in machine learning. Our approach relies on three main ingredients: (i) multidocument text summarization; (ii) comparative summarization of two corpora, both using sparse regression or classification; (iii) sparse principal components and sparse graphical models for unsupervised analysis and visualization of large text corpora. We validate our methods using a corpus of Aviation Safety Reporting System (ASRS) reports and demonstrate that the methods can reveal causal and contributing factors in runway incursions. Furthermore, we show that the methods automatically discover four main tasks that pilots perform during flight, which can aid in further understanding the causal and contributing factors to runway incursions and other drivers for aviation safety incidents. We also provide a comparative study involving other commonly used datasets, and report on the competitiveness of sparse machine learning compared to state‐of‐the‐art methods such as latent Dirichlet allocation (LDA). © 2013 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 6: 221–242, 2013</p> </abstract>