Abstract
A granular computing model is used for learning classification rules by considering the two basic issues: concept formation and concept relationships identification. A classification rule induction method is proposed. Instead of focusing on the selection of a suitable partition, i.e., a family of granules defined by values of an attribute, in each step, we concentrate on the selection of a single granule. This leads to finding a covering of the universe, which is more general than partition based methods. For the design of granule selection heuristics, several measures on granules are suggested.
This is a preview of subscription content, log in via an institution to check access.
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
Bramer, M.A., “Automatic induction of classification rules from examples using N-PRISM”, Research and Development in Intelligent Systems XVI, Springer-Verlag, pp. 99–121, 2000.
Cendrowska, J., “PRISM: an algorithm for inducing modular rules” International Journal of Man-Machine Studies, 27, 349–370, 1987.
Demri, S. and Orlowska, E., “Logical analysis of indiscernibility”, in: Incomplete Information: Rough Set Analysis, Orlowska, E. (Ed.), Physica-Verlag, Heidelberg, pp. 347–380, 1998.
Ganascia, J.-G., “TDIS: an algebraic formalization”, Proceedings of IJCAI 1993, pp. 1008–1015, 1993.
Pawlak, Z. Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Dordrecht, 1991.
Quinlan, J.R. “Learning efficient classification procedures and their application to chess end-games”, in: Machine Learning: An Artificial Intelligence Approach, Vol. 1, Michalski, J.S. et al. (Eds.), Morgan Kaufmann, pp. 463–482, 1983.
Tsumoto, S., “Modelling medical diagnostic rules based on rough sets”, Rough Sets and Current Trends in Computing, Lecture Notes in Artificial Intelligence, 1424, Springer-Verlag, Berlin, pp. 475–482, 1998.
Wille, R., “Concept lattices and conceptual knowledge systems”, Computers Mathematics with Applications, 23, 493–515, 1992.
Yao, Y.Y, “On Modeling data mining with granular computing”, Proceedings of COMPSAC 2001, pp. 638–643, 2001.
Yao, Y.Y. and Zhong, N. An analysis of quantitative measures associated with rules, Proceedings of PAKDD’99, pp. 479–488, 1999.
Yao, Y.Y. and Yao, J. T., “Granular computing as a basis for consistent classification problems”, Proceedings of PAKDD’ 02 Workshop on Toward the Foundation of Data Mining, pp. 101–106, 2002.
Zadeh, L.A., “Towards a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic”, Fuzzy Sets and Systems, 19, 111–127, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yao, J.T., Yao, Y.Y. (2002). Induction of Classification Rules by Granular Computing. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds) Rough Sets and Current Trends in Computing. RSCTC 2002. Lecture Notes in Computer Science(), vol 2475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45813-1_43
Download citation
DOI: https://doi.org/10.1007/3-540-45813-1_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44274-5
Online ISBN: 978-3-540-45813-5
eBook Packages: Springer Book Archive