A parallel ACO algorithm to select terms to categorise longer documents. (2nd December 2011)

• Record Type: Journal Article
• Authors: Janaki Meena, M.; Chandran, K.R.; Karthik, A.; Vijay Samuel, A.
• Is Part Of: International journal of computational science and engineering. Volume 6:Number 4(2011)
• Page Start: 238
• Page End: 248
• Publication Date: 2011-12-02
• Subjects: bag of words -- meta-heuristic algorithms -- ant colony optimisation -- ACO -- CHIR -- parallel algorithm -- MapReduce -- longer reduce; Computer science -- Mathematics -- Periodicals; Computer simulation -- Mathematical aspects -- Periodicals; Computational intelligence -- Periodicals; 004.015105
• Languages: English
• ISSNs: 1742-7185

Abstract

Text categorisation (TC) is the task of assigning predefined categories to text. Most of the machine learning algorithms are sensitive to the features fed into it. Feature selection (FS) is an important preprocessing step to remove redundant and irrelevant terms from the training corpus. This paper proposes an ant colony optimisation (ACO) algorithm to select features for categorising longer documents to closely related categories. Heuristic value for each word is computed by the statistical dependency of the term to a category and its compactness value. Experiments were conducted with documents from 20newsgroup and Reuters-21578 benchmarks. The selected features were fed into the Naïve Bayes classifier. It was observed that the performance of the classifier improves with the features selected by the proposed method. The processes involved in algorithm are time intensive and demand parallelism. Hence, the ACO algorithm was parallelised using the MapReduce programming model of Hadoop.