A comparison of text‐classification techniques applied to Arabic text
Journal of the American Society for Information Science and TechnologyPublished 6 July 2009
Ghassan Kanaan, Riyad Al–Shalabi, Sameh Ghwanmeh, Hamda Al‐Ma'adeed
Citations46
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A large number of algorithms have been implemented for the problem of text classification, but very little research has been carried out on Arabic text.
Abstract
Abstract Many algorithms have been implemented for the problem of text classification. Most of the work in this area was carried out for English text. Very little research has been carried out on Arabic text. The nature of Arabic text is different than that of English text, and preprocessing of Arabic text is more challenging. This paper presents an implementation of three automatic text‐classification techniques for Arabic text. A corpus of 1445 Arabic text documents belonging to nine categories has been automatically classified using the kNN, Rocchio, and naïve Bayes algorithms. The research results reveal that Naïve Bayes was the best performer, followed by kNN and Rocchio.
Keywords
Computer Science
Lecture notes in computer scienceText categorization with Support Vector Machines: Learning with many relevant features
7,925 Citations1998Thorsten Joachims
SVMs achieve substantial improvements over the currently best performing methods and behave robustly over a variety of di-erent learning tasks, eliminating the need for manual parameter tuning.
ACM Computing SurveysMachine learning in automated text categorization
7,899 Citations2002Fabrizio Sebastiani
This survey discusses the main approaches to text categorization that fall within the machine learning paradigm and discusses in detail issues pertaining to three different problems, namely, document representation, classifier construction, and classifier evaluation.
Journal of DocumentationA STATISTICAL INTERPRETATION OF TERM SPECIFICITY AND ITS APPLICATION IN RETRIEVAL
4,442 Citations1972Karen Spärck Jones
It is argued that terms should be weighted according to collection frequency, so that matches on less frequent, more specific, terms are of greater value than matches on frequent terms.
A comparison of event models for naive bayes text classification
3,224 Citations1998Andrew McCallum, Kamal Nigam
It is found that the multi-variate Bernoulli performs well with small vocabulary sizes, but that the multinomial performs usually performs even better at larger vocabulary sizes--providing on average a 27% reduction in error over the multi -variateBernoulli model at any vocabulary size.
A re-examination of text categorization methods
2,660 Citations1999Yiming Yang, Xin Liu
The results show that SVM, kNN and LLSF signi cantly outperform NNet and NB when the number of positive training instances per category are small, and that all the methods perform comparably when the categories are over 300 instances.
Lecture notes in computer scienceNaive (Bayes) at forty: The independence assumption in information retrieval
2,092 Citations1998David Lewis
The naive Bayes classifier, currently experiencing a renaissance in machine learning, has long been a core technique in information retrieval, and some of the variations used for text retrieval and classification are reviewed.
Information RetrievalAn Evaluation of Statistical Approaches to Text Categorization
1,946 Citations1999Yiming Yang
Analysis and empirical evidence suggest that the evaluation results on some versions of Reuters were significantly affected by the inclusion of a large portion of unlabelled documents, mading those results difficult to interpret and leading to considerable confusions in the literature.
A Sequential Algorithm for Training Text Classifiers
1,158 Citations1994David Lewis, William A. Gale
An algorithm for sequential sampling during machine learning of statistical classifiers was developed and tested on a newswire text categorization task and reduced by as much as 500-fold the amount of training data that would have to be manually classified to achieve a given level of effectiveness.
Journal of DocumentationON THE SPECIFICATION OF TERM VALUES IN AUTOMATIC INDEXING
577 Citations1973G. Salton, Chul‐Su Yang
It is shown that the standard theories for the specification of term values (or weights) are not adequate, and new techniques are introduced for the assignment of weights to index terms, based on the characteristics of individual document collections.
A comparison of classifiers and document representations for the routing problem
451 Citations1995Hinrich Schütze, David A. Hull +1 more
This paper considers three classification techniques which have decision rules that are derived via explicit error minimization linear discriminant analysis, logistic regression, and neuraf networks, and finds that features based on latent semantic indexing are more effective for techniques such aslinear discriminant anaf-ysis and logistic regressors, which have no way to protect against overfitting.
Improving stemming for Arabic information retrieval
360 Citations2002Leah S. Larkey, Lisa Ballesteros +1 more
Several light stemmers based on heuristics and a statistical stemmer based on co-occurrence for Arabic retrieval and the retrieval effectiveness of these stemmers and of a morphological analyzer on the TREC-2001 data were compared.
Boosting and Rocchio applied to text filtering
299 Citations1998Robert E. Schapire, Yoram Singer +1 more
This paper discusses two learning algorithms for text filtering: modified Rocchio and a boosting algorithm called AdaBoost, and shows how both algorithms can be adapted to maximize any general utility matrix that associates cost for each pair of machine prediction and correct label.
Context-sensitive learning methods for text categorization
253 Citations1996William W. Cohen, Yoram Singer
On the evaluation of document analysis components by recall, precision, and accuracy
181 Citations1999Markus Junker, Rainer Hoch +1 more
It is argued that the experimental evaluation on relative small test sets-as is very common in document analysis has to be taken with extreme care from a statistical point of view.
On arabic search
172 Citations2002Mohammed Aljlayl, Ophir Frieder
This work proposes a novel light-stemming algorithm for Arabic texts that significantly outperforms the root-based algorithm and shows that a significant improvement in retrieval precision can be achieved with light inflectional analysis of Arabic words.
Text Categorization based on Weighted Inverse Document Frequency
93 Citations1994Takenobu Tokunaga, Makoto Iwayama
WIDF is an extension of IDF (inverse document frequency) to incorporate the term frequency over the collection of texts and proved to be superior to the other methods.
Improving Text Retrieval for the Routing Problem using Latent Semantic Indexing
84 Citations1994David L. Hull
This paper applies LSI to the routing task, which operates under the assumption that a sample of relevant and non-relevant documents is available to use in constructing the query, and finds that when LSI is used is conjuction with statistical classification, there is a dramatic improvement in performance.
Lecture notes in computer scienceAn kNN Model-Based Approach and Its Application in Text Categorization
78 Citations2004Gongde Guo, Hui Wang +3 more
A new classifier called the kNN model-based classifier is proposed by unifying the strengths of k-NN and Rocchio classifier and adapting to characteristics of text categorization problems.
Weight Adjustment Schemes for a Centroid Based Classifier
42 Citations2000Shrikanth Shankar, George Karypis
Experiments show that feature weight adjustment improves the performance of the centroid-based classifier by 2- 5%, substantially outperforms Rocchio and Widrow-Hoff and is competitive with SVM.
A new feature selection score for multinomial naive Bayes text classification based on KL-divergence
39 Citations2004Karl-Michael Schneider
A new feature selection score for text classification based on the KL-divergence between the distribution of words in training documents and their classes is defined and experiments indicate that the new method outperforms mutual information, especially for smaller categories.
A probabilistic model for text categorization
38 Citations1994Makoto Iwayama, Takenobu Tokunaga
A new probabilistic model for text categorization, that is based on a Single random Variable with Multiple Values (SVMV) that has the following advantages; 1) it considers within-document term frequencies, 2) considers term weighting for target documents, and 3) is less affected by having insufficient training cases.
Text Categorization and Prototypes
9 Citations2001Alexander Bergo