z-logo
open-access-imgOpen Access
Decision tree algorithm for multi-label hate speech and abusive language detection in Indonesian Twitter
Author(s) -
Fauzi Ihsan,
Surya Agustian
Publication year - 2021
Publication title -
jurnal teknologi dan sistem komputer
Language(s) - English
Resource type - Journals
eISSN - 2620-4002
pISSN - 2338-0403
DOI - 10.14710/jtsiskom.2021.13907
Subject(s) - lexicon , computer science , decision tree , feature (linguistics) , hatred , social media , part of speech , natural language processing , speech recognition , voice activity detection , indonesian , artificial intelligence , speech processing , linguistics , world wide web , philosophy , politics , political science , law
Hate speech and abusive language are easily found in written communications in social media like Twitter. They often cause a dispute between parties, the victims, and the first who write the tweet. However, it is also difficult to distinguish whether a tweet contains hate speech and/or abusive language for those who take sides. This research aims to develop a method to classify the tweets into abusive and/or contain hate speech classes. If hate speech is detected, then the system will measure the hardness level of hatred. The dataset includes 13,126 real tweets data. Word embeddings are used for featuring text input. For the tweets classification, we use a Decision Tree algorithm. Some engineering of features and parameters tuning has improved the classification of the three classes: hate speech class, abusive words, and hate speech level. The lexicon feature in the Decision Tree classification produces the highest accuracy for detecting the three classes rather than engineering special features and textual features. The average accuracy of the three classes increased from 69.77 % to 70.48 % for the training-testing composition of 90:10, and another 69.35 % to 69.54 % for 80:20 respectively.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here