Abstract
Association rule algorithms often generate an excessive number of rules, many of which are not significant. It is difficult to determine which rules are more useful, interesting and important. We introduce a rough set based process by which a rule importance measure is calculated for association rules to select the most appropriate rules. We use ROSETTA software to generate multiple reducts. Apriori association rule algorithm is then applied to generate rule sets for each data set based on each reduct. Some rules are generated more frequently than the others among the total rule sets. We consider such rules as more important. We define rule importance as the frequency of an association rule among the rule sets. Rule importance is different from rule interestingness in that it does not consider the predefined knowledge on what kind of information is considered to be interesting. The experimental results show our method reduces the number of rules generated and at the same time provides a measure of how important is a rule.
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
Pawlak, Z.: Rough Sets. In: Theoretical Aspects of Reasoning about Data. Kluwer, Netherlands (1991)
Pawlak, Z., Grzymala-Busse, J., Slowinski, R., Ziarko, W.: Rough Sets. Communications of the ACMÂ 38(11) (November 1995)
Klemettinen, M., Mannila, H., Ronkainen, R., Toivonen, H., Verkamo, A.I.: Finding interesting rules from large sets of discovered association rules. In: CIKM 1994, pp. 401–407 (1994)
Li, J., Tang, B., Cercone, N.: Applying Association Rules for Interesting Recommendations Using Rule Templates. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 166–170. Springer, Heidelberg (2004)
Lin, W., Alvarez, S., Ruiz, C.: Efficient adaptive-support association rule mining for recommender systems. Data Mining and Knowledge Discovery 6, 83–105 (2002)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of 20th International Conference Very Large Data Bases, Santiago de Chile, Chile, pp. 487–499. Morgan Kaufmann, San Francisco (1994)
Kryszkiewicz, M., Rybinski, H.: Finding Reducts in Composed Information Systems, Rough Sets, Fuzzy Sets Knowldege Discovery. In: Ziarko, W.P. (ed.) Proceedings of the International Workshop on Rough Sets, Knowledge Discovery, pp. 261–273. Springer, Heidelberg (1994)
Bazan, J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wroblewski, J.: Rough set algorithms in classification problems. In: Polkowski, L., Lin, T.Y., Tsumoto, S. (eds.) Rough Set Methods and Applications: New Developments in Knowledge Discovery in Information Systems, Studies in Fuzziness and Soft Computing, vol. 56, pp. 49–88. Physica, Heidelberg (2000)
Hu, X., Lin, T., Han, J.: A New Rough Sets Model Based on Database Systems. Fundamenta Informaticae 59(2-3), 135–152 (2004)
Huang, Z., Hu, Y.Q.: Applying AI Technology and Rough Set Theory to Mine Association Rules for Supporting Knowledge Management. In: Proc. of the 2nd Int’l Conference on Machine Learning and Cybernetics, Xi’an (November 2003)
Hassanien, A.E.: Rough Set Approach for Attribute Reduction and Rule Generation: A Case of Patients with Suspected Breast Cancer. Journal of The American Society for Information Science and Technology 55(11), 954–962 (2004)
Aleksander Ohrn: Discernibility and Rough Sets in Medicine: Tools and Applications. PhD Thesis, Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway, NTNU report 1999:133, IDI report 1999:14, ISBN 82-7984-014-1, 239 pages (1999)
Borgelt, C.: Efficient Implementations of Apriori and Eclat. In: Proceedings of the FIMI 2003 Workshop on Frequent Itemset Mining Implementations. CEUR Workshop Proceedings, pp. 1613–73 (2003)
Hu, X.: Knowledge Discovery in Databases: an Attribute-Oriented Rough Set Approach. PhD Thesis, University of Regina (1995)
Li, J., Cercone, N.: Empirical Analysis on the Geriatric Care Data Set Using Rough Sets Theory. Technical Report, CS-2005-05, School of Computer Science, University of Waterloo (2005)
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
Li, J., Cercone, N. (2005). A Rough Set Based Model to Rank the Importance of Association Rules. In: Ślęzak, D., Yao, J., Peters, J.F., Ziarko, W., Hu, X. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548706_12
Download citation
DOI: https://doi.org/10.1007/11548706_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28660-8
Online ISBN: 978-3-540-31824-8
eBook Packages: Computer ScienceComputer Science (R0)