Abstract: An issue in text classification problems involves the choice of good samples on which to train the classifier. Training sets that properly represent the characteristics of each class have a better chance of establishing a successful predictor. Moreover, sometimes data are redundant or take large amounts of computing time for the learning process. To overcome this issue, data selection techniques have been proposed, including instance selection. Some data mining techniques are based on nearest neighbors, ordered removals, random sampling, particle swarms or evolutionary methods. The weaknesses of these methods usually involve a lack of accuracy, lack of robustness when the amount of data increases, over?tting and a high complexity. This work proposes a new immune-inspired suppressive mechanism that involves selection. As a result, data that are not relevant for a classifier’s ?nal model are eliminated from the training process. Experiments show the e?ectiveness of this method, and the results are compared to other techniques; these results show that the proposed method has the advantage of being accurate and robust for large data sets, with less complexity in the algorithm.

Maria Luiza C. Passini, Katiusca B. Estébanez, Grazziela P. Figueredo and Nelson F. F. Ebecken, “A Strategy for Training Set Selection in Text Classification Problems” International Journal of Advanced Computer Science and Applications(IJACSA), 4(6), 2013. http://dx.doi.org/10.14569/IJACSA.2013.040608

@article{Passini2013,
title = {A Strategy for Training Set Selection in Text Classification Problems},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2013.040608},
url = {http://dx.doi.org/10.14569/IJACSA.2013.040608},
year = {2013},
publisher = {The Science and Information Organization},
volume = {4},
number = {6},
author = {Maria Luiza C. Passini and Katiusca B. Estébanez and Grazziela P. Figueredo and Nelson F. F. Ebecken}
}