A Domain-Independent Classification Model for Sentiment Analysis Using Neural Models

被引:13
|
作者
Jnoub, Nour [1 ]
Al Machot, Fadi [2 ]
Klas, Wolfgang [1 ]
机构
[1] Univ Vienna, Fac Comp Sci, A-1090 Vienna, Austria
[2] Leibniz Lung Ctr, Res Ctr Borstel, D-23845 Borstel, Germany
来源
APPLIED SCIENCES-BASEL | 2020年 / 10卷 / 18期
关键词
sentiment analysis; natural language processing; deep learning;
D O I
10.3390/app10186221
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Most people nowadays depend on the Web as a primary source of information. Statistical studies show that young people obtain information mainly from Facebook, Twitter, and other social media platforms. By relying on these data, people may risk drawing the incorrect conclusions when reading the news or planning to buy a product. Therefore, systems that can detect and classify sentiments and assist users in finding the correct information on the Web is highly needed in order to prevent Web surfers from being easily deceived. This paper proposes an intensive study regarding domain-independent classification models for sentiment analysis that should be trained only once. The study consists of two phases: the first phase is based on a deep learning model which is training a neural network model once after extracting robust features and saving the model and its parameters. The second phase is based on applying the trained model on a totally new dataset, aiming at correctly classifying reviews as positive or negative. The proposed model is trained on the IMDb dataset and then tested on three different datasets: IMDb dataset, Movie Reviews dataset, and our own dataset collected from Amazon reviews that rate users' opinions regarding Apple products. The work shows high performance using different evaluation metrics compared to the stat-of-the-art results.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] Multiclass Sentiment Classification of Online Health Forums using Both Domain-independent and Domain-specific Features
    Alnashwan, Rana
    Sorensen, Humphrey
    O'Riordan, Adrian
    Hoare, Cathal
    BDCAT'17: PROCEEDINGS OF THE FOURTH IEEE/ACM INTERNATIONAL CONFERENCE ON BIG DATA COMPUTING, APPLICATIONS AND TECHNOLOGIES, 2017, : 75 - 83
  • [2] Identifying the Sentiment in Domain-independent Chinese Sentences
    Si Mengwei
    Su Mingche
    Wang Jiayu
    HIGH PERFORMANCE STRUCTURES AND MATERIALS ENGINEERING, PTS 1 AND 2, 2011, 217-218 : 808 - +
  • [3] TwitterSentiDetector: a domain-independent Twitter sentiment analyser
    Kabakus, Abdullah Talha
    Kara, Resul
    INFOR, 2018, 56 (02) : 137 - 162
  • [4] Analyzing Hotel Reviews with Sentitext: a domain-independent, sentiment analysis system
    Moreno Ortiz, Antonio
    Pineda Castillo, Francisco
    Hidalgo Garcia, Rodrigo
    PROCESAMIENTO DEL LENGUAJE NATURAL, 2010, (45): : 31 - 39
  • [5] Optimization of Domain-Independent Classification Framework for Mood Classification
    Choi, Sung-Pil
    Jung, Yuchul
    Myaeng, Sung-Hyon
    JOURNAL OF INFORMATION PROCESSING SYSTEMS, 2007, 3 (02): : 73 - 81
  • [6] Domain-Independent Classification for Deep Web Interfaces
    Li, Yingjun
    Wang, Siwei
    Shen, Derong
    Nie, Tiezheng
    Yu, Ge
    WEB-AGE INFORMATION MANAGEMENT, PROCEEDINGS, 2010, 6184 : 453 - 458
  • [7] A tool for domain-independent model mutation
    Gomez-Abajo, Pablo
    Guerra, Esther
    de Lara, Juan
    Merayo, Mercedes G.
    SCIENCE OF COMPUTER PROGRAMMING, 2018, 163 : 85 - 92
  • [8] DFDS: A Domain-Independent Framework for Document-Level Sentiment Analysis Based on RST
    Zhao, Zhenyu
    Rao, Guozheng
    Feng, Zhiyong
    WEB AND BIG DATA, APWEB-WAIM 2017, PT I, 2017, 10366 : 297 - 310
  • [9] A New Approach for A Domain-Independent Turkish Sentiment Seed Lexicon Compilation
    Ekinci, Ekin
    Omurca, Sevinc
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2019, 16 (05) : 843 - 853
  • [10] A Domain-Independent Model for Identifying Security Requirements
    Munaiah, Nuthan
    Meneely, Andrew
    Murukannaiah, Pradeep K.
    2017 IEEE 25TH INTERNATIONAL REQUIREMENTS ENGINEERING CONFERENCE (RE), 2017, : 506 - 511