Fast Text Classification Using Randomized Explicit Semantic Analysis

被引:9
|
作者
Musaev, Aibek [1 ]
Wang, De [1 ]
Shridhar, Saajan [1 ]
Pu, Calton [1 ]
机构
[1] Georgia Inst Technol, Atlanta, GA 30332 USA
来源
2015 IEEE 16TH INTERNATIONAL CONFERENCE ON INFORMATION REUSE AND INTEGRATION | 2015年
基金
美国国家科学基金会;
关键词
text classification; explicit semantic analysis; social media; event detection;
D O I
10.1109/IRI.2015.62
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Document classification or document categorization is one of the most studied areas in computer science due to its importance. The problem is to assign a document using its text to one or more classes or categories from a predefined set. We propose a new approach for fast text classification using randomized explicit semantic analysis (RS-ESA). It is based on a state of the art approach for word sense disambiguation based on Wikipedia, the largest encyclopedia in existence. Our method reduces Wikipedia repository using a random sample approach resulting in a throughput, which is an order of magnitude faster than the original explicit semantic analysis. RS-ESA approach has been implemented as part of the LITMUS project due to a need in classifying data from Social Media into relevant and irrelevant items with respect to landslide as a natural disaster. We demonstrate that our approach achieves 96% precision when classifying Social Media landslide data collected in December 2014. We also demonstrate the genericity of the proposed approach by using it for separating factual texts from fictional based on Wikipedia articles and fan fiction stories, where we achieve 97% in precision.
引用
收藏
页码:364 / 371
页数:8
相关论文
共 50 条
  • [1] Explicit Semantic Analysis for Computing Semantic Relatedness of Biomedical Text
    Jaiswal, Ayush
    Bhargava, Anunay
    2014 5TH INTERNATIONAL CONFERENCE CONFLUENCE THE NEXT GENERATION INFORMATION TECHNOLOGY SUMMIT (CONFLUENCE), 2014, : 929 - 934
  • [2] Improving Short Text Classification Using Fast Semantic Expansion on Multichannel Convolutional Neural Network
    Sotthisopha, Natthapat
    Vateekul, Peerapon
    2018 19TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2018, : 182 - 187
  • [3] Using Semantic Correlation of HowNet for Short Text Classification
    Ning, Yahui
    Zhang, Li
    Ju, Yarong
    Wang, Weijia
    Li, Shunqin
    APPLIED SCIENCE, MATERIALS SCIENCE AND INFORMATION TECHNOLOGIES IN INDUSTRY, 2014, 513-517 : 1931 - 1934
  • [4] Using semantic roles to improve text classification in the requirements domain
    Alejandro Rago
    Claudia Marcos
    J. Andres Diaz-Pace
    Language Resources and Evaluation, 2018, 52 : 801 - 837
  • [5] Using semantic roles to improve text classification in the requirements domain
    Rago, Alejandro
    Marcos, Claudia
    Andres Diaz-Pace, J.
    LANGUAGE RESOURCES AND EVALUATION, 2018, 52 (03) : 801 - 837
  • [6] Practical study on the semantic analysis algorithm based on text classification
    Deng, Lei
    Tao, Xingzhen
    Tian, Gaohua
    INTERNATIONAL CONFERENCE ON ALGORITHMS, HIGH PERFORMANCE COMPUTING, AND ARTIFICIAL INTELLIGENCE (AHPCAI 2021), 2021, 12156
  • [7] Semantic Enrichment of Text Representation with Wikipedia for Text Classification
    Yamakawa, Hiroki
    Peng, Jing
    Feldman, Anna
    IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2010), 2010,
  • [8] FAST LATENT SEMANTIC INDEX USING RANDOM MAPPING IN TEXT PROCESSING
    Qian, Xiao-Dong
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON WAVELET ANALYSIS AND PATTERN RECOGNITION, VOLS 1 AND 2, 2008, : 788 - 792
  • [9] Integrating Text Classification into Topic Discovery Using Semantic Embedding Models
    Lezama-Sanchez, Ana Laura
    Vidal, Mireya Tovar
    Reyes-Ortiz, Jose A.
    APPLIED SCIENCES-BASEL, 2023, 13 (17):
  • [10] Text classification using genetic algorithm oriented latent semantic features
    Uysal, Alper Kursat
    Gunal, Serkan
    EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (13) : 5938 - 5947