Abstract
An investigation of rule learning processes that allow the inclusion of negated features is described. The objective is to establish whether the use of negation in inductive rule learning systems is effective with respect to classification. This paper seeks to answer this question by considering two issues relevant to such systems; feature identification and rule refinement. Both synthetic and real datasets are used to illustrate solutions to the identified issues and to demonstrate that the use of negative features in inductive rule learning systems is indeed beneficial.
Chapter PDF
Similar content being viewed by others
References
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)
Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases. University of California, Department of Information and Computer Science, Irvine (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Brunk, C., Pazzani, M.: Noise-tolerant relational concept learning algorithms. In: Proceedings of the 8th International Workshop on Machine Learning. Morgan Kaufmann, New York (1991)
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)
Debole, F., Sebastiani, F.: Supervised term weighting for automated text categorization. In: Proceedings of the 18th ACM Symposium on Applied Computing, pp. 784–788 (2003)
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)
Galavotti, L., Sebastiani, F., Simi, M.: Experiments on the use of feature selection and negative evidence in automated text categorization. In: Proceedings of the 4th European Conference on Research and Advanced Technology for Digital Libraries, pp. 59–68 (2000)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2006)
Rullo, P., Cumbo, C., Policicchio, V.L.: Learning rules with negation for text categorization. In: Proceedings of the 2007 ACM Symposium on Applied Computing, pp. 409–416. ACM, New York (2007)
Weiss, S.M., Indurkhya, N.: Optimized rule induction. IEEE Expert: Intelligent Systems and Their Applications 8(6), 61–69 (1993)
Wu, Z., Zhang, C., Zhang, S.: Mining both positive and negative association rules. In: Proceedings of the 19th International Conference on Machine Learning, pp. 658–665 (2002)
Yang, Y., Pedersen, J.: A comparative study on feature selection in text categorization. In: Proceedings of the 14th International Conference on Machine Learning (ICML), pp. 413–420 (1997)
Zheng, Z., Srihari, R.: Optimally combining positive and negative features for text categorization. In: Proceedings of the International Conference on Machine Learning (ICML), Workshop on Learning from Imbalanced Datasets II (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chua, S., Coenen, F., Malcolm, G. (2010). Rule Learning with Negation: Issues Regarding Effectiveness. In: Shi, Z., Vadera, S., Aamodt, A., Leake, D. (eds) Intelligent Information Processing V. IIP 2010. IFIP Advances in Information and Communication Technology, vol 340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16327-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-16327-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16326-5
Online ISBN: 978-3-642-16327-2
eBook Packages: Computer ScienceComputer Science (R0)