HCovBi-Caps: Hate Speech Detection Using Convolutional and Bi-Directional Gated Recurrent Unit With Capsule Network
Shakir Khan, Ashraf Kamal, Mohd Fazil and 5 more
IEEE Access · 2022
doi:10.1109/access.2022.3143799 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Adversaries and anti-social elements have exploited the rapid proliferation of computing technology and online social media in the form of novel security threats, such as fake profiles, hate speech, social bots, and rumors. The hate speech problem on online social networks (OSNs) is also widespread. The existing literature has machine learning approaches for hate speech detection on OSNs. However, the effectiveness of contextual information at different orientations is understudied. This study presents a novel <italic>Convolutional</italic>, <italic>BiGRU</italic>, and <italic>Capsule</italic> network-based deep learning model, HCovBi-Caps, to classify the hate speech. The proposed model is evaluated over two Twitter-based benchmark datasets – DS1(balanced) and DS2(unbalanced) with the best performance of 0.90, 0.80, and 0.84 respectively considering <italic>precision</italic>, <italic>recall</italic>, and <italic>f-score</italic> over unbalanced dataset. In terms of training and validation accuracy, the proposed model shows the best performance of 0.93 and 0.90, respectively, over the unbalanced dataset. In comparative evaluation, HCovBi-Caps demonstrates a significantly better performance than state-of-the-art approaches. In addition, HCovBi-Caps shows comparatively better performance over the unbalanced dataset. We also investigate the impact of different hyperparameters on the efficacy of HCovBi-Caps to ascertain the selection of their values. We observed that a higher value of <italic>routing iterations</italic> adversely affects the model performance, whereas a higher value of <italic>capsule dimension</italic> improves the performance.
Abstract licence: CC BY-NC-ND
References45
40 more references, whose wording the paper’s licence keeps private.
All 45 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.