Application of Support Vector Machine for Arabic Sentiment Classification Using Twitter-Based Dataset

Sentiment classification is the process of classifying emotions and opinions in texts. In this study, the problem of Arabic sentiment analysis was addressed. A support vector machine (SVM) model was proposed to classify opinions in Arabic micro-texts as being positive or negative. To evaluate the performance of the SVM model, a dataset was built from tweets discussing several social issues in Saudi Arabia. These issues include changes that were implemented by the country as part of a newly established vision, known as Saudi Arabia Vision 2030. The constructed dataset was manually annotated according to the sentiment conveyed in the text. To achieve the best sentiment classification accuracy, several procedures were implemented within the proposed framework including light stemming, feature extraction (Ngrams, emoji and tweet-topic features), parameter optimisation and feature-set reduction. The experimental results revealed excellent outcomes. An accuracy of 89.83% was achieved using the proposed SVM model.

Twitter Users' Classification Based on Interest

Microblogging platforms, such as Twitter, have become a popular interaction media that are used widely for different daily purposes, such as communication and knowledge sharing. Understanding the behaviors and interests of these platforms' users become a challenge that can help in different areas such as recommendation and filtering. In this article, an approach is proposed for classifying Twitter users with respect to their interests based on their Arabic tweets. A Multinomial Naïve Bayes machine learning algorithm is used for such classification. The proposed approach has been developed as a web-based software system that is integrated with Twitter using Twitter API. An experimental study on Arabic tweets has been investigated on the proposed system as a case study.

The impact of indexing approaches on Arabic text classification

This paper investigates the impact of using different indexing approaches (full-word, stem, and root) when classifying Arabic text. In this study, the naïve Bayes classifier is used to construct the multinomial classification models and is evaluated using stratified k-fold cross-validation ( k ranges from 2 to 10). It is also uses a corpus that consists of 1000 normalized Arabic documents. The results of one experiment in this study show that significant accuracy improvements have occurred when the full-word form is used in most k-folds. Further experiments show that the classifier has achieved the highest accuracy in the eight-fold by using 7/8–1/8 train–test ratio, despite the indexing approach being used. The overall results of this study show that the classifier has achieved the maximum micro-average accuracy 99.36%, either by using the full-word form or the stem form. This proves that the stem is a better choice to use when classifying Arabic text, because it makes the corpus dataset smaller and this will enhance both the processing time and storage utilization, and achieve the highest level of accuracy.

Latent Topic Model for Indexing Arabic Documents

In this paper, the authors present latent topic model to index and represent the Arabic text documents reflecting more semantics. Text representation in a language with high inflectional morphology such as Arabic is not a trivial task and requires some special treatments. The authors describe their approach for analyzing and preprocessing Arabic text then they describe the stemming process. Finally, the latent model (LDA) is adapted to extract Arabic latent topics, the authors extracted significant topics of all texts, each theme is described by a particular distribution of descriptors then each text is represented on the vectors of these topics. The experiment of classification is conducted on in house corpus; latent topics are learned with LDA for different topic numbers K (25, 50, 75, and 100) then they compare this result with classification in the full words space. The results show that performances, in terms of precision, recall and f-measure, of classification in the reduced topics space outperform classification in full words space and when using LSI reduction.

Latent Topic Model for Indexing Arabic Documents

In this paper, the authors present latent topic model to index and represent the Arabic text documents reflecting more semantics. Text representation in a language with high inflectional morphology such as Arabic is not a trivial task and requires some special treatments. The authors describe our approach for analyzing and preprocessing Arabic text then we describe the stemming process. Finally, the latent model (LDA) is adapted to extract Arabic latent topics, the authors extracted significant topics of all texts, each theme is described by a particular distribution of descriptors then each text is represented on the vectors of these topics. The experiment of classification is conducted on in house corpus; latent topics are learned with LDA for different topic numbers K (25, 50, 75, and 100) then the authors compare this result with classification in the full words space. The results show that performances, in terms of precision, recall and f-measure, of classification in the reduced topics space outperform classification in full words space and when using LSI reduction.

Effects of Terms Recognition Mistakes on Requests Processing for Interactive Information Retrieval

In this work the author proposes to describe a new model of information retrieval. They studied the effects of using weighted index terms recognition mistakes in a document indexing system and evaluate indexing performance when short and long requests are used. The effect of weighting index terms in the document collection and in the requests is analyzed. Given the typical requests submitted to term indexing system, it seems easy to consider that the effects of term recognition mistakes in user requests must be severely destructive on the effectiveness of the system. The experimental study reported in this paper shows that the use of classical term Indexing technique for processing this kind of request is robust to considerably high levels of term recognition mistakes, in particular for long requests. Moreover, both standard pertinence feedback and pseudo pertinence feedback can be employed to improve the effectiveness of user request processing.