DOCSLIB.ORG

Bag-Of-Embeddings for Text Classification

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Bag-Of-Embeddings for Text Classification Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16) Bag-of-Embeddings for Text Classification 1 2 1 3 Peng Jin, Yue Zhang, Xingyuan Chen, ⇤ Yunqing Xia 1 School of Computer Science, Leshan Normal University, Leshan China, 614000 2 Singapore University of Technology and Design, Singapore 487372 3 Search Technology Center, Microsoft, Beijing China, 100087 Abstract More sources of information have been explored for text classification, including parts of speech [Lewis, 1995], syn- Words are central to text classification. It has tax structures [Post and Bergsma, 2013; Tetsuji et al., 2010] been shown that simple Naive Bayes models with and semantic compositionality [Moilanen and Pulman, 2007]. word and bigram features can give highly compet- However, such features have demonstrated limited gains over itive accuracies when compared to more sophisti- bag-of-words features [Wang and Manning, 2012]. One use- cated models with part-of-speech, syntax and se- ful feature beyond bag-of-words is bag-of-ngrams. Wang and mantic features. Embeddings offer distributional Manning [2012] show that bigram features are particularly features about words. We study a conceptually useful for sentiment classification. Bigrams offer a certain simple classification model by exploiting multi- degree of compositionality while being relatively less sparse prototype word embeddings based on text classes. compared with larger n-gram features. For example, the bi- The key assumption is that words exhibit differ- gram “abnormal return” strongly indicates finance, although ent distributional characteristics under different text both “abnormal” and “return” can be common across dif- classes. Based on this assumption, we train multi- ference classes. Similar examples include “world cup” and prototype distributional word representations for “large bank”, where bi-grams indicate text classes, but the different text classes. Given a new document, its words do not. text class is predicted by maximizing the proba- One intuitive reason behind the strength of bigrams is that bilities of embedding vectors of its words under they resolve the ambiguity of polysemous words. In the above the class. In two standard classification benchmark examples the words ”return”, ”cup”, and ”bank” have dif- datasets, one is balance and the other is imbalance, ferent meanings under different document classes, and the our model outperforms state-of-the-art systems, on correct identification of their word sense under a ngram con- both accuracy and macro-average F-1 score. text is useful for identifying the document class. For exam- ple, when the word ”bank” exists under a context with words 1 Introduction such as ”card” and ”busy”, it strongly indicates the ”finance” sense. This fact suggests a simple extension to bag-of-word Text classification is important for a wide range of web ap- features by incorporating context and word sense informa- [ et al. ] plications, such as web search Chekuri , 1997 , opinion tion. We propose a natural extension to the skip-gram word [ ] [ mining Vo and Zhang, 2015 , and event detection Kumaran embedding model [Mikolov et al., 2013] to this end. and Allan, 2004]. Dominant approaches in the literature treat text classification as a standard classification problem, using Word embeddings are low-dimensional, dense vector rep- supervised or semi-supervised machine learning methods. A resentation of words, first proposed in neural language mod- key research topic is the design of effective feature represen- els [Bengio et al., 2003]. Traditionally, embeddings are tations. trained during the training of a neural language model as a Words are central to text classification. Bag-of-words part of the model parameters. Mikolov et al. [2013] define models [Harris, 1954], such as Naive Bayes [Mccallum and specific objective functions for efficient training of word em- Nigam, 1998] can give highly competitive baselines com- beddings, by simplifying the original training objective of a pared with much more sophisticated models with complex neural language model. The skip-gram model trains word feature representations. The main intuition behind is that embeddings by maximizing the probabilities of words given there is typically a salient set of words that signal each their context windows. Two sets of embeddings are defined document class. For example, in news the words “coach”, for the same word as a target word and a context word, re- “sport”, “basketball” occur relatively frequently in sports, and spectively. The probability of a target word is estimated by the words “chipset”, “compiler” and “Linux” are relatively the cosine similarities between the target embedding and the unique for information technology. content embeddings of its context words. This offers a way to estimate word probability via the embedding probability that ⇤Corresponding author: Xingyuan Chen ([email protected]) readily integrates context information. 2824 To further integrate word sense information, we make a [Kalchbrenner et al., 2014] and deep convolutional neural simple extension by training multi-prototype target word em- network [Santos and Gatti, 2014]. There has also been work beddings, with one distinct vector trained for a word under on directly learning distributed vector representations of para- each class. The context vectors of words remain the same graphs and sentences [Le and Mikolov, 2014], which has been across different classes. Here by associating word senses with shown as useful as the above mentioned neural network mod- document classes, we make the assumption that each word els for text classification. Such neural network result in vector exhibits one sense in each document class, and the sense of representation of text data. Along this line, Tang et al. [2014] a word differs across different classes. This assumption is is the closet in spirit to our work. They learn text embed- highly coarse-grained and does not correspond to the defi- dings specifically for end tasks, such as classification. We nition of word senses in linguistics. However, it empirically also learn word embeddings specifically for text classifica- works effectively, and we find that the definition of sense here tion. However, rather than learning one vector for each word, can capture subtle differences between word meanings across which Tang et al. [2014] do, we learn multi-prototype em- different document classes. beddings, with certain words having multiple vector forms Under the above assumptions, the probability of a class according to the text class. In addition, we have a very sim- given a document can be calculated from the probabilities ple document model, with the only parameters being word of the embeddings of each word under this class. Since the vectors. The simplicity demonstrates the effectiveness of in- probability of each word embeddings is calculated separately, corporating text class information into distributed word rep- we call this model a bag-of-embeddings model. Training re- resentation. quires text corpora with class labels, some of them are ob- Our work is also related to prior work on multi-prototype tained from naturally labeled [Go et al., 2009] and some are word embeddings [Reisinger and Mooney, 2010; Huang et hand-labeled [Lewis, 1995]. The bag-of-embeddings model al., 2012; Tian et al., 2014]. Previous methods define word is conceptually simple, with the only parameters being word prototypes according to word senses from ontologies, or in- embeddings. We show that maximum-likelihood training for duce word senses automatically. They share a more linguistic document classification is consistent with the skip-gram ob- focus on word similarities. In contrast, our objective is to jective for training multi-prototype word embeddings. improve text classification performance, and hence we train Experiments on two standard document classification multi-prototype embeddings based on text classes. benchmark data show that our model achieve higher ac- curacies and macro-F1 scores compared than state-of- 3 Method the-art models. Our method achieves the best re- ported accuracies for both the balanced and the im- 3.1 The Skip-gram Model balanced datasets. The source code of this paper is Our bag-of-embeddings model extends the skip-gram model released at https://github.com/hiccxy/Bag-of-embedding-for- [Mikolov et al., 2013], which is a simplification of neural text-classification. language models for efficient training of word embeddings. The skip-gram model works by maximizing the probabilities of words being predicted by their context words. 2 Related Work In particular, two sets of embeddings are defined for each Text classification has traditionally been solved as a standard word w, when w is used as the output target word and as the classification task, using supervised learning approaches such input context word, respectively. We use ~v (w) and ~u (w) to as Naive Bayes [Mccallum and Nigam, 1998], logistic re- denote target (output) embedding vector and context (in- gression [Nigam et al., 1999], and support vector machines put) embedding vector of w, respectively. [Joachims, 1998]. Word features, and in particular bag-of- Given a target word w and a context w0 of w, the prob- words features, have been used for classification. There have ability of ~v (w) given ~u (w0) is defined based on the cosine been research efforts to incorporate more complex features similarity between ~v (w) and ~u (w0), as follows, into text classification models. Lewis [1995] uses parts-of-
Load more

Recommended publications
  • An Evaluation of Machine Learning Approaches to Natural Language Processing for Legal Text Classification
    Imperial College London Department of Computing An Evaluation of Machine Learning Approaches to Natural Language Processing for Legal Text Classification Supervisors: Author: Prof Alessandra Russo Clavance Lim Nuri Cingillioglu Submitted in partial fulfillment of the requirements for the MSc degree in Computing Science of Imperial College London September 2019 Contents Abstract 1 Acknowledgements 2 1 Introduction 3 1.1 Motivation .................................. 3 1.2 Aims and objectives ............................ 4 1.3 Outline .................................... 5 2 Background 6 2.1 Overview ................................... 6 2.1.1 Text classification .......................... 6 2.1.2 Training, validation and test sets ................. 6 2.1.3 Cross validation ........................... 7 2.1.4 Hyperparameter optimization ................... 8 2.1.5 Evaluation metrics ......................... 9 2.2 Text classification pipeline ......................... 14 2.3 Feature extraction ............................. 15 2.3.1 Count vectorizer .......................... 15 2.3.2 TF-IDF vectorizer ......................... 16 2.3.3 Word embeddings .......................... 17 2.4 Classifiers .................................. 18 2.4.1 Naive Bayes classifier ........................ 18 2.4.2 Decision tree ............................ 20 2.4.3 Random forest ........................... 21 2.4.4 Logistic regression ......................... 21 2.4.5 Support vector machines ...................... 22 2.4.6 k-Nearest Neighbours .......................
    [Show full text]
  • Fasttext.Zip: Compressing Text Classification Models
    Under review as a conference paper at ICLR 2017 FASTTEXT.ZIP: COMPRESSING TEXT CLASSIFICATION MODELS Armand Joulin, Edouard Grave, Piotr Bojanowski, Matthijs Douze, Herve´ Jegou´ & Tomas Mikolov Facebook AI Research fajoulin,egrave,bojanowski,matthijs,rvj,[email protected] ABSTRACT We consider the problem of producing compact architectures for text classifica- tion, such that the full model fits in a limited amount of memory. After consid- ering different solutions inspired by the hashing literature, we propose a method built upon product quantization to store word embeddings. While the original technique leads to a loss in accuracy, we adapt this method to circumvent quan- tization artefacts. Combined with simple approaches specifically adapted to text classification, our approach derived from fastText requires, at test time, only a fraction of the memory compared to the original FastText, without noticeably sacrificing quality in terms of classification accuracy. Our experiments carried out on several benchmarks show that our approach typically requires two orders of magnitude less memory than fastText while being only slightly inferior with respect to accuracy. As a result, it outperforms the state of the art by a good margin in terms of the compromise between memory usage and accuracy. 1 INTRODUCTION Text classification is an important problem in Natural Language Processing (NLP). Real world use- cases include spam filtering or e-mail categorization. It is a core component in more complex sys- tems such as search and ranking. Recently, deep learning techniques based on neural networks have achieved state of the art results in various NLP applications. One of the main successes of deep learning is due to the effectiveness of recurrent networks for language modeling and their application to speech recognition and machine translation (Mikolov, 2012).
    [Show full text]
  • Supervised and Unsupervised Word Sense Disambiguation on Word Embedding Vectors of Unambiguous Synonyms
    Supervised and Unsupervised Word Sense Disambiguation on Word Embedding Vectors of Unambiguous Synonyms Aleksander Wawer Agnieszka Mykowiecka Institute of Computer Science Institute of Computer Science PAS PAS Jana Kazimierza 5 Jana Kazimierza 5 01-248 Warsaw, Poland 01-248 Warsaw, Poland [email protected] [email protected] Abstract Unsupervised WSD algorithms aim at resolv- ing word ambiguity without the use of annotated This paper compares two approaches to corpora. There are two popular categories of word sense disambiguation using word knowledge-based algorithms. The first one orig- embeddings trained on unambiguous syn- inates from the Lesk (1986) algorithm, and ex- onyms. The first one is an unsupervised ploit the number of common words in two sense method based on computing log proba- definitions (glosses) to select the proper meaning bility from sequences of word embedding in a context. Lesk algorithm relies on the set of vectors, taking into account ambiguous dictionary entries and the information about the word senses and guessing correct sense context in which the word occurs. In (Basile et from context. The second method is super- al., 2014) the concept of overlap is replaced by vised. We use a multilayer neural network similarity represented by a DSM model. The au- model to learn a context-sensitive transfor- thors compute the overlap between the gloss of mation that maps an input vector of am- the meaning and the context as a similarity mea- biguous word into an output vector repre- sure between their corresponding vector represen- senting its sense. We evaluate both meth- tations in a semantic space.
    [Show full text]
  • Investigating Classification for Natural Language Processing Tasks
    UCAM-CL-TR-721 Technical Report ISSN 1476-2986 Number 721 Computer Laboratory Investigating classification for natural language processing tasks Ben W. Medlock June 2008 15 JJ Thomson Avenue Cambridge CB3 0FD United Kingdom phone +44 1223 763500 http://www.cl.cam.ac.uk/ c 2008 Ben W. Medlock This technical report is based on a dissertation submitted September 2007 by the author for the degree of Doctor of Philosophy to the University of Cambridge, Fitzwilliam College. Technical reports published by the University of Cambridge Computer Laboratory are freely available via the Internet: http://www.cl.cam.ac.uk/techreports/ ISSN 1476-2986 Abstract This report investigates the application of classification techniques to four natural lan- guage processing (NLP) tasks. The classification paradigm falls within the family of statistical and machine learning (ML) methods and consists of a framework within which a mechanical `learner' induces a functional mapping between elements drawn from a par- ticular sample space and a set of designated target classes. It is applicable to a wide range of NLP problems and has met with a great deal of success due to its flexibility and firm theoretical foundations. The first task we investigate, topic classification, is firmly established within the NLP/ML communities as a benchmark application for classification research. Our aim is to arrive at a deeper understanding of how class granularity affects classification accuracy and to assess the impact of representational issues on different classification models. Our second task, content-based spam filtering, is a highly topical application for classification techniques due to the ever-worsening problem of unsolicited email.
    [Show full text]
  • Linked Data Triples Enhance Document Relevance Classification
    applied sciences Article Linked Data Triples Enhance Document Relevance Classification Dinesh Nagumothu * , Peter W. Eklund , Bahadorreza Ofoghi and Mohamed Reda Bouadjenek School of Information Technology, Deakin University, Geelong, VIC 3220, Australia; [email protected] (P.W.E.); [email protected] (B.O.); [email protected] (M.R.B.) * Correspondence: [email protected] Abstract: Standardized approaches to relevance classification in information retrieval use generative statistical models to identify the presence or absence of certain topics that might make a document relevant to the searcher. These approaches have been used to better predict relevance on the basis of what the document is “about”, rather than a simple-minded analysis of the bag of words contained within the document. In more recent times, this idea has been extended by using pre-trained deep learning models and text representations, such as GloVe or BERT. These use an external corpus as a knowledge-base that conditions the model to help predict what a document is about. This paper adopts a hybrid approach that leverages the structure of knowledge embedded in a corpus. In particular, the paper reports on experiments where linked data triples (subject-predicate-object), constructed from natural language elements are derived from deep learning. These are evaluated as additional latent semantic features for a relevant document classifier in a customized news- feed website. The research is a synthesis of current thinking in deep learning models in NLP and information retrieval and the predicate structure used in semantic web research. Our experiments Citation: Nagumothu, D.; Eklund, indicate that linked data triples increased the F-score of the baseline GloVe representations by 6% P.W.; Ofoghi, B.; Bouadjenek, M.R.
    [Show full text]
  • Natural Language Processing Security- and Defense-Related Lessons Learned
    July 2021 Perspective EXPERT INSIGHTS ON A TIMELY POLICY ISSUE PETER SCHIRMER, AMBER JAYCOCKS, SEAN MANN, WILLIAM MARCELLINO, LUKE J. MATTHEWS, JOHN DAVID PARSONS, DAVID SCHULKER Natural Language Processing Security- and Defense-Related Lessons Learned his Perspective offers a collection of lessons learned from RAND Corporation projects that employed natural language processing (NLP) tools and methods. It is written as a reference document for the practitioner Tand is not intended to be a primer on concepts, algorithms, or applications, nor does it purport to be a systematic inventory of all lessons relevant to NLP or data analytics. It is based on a convenience sample of NLP practitioners who spend or spent a majority of their time at RAND working on projects related to national defense, national intelligence, international security, or homeland security; thus, the lessons learned are drawn largely from projects in these areas. Although few of the lessons are applicable exclusively to the U.S. Department of Defense (DoD) and its NLP tasks, many may prove particularly salient for DoD, because its terminology is very domain-specific and full of jargon, much of its data are classified or sensitive, its computing environment is more restricted, and its information systems are gen- erally not designed to support large-scale analysis. This Perspective addresses each C O R P O R A T I O N of these issues and many more. The presentation prioritizes • identifying studies conducting health service readability over literary grace. research and primary care research that were sup- We use NLP as an umbrella term for the range of tools ported by federal agencies.
    [Show full text]
  • Using Wordnet to Disambiguate Word Senses for Text Classification
    Using WordNet to Disambiguate Word Senses for Text Classification Ying Liu1, Peter Scheuermann2, Xingsen Li1, and Xingquan Zhu1 1 Data Technology and Knowledge Economy Research Center, Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences 100080, Beijing, China [email protected], [email protected], [email protected] 2 Department of Electrical and Computer Engineering Northwestern University, Evanston, Illinois, USA, 60208 [email protected] Abstract. In this paper, we propose an automatic text classification method based on word sense disambiguation. We use “hood” algorithm to remove the word ambiguity so that each word is replaced by its sense in the context. The nearest ancestors of the senses of all the non-stopwords in a give document are selected as the classes for the given document. We apply our algorithm to Brown Corpus. The effectiveness is evaluated by comparing the classification results with the classification results using manual disambiguation offered by Princeton University. Keywords: disambiguation, word sense, text classification, WordNet. 1 Introduction Text classification aims at automatically assigning a document to a pre-defined topic category. A number of machine learning algorithms have been investigated for text classification, such as K-Nearest Neighbor (KNN) [1], Centroid Classifier [2], Naïve Bayes [3], Decision Trees [4], Support Vector Machines (SVM) [4]. In such classifiers, each document is represented by a n-dimensional vector in a feature space, where each feature is a keyword in the given document. Then traditional classification algorithms can be applied to generate a classification model. To classify an unseen document, a feature vector is constructed by using the same set of n features and then passed to the model as the input.
    [Show full text]
  • An Automatic Text Document Classification Using Modified Weight and Semantic Method
    International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-8 Issue-12, October 2019 An Automatic Text Document Classification using Modified Weight and Semantic Method K.Meena, R.Lawrance Abstract: Text mining is the process of transformation of Text analytics involves information transformation, useful information from the structured or unstructured sources. pattern recognition, information retrieval, association In text mining, feature extraction is one of the vital parts. This analysis, predictive analytics and visualization. The goal of paper analyses some of the feature extraction methods and text mining is to turn text data into useful data for analysis proposed the enhanced method for feature extraction. Term with the help of analytical methods and Natural Language Frequency-Inverse Document Frequency(TF-IDF) method only assigned weight to the term based on the occurrence of the term. Processing (NLP). The increased use of text management in Now, it is enlarged to increases the weight of the most important the internet has resulted in the enhanced research activities words and decreases the weight of the less important words. This in text mining. enlarged method is called as M-TF-IDF. This method does not Now-a-days, everyone has been using internet for surfing, consider the semantic similarity between the terms. Hence, Latent posting, creating blogs and for various purpose. Internet has Semantic Analysis(LSA) method is used for feature extraction massive collection of many text contents. The unstructured and dimensionality reduction. To analyze the performance of the text content size may be varying. For analyzing the text proposed feature extraction methods, two benchmark datasets contents of internet efficiently and effectively, it must be like Reuter-21578-R8 and 20 news group and two real time classified or clustered.
    [Show full text]
  • Natural Language Information Retrieval Text, Speech and Language Technology
    Natural Language Information Retrieval Text, Speech and Language Technology VOLUME7 Series Editors Nancy Ide, Vassar College, New York Jean Veronis, Universite de Provence and CNRS, France Editorial Board Harald Baayen, Max Planck Institute for Psycholinguistics, The Netherlands Kenneth W. Church, AT& T Bell Labs, New Jersey, USA Judith Klavans, Columbia University, New York, USA David T Barnard, University of Regina, Canada Dan Tufis, Romanian Academy of Sciences, Romania Joaquim Llisterri, Universitat Autonoma de Barcelona, Spain Stig Johansson, University of Oslo, Norway Joseph Mariani, LIMS/-CNRS, France The titles published in this series are listed at the end of this volume. Natural Language Information Retrieval Edited by Tomek Strzalkowski General Electric, Research & Development SPRINGER-SCIENCE+BUSINESS MEDIA, B.V. A C.I.P. Catalogue record for this book is available from the Library of Congress. ISBN 978-90-481-5209-4 ISBN 978-94-017-2388-6 (eBook) DOI 10.1007/978-94-017-2388-6 Printed on acid-free paper All Rights Reserved ©1999 Springer Science+Business Media Dordrecht Originally published by Kluwer Academic Publishers in 1999 No part of the material protected by this <:opyright notice may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying, recording or by any information storage and retrieval system, without written permission from the copyright owner TABLE OF CONTENTS PREFACE xiii CONTRIBUTING AUTHORS xxiii 1 WHAT IS THE ROLE OF NLP IN TEXT RETRIEVAL? }(aren Sparck Jones 1 1 Introduction 0 0 0 0 0 0 0 0 0 0 0 0 1 2 Linguistically-motivated indexing 2 201 Basic Concepts 0 0 0 0 0 .
    [Show full text]
  • The Impact of NLP Techniques in the Multilabel Text Classification Problem
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Repositório Científico da Universidade de Évora The impact of NLP techniques in the multilabel text classification problem Teresa Gon¸calves and Paulo Quaresma Departamento de Inform´atica, Universidade de Ev´ ora, 7000 Ev´ ora, Portugal tcg j [email protected] Abstract. Support Vector Machines have been used successfully to classify text documents into sets of concepts. However, typically, linguistic information is not being used in the classification process or its use has not been fully evaluated. We apply and evaluate two basic linguistic procedures (stop-word removal and stemming/lemmatization) to the multilabel text classification problem. These procedures are applied to the Reuters dataset and to the Portuguese juridical documents from Supreme Courts and Attorney General's Office. 1 Introduction Automatic classification of documents is an important problem in many do- mains. Just as an example, it is needed by web search engines and information retrieval systems to organise text bases into sets of semantic categories. In order to develop better algorithms for document classification it is nec- essary to integrate research from several areas. In this paper, we evaluate the impact of using natural language processing (NLP) and information retrieval (IR) techniques in a machine learning algorithm. Support Vector Machines (SVM) was the chosen classification algorithm. Several approaches to automatically classify text documents using linguis- tic transformations and Machine Learning have been pursued. For example, there are approaches that present alternative ways of representing documents using the RIPPER algorithm [10], that use Na¨ıve Bayes to select features [5] and that generate of phrasal features using both [2].
    [Show full text]
  • Word Embeddings for Multi-Label Document Classification
    Word Embeddings for Multi-label Document Classification Ladislav Lenc†‡ Pavel Kral´ †‡ ‡ NTIS – New Technologies † Department of Computer for the Information Society, Science and Engineering, University of West Bohemia, University of West Bohemia, Plzen,ˇ Czech Republic Plzen,ˇ Czech Republic [email protected] [email protected] Abstract proaches including computer vision and natural language processing. Therefore, in this work we In this paper, we analyze and evaluate use different approaches based on convolutional word embeddings for representation of neural nets (CNNs) which were already presented longer texts in the multi-label document in Kim(2014) and Lenc and Kr al´ (2017). classification scenario. The embeddings Usually, the pre-trained word vectors ob- are used in three convolutional neural net- tained by some semantic model (e.g. word2vec work topologies. The experiments are (w2v) (Mikolov et al., 2013a) or glove (Penning- ˇ realized on the Czech CTK and English ton et al., 2014)) are used for initialization of Reuters-21578 standard corpora. We com- the embedding layer of the particular neural net. pare the results of word2vec static and These vectors can then be progressively adapted trainable embeddings with randomly ini- during neural network training. It was shown in tialized word vectors. We conclude that many experiments that it is possible to obtain bet- initialization does not play an important ter results using these vectors compared to the ran- role for classification. However, learning domly initialized vectors. Moreover, it has been of word vectors is crucial to obtain good proven that even “static” vectors (initialized by results. pre-trained embeddings and fixed during the net- work training) usually bring better performance 1 Introduction than randomly initialized and trained ones.
    [Show full text]
  • Experiments with One-Class SVM and Word Embeddings for Document Classification
    Experiments with One-Class SVM and Word Embeddings for Document Classification Jingnan Bi1[0000−0001−6191−3151], Hyoungah Kim2[0000−0002−0744−5884], and Vito D'Orazio1[0000−0003−4249−0768] 1 University of Texas at Dallas School of Economic, Political, and Policy Sciences 2 Chung-Ang University Institute of Public Policy and Administration Abstract. Researchers often possess a document set that describes some concept of interest, but which has not been systematically collected. This means that the researcher's set of known, relevant documents, is of little use in machine learning applications where the training data is ideally sampled from the same set as the testing data. Here, we propose and test several methods designed to help solve this problem. The central idea is to combine a one-class classifier, here we use the OCC-SVM, with feature engineering methods that we expect to make the input data more generalizable. Specifically, we use two word embeddings approaches, and combine each with a topic model approach. Our experiments show that Word2Vec with Vector Averaging produces the best model. Furthermore, this model is able to maintain high levels of recall at moderate levels of precision. This is valuable for researchers who place a high cost on false negatives. Keywords: document classification · content analysis · one-class algo- rithms · word embeddings. 1 Introduction Text classification is widely used in the computational social sciences [5, 10, 12, 25]. Typically, the initial corpus is not labeled, but researchers wish to classify it to identify relevant information on some concept of interest. In an ideal setting, and to use standard supervised machine learning, a researcher would randomly sample from the corpus, label the sampled documents, and use that as training data.
    [Show full text]