Abstract
This paper makes use of knowledge granular to present a new method to mine rules based on granule. First, use the measure to measure the importance of attribute, and get the granularity of the universe, and then repeat this procedure to every granule of the granularity, until the decision attribute has only one value for all granules, then we will describe every granule to get the rule. The analysis of the algorithm and the experiment show that the method presented is effective and reliable. Classification rules are the main target of association rule, decision tree and rough sets. A new algorithm to mine classification rules based on the importance of attribute value supported. This algorithm views the importance as the number of tuple pair that can be discernible by it, and the rules obtained from the constructed decision tree is equivalent to those obtained from ID3, which can be proved by the idea of rule fusion. However, this method is of low computation, and is more suitable to large database. Rough sets is a techniques applied to data mining problems. This paper presents a new method to extract efficiently classification rules from decision table. The new model uses rough set theory to help in decreasing the calculation need for building decision tree by using what is called reduct algorithm and a rules set (knowledge) is generated from the decision table. The reliable classifier architecture is obtained and its effectiveness is verified by the experiments comparing with traditional rough set approaches. Data mining research has made much effort to apply various mining algorithms efficiently on large databases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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: Peter, B. (ed.) Proceeding of 1993 ACM-SIGMOD International Conference Management of Data (SIGMOD 1993), pp. 207–216. ACM Press, Washington, DC (1993)
Quinlan, J.R.: Induction of decision trees. Machine Learning, 81–106 (1986)
Grabmeier, J., Rudolph, A.: Techniques of cluster algorithms in data mining. Data Mining and Knowledge Discovery, 303–360 (2002)
Pawlak, Z.: Rough Sets. Int. J. Comput. Inform. Sci., 341–356 (1982)
Pawlak, Z.: Rough sets-—Theoretical Aspects of reasoning about data. Kluwer Academic Publishers, Boston (1991)
Quinlan, J.R.: Simplifying decision trees. International Journal of Man-Machine Studies, 221–234 (1987)
Quinlan, J.R.: Induction of decision trees. Machine Learning, 81–106 (1986)
Yao, Y.Y., Wong, S.K.M., Butz, C.J.: On Information-Theoretic Measures of Attribute Importance. In: Zhong, N., Zhou, L. (eds.) PAKDD 1999. LNCS (LNAI), vol. 1574, pp. 133–137. Springer, Heidelberg (1999)
Taskar, B., Abbeel, P., Koller, D.: Discriminative probabilistic models for relational data. In: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, pp. 485–492 (2002)
Getoor, L., Taskar, B.: Introduction to Statistical Relational Learning. MIT Press (2007)
Sen, P., Namata, G.M., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. AI Magazine 29(3), 93–106 (2008)
Pawlak, Z.: Some issues on rough sets. Trans Rough Sets 1, 1–58 (2004)
Avci, E.: Performance comparison of wavelet families for analog modulation classification using expert discrete wavelet neural network system. Expert Syst. Appl. 33, 23–35 (2007)
Pawlak, Z., Skowron, A.: Rough sets: some extensions. Inf. Sci. 177(1), 28–40 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dun, Y., Shao, Y., Cai, Z. (2012). A Method Based on Granule to Mine Classification Rules. In: Lei, J., Wang, F.L., Deng, H., Miao, D. (eds) Emerging Research in Artificial Intelligence and Computational Intelligence. AICI 2012. Communications in Computer and Information Science, vol 315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34240-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-34240-0_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34239-4
Online ISBN: 978-3-642-34240-0
eBook Packages: Computer ScienceComputer Science (R0)