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 Rule Importance Measure to select the most important 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 generated across all the rule sets. Rule importance is different from either rule interestingness measures or rule quality measures because of their application tasks, the processes where the measures are applied and the contents they measure. The experimental results from an artificial data set, UCI machine learning datasets and an actual geriatric care medical data set show that our method reduces the computational cost for rule generation and provides an effective measure of how important is a rule.
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
Pawlak, Z.: Rough Sets. In: Theoretical Aspects of Reasoning about Data. Kluwer, Netherlands (1991)
Pawlak, Z., Grzymala-Busse, J., Slowinshi, 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: Proceedings of the Third International Conference on Information and Knowledge Management (CIKM), pp. 401–407 (1994)
Li, J., Tang, B., Cercone, N.J.: Applying Association Rules for Interesting Recommendations Using Rule Templates. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS, 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)
Øhrn, A.: 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)
Li, J., Cercone, N.J.: A rough set based model to rank the importance of association rules. In: Ślęzak, D., Yao, J., Peters, J.F., Ziarko, W.P., Hu, X. (eds.) RSFDGrC 2005. LNCS, vol. 3642, pp. 109–118. Springer, Heidelberg (2005)
Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases. University of California, Irvine, Department of Information and Computer Sciences (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
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., Wróblewski, 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-Verlag, Heidelberg (2000)
Øhrn, A.: ROSETTA Technical Reference Manual. Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway, May 25 (2001)
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: Proceedings of the 2nd International Conference on Machine Learning and Cybernetics, Xi’an, China (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)
Bazan, J.G., Szczuka, M.S., Wróblewski, J.: A new version of rough set exploration system. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS, vol. 2475, pp. 397–404. Springer, Heidelberg (2002)
Vinterbo, S., Øhrn, A.: Minimal Approximate Hitting Sets and Rule Templates. International Journal of Approximate Reasoning 25(2), 123–143 (2000)
Hilderman, R., Hamilton, H.: Knowledge discovery and interestingness measures: A survey. Technical Report 99-04, Department of Computer Science, University of Regina (October 1999)
Bruha, I.: Quality of Decision Rules: Definitions and Classification Schemes for Multiple Rules. In: Nakh aeizadeh, G., Taylor, C.C. (eds.) Machine Learning and Statistics, The Interface, pp. 107–131. John Wiley & Sons, Inc., Chichester (1997)
An, A., Cercone, N.: ELEM2: A Learning System for More Accurate Classifications. In: Proceedings of Canadian Conference on AI, pp. 426–441 (1998)
An, A., Cercone, N.: Rule Quality Measures for Rule Induction Systems: Description and Evaluation. Computational Intelligence 17(3), 409–424 (2001)
Borgelt, C.: Efficient Implementations of Apriori and Eclat. In: Proceedings of the FIMI 2003 Workshop on Frequent Itemset Mining Implementations. CEUR Workshop Proceedings (2003) 1613–0073, http://CEUR-WS.org/Vol-90/borgelt.pdf
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
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, J., Cercone, N. (2006). Introducing a Rule Importance Measure. In: Peters, J.F., Skowron, A. (eds) Transactions on Rough Sets V. Lecture Notes in Computer Science, vol 4100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847465_8
Download citation
DOI: https://doi.org/10.1007/11847465_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39382-5
Online ISBN: 978-3-540-39383-2
eBook Packages: Computer ScienceComputer Science (R0)