Abstract
Association rule mining has a capability to find hidden correlations among different items within a dataset. To find hidden correlations, it uses two important thresholds known as support and confidence. However, association rule mining algorithms produce many redundant rules though it uses above thresholds. Indeed such redundant rules seem as a main impediment to efficient utilization discovered association rules, and should be removed. To achieve this aim, in the paper, we present several redundant rule elimination methods that first identify the rules that have similar meaning and then eliminate those rules. Furthermore, our methods eliminate redundant rules in such a way that they never drop any higher confidence or interesting rules from the resultant ruleset. The experimental evaluation shows that our proposed methods eliminate a significant number of redundant rules.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Imielinski, T., Srikant, R.: Mining Association Rules between Sets of Items in Large Databases. In: The proc. ACM SIGMOD, pp. 207–216 (1993)
Zaki, M.J.: Parallel and Distributed Association Mining: A Survey. In: IEEE Concurrency, pp. 14–25 (October-December 1999)
Aggarwal, C.C., Yu, P.S.: A new Approach to Online Generation of Association Rules. IEEE TKDE 13(4), 527–540
Liu, B., Hu, M., Hsu, W.: Multi-Level Organization and Summarization of the Discovered Rules. In: The proc. KDD, pp. 208–217 (2000)
Liu, B., Hsu, W., Ma, Y.: Pruning and Summarize the Discovered Associations. In: The proc. ACM SIGMOD, San Diego, CA, pp. 125–134 (August 1999)
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A.I.: Finding Interesting Rules from Large Sets of Discovered Association Rules. In: Proc.CIKM, pp. 401–407 (1994)
Zaki, M.J.: Generating non-redundant association rules. In: Proceeding of the ACM SIGKDD, pp. 34–43 (2000)
Liu, B., Hsu, W., Ma, Y.: Mining Association Rules with Multiple Minimum Supports. In: The proc. KDD, pp. 337–341 (1999)
Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases, University of California, Irvine, Dept. of Information and Computer Science (1998), www.ics.uci.edu/~mlearn/MLRepository.html
Kohavi, R., Brodley, C., Frasca, B., Mason, L., Zheng, Z.: KDD-Cup 2000 organizers report: Peeling the onion. SIGKDD Explorations 2(2), 86–98 (2000), http://www.ecn.purdue.edu/KDDCUP/
Goethals, B.: Frequent Pattern Mining Implementations, University of Helsinki-Department of Computer Science, http://www.cs.helsinki.fi/u/goethals/software/
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, p. 972. Springer, Heidelberg (2000)
Zaki, M.J.: Mining Non-Redundant Association Rules. Data Mining and Knowledge Discovery 9, 223–248 (2004)
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
Ashrafi, M.Z., Taniar, D., Smith, K. (2005). Redundant Association Rules Reduction Techniques. 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_28
Download citation
DOI: https://doi.org/10.1007/11589990_28
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)