Abstract
Most classification algorithms suffer from an inability to detect instances of classes which are not present in the training set. A novel approach for characteristic concept rule learning called IC 2 is proposed in this paper.
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
Holte, R.C., Acker, L.E., Porter, B.W.: Concept of Learning and the Problem of Small Disjoints. In: IJCAI, pp. 813–818 (1989)
Davidsson, P.: Integrating Models of Discrimination and Characterization for Learning from Examples in Open Domains. In: IJCAI, pp. 840–845 (1997)
Michalski, R.S., Larson, J.B.: Selection of Most Representative Training Examples and Incremental Generation of VL Hypotheses: The Underlying Methodology and the Description of Programs ESEL and AQ11, Tecnical Report 877, Computer Science Department, University of Illinois, Urbana (1978)
John, G., Kohavi, R., Pfleger, K.: Irrelevent Features and the Subset Selection Problem. In: Proc. Int. Conf. on Machine Learning (1994)
Mitchell, A.R.: “Boosting” a Positive-Data-Only Learner. In: ICML, pp. 607–714 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Singh, P.K. (2005). IC 2: An Interval Based Characteristic Concept Learner. In: Zhang, S., Jarvis, R. (eds) AI 2005: Advances in Artificial Intelligence. AI 2005. Lecture Notes in Computer Science(), vol 3809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11589990_118
Download citation
DOI: https://doi.org/10.1007/11589990_118
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30462-3
Online ISBN: 978-3-540-31652-7
eBook Packages: Computer ScienceComputer Science (R0)