Classification of Text Documents

Nowadays, the text information is available in electronic form which is easily accessible to people, due to whom it is increasing day by day, but the challenging issue is to organize the information. The existing algorithm such as naive Bayes classifier uses the maximum posterior estimation for building a classifier, but it is dependent on huge number of training samples for more accuracy and the other algorithm known as genetic algorithm that begins with an initial population which is constructed from randomly generated rules, but the accuracy of this algorithm depends on set of training examples. In this paper, we are using brute-force approach to classify the different categories of documents.

[1]  S. Manjunath,et al.  Classifying text documents using unconventional representation , 2014, 2014 International Conference on Big Data and Smart Computing (BIGCOMP).

[2]  Martin Sarnovsky,et al.  Distributed boosting algorithm for classification of text documents , 2014, 2014 IEEE 12th International Symposium on Applied Machine Intelligence and Informatics (SAMI).

[3]  L.N. de Castro,et al.  Text document classification using swarm intelligence , 2005, International Conference on Integration of Knowledge Intensive Multi-Agent Systems, 2005..

[4]  Tangina Sultana,et al.  Enhancing Performance of naïve bayes in text classification by introducing an extra weight using less number of training examples , 2016, 2016 International Workshop on Computational Intelligence (IWCI).

[5]  Tetiana Golub The analysis of text documents classifiers constructing methods , 2016, 2016 13th International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET).