Abstract
This paper reports on an investigation to compare a number of strategies to include negated features within the process of Inductive Rule Learning (IRL). The emphasis is on generating the negation of features while rules are being “learnt”; rather than including (or deriving) the negation of all features as part of the input. Eight different strategies are considered based on the manipulation of three feature sub-spaces. Comparisons are also made with Associative Rule Learning (ARL) in the context of multi-class text classification. The results indicate that the option to include negated features within the IRL process produces more effective classifiers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)
Antonie, M.-L., Zaïane, O.R.: An associative classifier based on positive and negative rules. In: Proceedings of the 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 64–69 (2004)
Apté, C., Damerau, F.J., Weiss, S.M.: Automated learning of decision rules for text categorization. ACM Transactions on Information Systems 12, 233–251 (1994)
Baralis, E., Garza, P.: Associative text categorization exploiting negated words. In: Proceedings of the ACM Symposium on Applied Computing, pp. 530–535 (2006)
Coenen, F., Leng, P.: The Effect of Threshold Values on Association Rule Based Classification Accuracy. Journal of Data and Knowledge Engineering 60(2), 345–360 (2007)
Cohen, W.: Fast effective rule induction. In: Proceedings of the 12th International Conference on Machine Learning (ICML), pp. 115–123. Morgan Kaufmann, San Francisco (1995)
Fürnkranz, J., Widmer, G.: Incremental reduced error pruning. In: Proceedings of the 11th International Conference on Machine Learning (ICML). Morgan Kaufmann, San Francisco (1994)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2006)
Joachims, T.: Text categorization with support vector machines: Learning with many relevant features. In: Nédellec, C., Rouveirol, C. (eds.) ECML 1998. LNCS, vol. 1398, pp. 137–142. Springer, Heidelberg (1998)
Lang, K.: Newsweeder: Learning to filter netnews. In: Proceedings of the 12th International Conference on Machine Learning, pp. 331–339 (1995)
Lewis, D.D.: Reuters-21578 text categorization test collection, Distribution 1.0, README file, v 1.3 (2004), http://www.daviddlewis.com/resources/testcollections/reuters21578/readme.txt
Li, W., Han, J., Pei, J.: CMAR: Accurate and efficient Classification based on Multiple class-Association Rules. In: Proceedings of the IEEE International Conference on Data Mining, pp. 369–376 (2001)
Quinlan, J.R., Cameron-Jones, R.M.: FOIL: A midterm report. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol. 667, pp. 3–20. Springer, Heidelberg (1993)
Rullo, P., Cumbo, C., Policicchio, V.L.: Learning rules with negation for text categorization. In: Proceedings of the 22nd ACM Symposium on Applied Computing, pp. 409–416. ACM, New York (2007)
Wang, Y.J.: Language-independent pre-processing of large documentbases for text classifcation. PhD thesis (2007)
Weiss, S.M., Indurkhya, N.: Optimized rule induction. IEEE Expert: Intelligent Systems and Their Applications 8, 61–69 (1993)
Yin, X., Han, J.: CPAR: Classification based on Predictive Association Rules. In: Proceedings of the SIAM International Conference on Data Mining, pp. 331–335 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chua, S., Coenen, F., Malcolm, G. (2010). Classification Inductive Rule Learning with Negated Features. In: Cao, L., Feng, Y., Zhong, J. (eds) Advanced Data Mining and Applications. ADMA 2010. Lecture Notes in Computer Science(), vol 6440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17316-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-17316-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17315-8
Online ISBN: 978-3-642-17316-5
eBook Packages: Computer ScienceComputer Science (R0)