An investigation into the deep learning approach in sentimental analysis using graph-based theories

被引:2
|
作者
Kentour, Mohamed [1 ]
Lu, Joan [1 ]
机构
[1] Univ Huddersfield, Sch Comp & Engn, Huddersfield, W Yorkshire, England
来源
PLOS ONE | 2021年 / 16卷 / 12期
关键词
NEURAL-NETWORKS; BACKPROPAGATION;
D O I
10.1371/journal.pone.0260761
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Sentiment analysis is a branch of natural language analytics that aims to correlate what is expressed which comes normally within unstructured format with what is believed and learnt. Several attempts have tried to address this gap (i.e., Naive Bayes, RNN, LSTM, word embedding, etc.), even though the deep learning models achieved high performance, their generative process remains a "black-box" and not fully disclosed due to the high dimensional feature and the non-deterministic weights assignment. Meanwhile, graphs are becoming more popular when modeling complex systems while being traceable and understood. Here, we reveal that a good trade-off transparency and efficiency could be achieved with a Deep Neural Network by exploring the Credit Assignment Paths theory. To this end, we propose a novel algorithm which alleviates the features' extraction mechanism and attributes an importance level of selected neurons by applying a deterministic edge/node embeddings with attention scores on the input unit and backward path respectively. We experiment on the Twitter Health News dataset were the model has been extended to approach different approximations (tweet/aspect and tweets' source levels, frequency, polarity/subjectivity), it was also transparent and traceable. Moreover, results of comparing with four recent models on same data corpus for tweets analysis showed a rapid convergence with an overall accuracy of approximate to 83% and 94% of correctly identified true positive sentiments. Therefore, weights can be ideally assigned to specific active features by following the proposed method. As opposite to other compared works, the inferred features are conditioned through the users' preferences (i.e., frequency degree) and via the activation's derivatives (i.e., reject feature if not scored). Future direction will address the inductive aspect of graph embeddings to include dynamic graph structures and expand the model resiliency by considering other datasets like SemEval task7, covid-19 tweets, etc.
引用
收藏
页数:43
相关论文
共 50 条
  • [41] Graph weeds net: A graph-based deep learning method for weed recognition
    Hu, Kun
    Coleman, Guy
    Zeng, Shan
    Wang, Zhiyong
    Walsh, Michael
    COMPUTERS AND ELECTRONICS IN AGRICULTURE, 2020, 174
  • [42] Graph-based Cluttered Scene Generation and Interactive Exploration using Deep Reinforcement Learning
    Kumar, K. Niranjan
    Essa, Irfan
    Ha, Sehoon
    2022 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, ICRA 2022, 2022, : 7521 - 7527
  • [43] Graph-based Fuzz Testing for Deep Learning Inference Engines
    Luo, Weisi
    Chai, Dong
    Run, Xiaoyue
    Wang, Jiang
    Fang, Chunrong
    Chen, Zhenyu
    2021 IEEE/ACM 43RD INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE 2021), 2021, : 288 - 299
  • [44] Asymmetric Graph-Based Deep Reinforcement Learning for Portfolio Optimization
    Sun, Haoyu
    Liu, Xin
    Bian, Yuxuan
    Zhu, Peng
    Cheng, Dawei
    Liang, Yuqi
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES-APPLIED DATA SCIENCE TRACK, PT IX, ECML PKDD 2024, 2024, 14949 : 174 - 189
  • [45] kGCN: a graph-based deep learning framework for chemical structures
    Kojima, Ryosuke
    Ishida, Shoichi
    Ohta, Masateru
    Iwata, Hiroaki
    Honma, Teruki
    Okuno, Yasushi
    JOURNAL OF CHEMINFORMATICS, 2020, 12 (01)
  • [46] kGCN: a graph-based deep learning framework for chemical structures
    Ryosuke Kojima
    Shoichi Ishida
    Masateru Ohta
    Hiroaki Iwata
    Teruki Honma
    Yasushi Okuno
    Journal of Cheminformatics, 12
  • [47] NO-REFERENCE MESH VISUAL QUALITY ASSESSMENT USING GRAPH-BASED DEEP LEARNING
    Abouelaziz, Ilyass
    Chetouani, Aladine
    El Hassouni, Mohammed
    Cherifi, Hocine
    IEEE MMSP 2021: 2021 IEEE 23RD INTERNATIONAL WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING (MMSP), 2021,
  • [48] Detailed Routing Short Violation Prediction Using Graph-Based Deep Learning Model
    Chen, Xuan
    Di, Zhixiong
    Wu, Wei
    Wu, Qiang
    Shi, Jiangyi
    Feng, Quanyuan
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2022, 69 (02) : 564 - 568
  • [49] Detailed Routing Short Violation Prediction Using Graph-Based Deep Learning Model
    School of Information Science and Technology, Southwest Jiaotong University, Chengdu
    611756, China
    不详
    710071, China
    不详
    710071, China
    IEEE Trans. Circuits Syst. Express Briefs, 1600, 2 (564-568): : 564 - 568
  • [50] Graph-Based Representation Approach for Deep Learning of Organic Light-Emitting Diode Devices
    Lee, Taeyang
    Choi, Jeongwhan
    Na, Inyeob
    Yoo, Insun
    Woo, Sungil
    Kim, Kwang Jong
    Park, Mikyung
    Yang, Joonghwan
    Min, Jeongguk
    Lee, Seokwoo
    Park, Noseong
    Yang, Joonyoung
    ADVANCED INTELLIGENT SYSTEMS, 2024,