Yoon, Y.; Lee, G.G.: Efficient implementation of associative classifiers for document classification (2007)
0.01
0.01161172 = product of:
0.081282035 = sum of:
0.081282035 = weight(_text_:interpretation in 909) [ClassicSimilarity], result of:
0.081282035 = score(doc=909,freq=2.0), product of:
0.21405315 = queryWeight, product of:
5.7281795 = idf(docFreq=390, maxDocs=44218)
0.037368443 = queryNorm
0.37972826 = fieldWeight in 909, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.7281795 = idf(docFreq=390, maxDocs=44218)
0.046875 = fieldNorm(doc=909)
0.14285715 = coord(1/7)
- Abstract
- In practical text classification tasks, the ability to interpret the classification result is as important as the ability to classify exactly. Associative classifiers have many favorable characteristics such as rapid training, good classification accuracy, and excellent interpretation. However, associative classifiers also have some obstacles to overcome when they are applied in the area of text classification. The target text collection generally has a very high dimension, thus the training process might take a very long time. We propose a feature selection based on the mutual information between the word and class variables to reduce the space dimension of the associative classifiers. In addition, the training process of the associative classifier produces a huge amount of classification rules, which makes the prediction with a new document ineffective. We resolve this by introducing a new efficient method for storing and pruning classification rules. This method can also be used when predicting a test document. Experimental results using the 20-newsgroups dataset show many benefits of the associative classification in both training and predicting when applied to a real world problem.
