An efficient approach for textual data classification using deep learning

<p dir="ltr">Text categorization is an effective activity that can be accomplished using a variety of classification algorithms. In machine learning, the classifier is built by learning the features of categories from a set of preset training data. Similarly, deep learning offers eno...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Abdullah Alqahtani (7128143) (author)
مؤلفون آخرون: Habib Ullah Khan (15862361) (author), Shtwai Alsubai (17019126) (author), Mohemmed Sha (15862368) (author), Ahmad Almadhor (17019129) (author), Tayyab Iqbal (17019132) (author), Sidra Abbas (8699295) (author)
منشور في: 2022
الموضوعات:
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
الوصف
الملخص:<p dir="ltr">Text categorization is an effective activity that can be accomplished using a variety of classification algorithms. In machine learning, the classifier is built by learning the features of categories from a set of preset training data. Similarly, deep learning offers enormous benefits for text classification since they execute highly accurately with lower-level engineering and processing. This paper employs machine and deep learning techniques to classify textual data. Textual data contains much useless information that must be pre-processed. We clean the data, impute missing values, and eliminate the repeated columns. Next, we employ machine learning algorithms: logistic regression, random forest, K-nearest neighbors (KNN), and deep learning algorithms: long short-term memory (LSTM), artificial neural network (ANN), and gated recurrent unit (GRU) for classification. Results reveal that LSTM achieves 92% accuracy outperforming all other model and baseline studies.</p><h2>Other Information</h2><p dir="ltr">Published in: Frontiers in Computational Neuroscience<br>License: <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank">https://creativecommons.org/licenses/by/4.0/</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.3389/fncom.2022.992296" target="_blank">https://dx.doi.org/10.3389/fncom.2022.992296</a></p>