Optimized Algorithm for Mining Valid and Non-Redundant Rules

Abstract:

The traditional algorithm of mining association rules, or slowly produces association rules, or produces too many redundant rules, or it is probable to find an association rule, which posses high support and confidence, but is uninteresting, and even is false. Furthermore, a rule with negative-item cant be produced. This paper puts forward a new algorithm MVNR(Mining Valid and non-Redundant Association Rules Algorithm),which primely solves above problems by using the minimal subset of frequent itemset.

• Periodical: Advanced Materials Research (Volumes 756-759)
• Pages: 3717-3722
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.756-759.3717
• Online since: September 2013
• Authors: Nai Li Liu, Lei Ma
• Keywords: Association Rule, Correlation, Data Mining (DM), Efficient, Negative, Redundancy

References

[1] R. Agrawal, Imielinski T, Swami A. Mining association rules between sets of items in large databases (C). In: Buneman P, Jajodia S, eds. Proc. of the ACM SIGMOD Conf. on Management of Data (SIGMOD'93). New York: ACM Press, 1993. 207~216.

DOI: 10.1145/170036.170072

[2] C.C. Aggarwal, Z. Sun, and P.S. Yu, Online Generation of Profile Association Rules, Proc. KDD Conf., (1998).

[3] Charu C. Aggarwal , Philip S. Yu, A New Approach to Online Generation of Association Rules, IEEE Transactions on Knowledge and Data Engineering, v. 13 n. 4, pp.527-540, July (2001).

DOI: 10.1109/69.940730

[4] N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In 7th Intl. Conf. on Database Theory, Jan. (1999).

DOI: 10.1007/3-540-49257-7_25

[5] N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1): 25–46, (1999).

DOI: 10.1016/s0306-4379(99)00003-4

[6] ZHAO, Y., ZHANG, C., AND ZHANG, S. 2006. Efficient frequent itemsets mining by sampling. In Proceeding of the 2006conference on Advances in Intelligent IT: Active Media Technology 2006. IOS Press, Amsterdam, The Netherlands, 112–117.

[7] M. J. Zaki and C. -J. Hsiao. CHARM: An efficient algorithm for closed association rule mining. Technical Report 99-10, Computer Science Dept., Rensselaer Polytechnic Institute, October (1999).

[8] Mohammed J. Zaki, Generating non-redundant association rules, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.34-43, August 20-23, 2000, Boston, Massachusetts, United States.

DOI: 10.1145/347090.347101

[9] Yves Bastide , Nicolas Pasquier , Rafik Taouil , Gerd Stumme , Lotfi Lakhal, Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets, Proceedings of the First International Conference on Computational Logic, pp.972-986, July 01, (2000).

DOI: 10.1007/3-540-44957-4_65

[10] R. J. Bayardo and R. Agrawal. Mining the most interesting rules. In 5th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, Aug. (1999).

DOI: 10.1145/312129.312219

[11] M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo. Finding interesting rules from large sets of discovered association rules. In 3rd Intl. Conf. Information and Knowledge Management, pages 401–407, Nov. (1994).

DOI: 10.1145/191246.191314

[12] Sergey Brin, Rajeev Motwani, Craig Silverstein. Beyond Market Baskets: Generalizing Association Rules to Correlations. In Proc. 1997 ACM - SIGMOD Int. Conf. Management of Data (SIGMOD'97), pages 265-276.

DOI: 10.1145/253262.253327

[13] CHANDRA, B. AND BHASKAR, S. 2011. A new approach for generating efficient sample from market basket data. Expert Systems with Applications 38, 3, 1321-1325.

DOI: 10.1016/j.eswa.2010.07.008

[14] CHAKARAVARTHY, V. T., PANDIT, V., AND SABHARWAL, Y. 2009. Analysis of sampling techniques for association rule mining. In Proceedings of the 12th International Conference on Database Theory. ICDT '09. ACM, New York, NY, USA, 276–283.

DOI: 10.1145/1514894.1514927