Mining Method for Weighted Concise Association Rules Based on Closed Itemsets under Weighted Support Framework

Abstract:

Association rules tell us interesting relationships between different items in transaction database. But traditional association rule has two disadvantages. Firstly it assumes every two items have same significance in database, which is unreasonable in many real applications and usually leads to incorrect results. On the other hand, traditional association rule representation contains too much redundancy which makes it difficult to be mined and used. This paper addresses the problem of mining weighted concise association rules based on closed itemsets under weighted support-significant framework, in which each item with different significance is assigned different weight. Through exploiting specific technique, the proposed algorithm can mine all weighted concise association rules while duplicate weighted itemset search space is pruned. As illustrated in experiments, the proposed method leads to good results and achieves good performance.

• Periodical: Applied Mechanics and Materials (Volumes 236-237)
• Pages: 326-333
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.236-237.326
• Online since: November 2012
• Authors: Zhi Cheng Qu, Meng Ye, Bin Jiang
• Keywords: Algorithm (GA), Closed Itemset, Support-Significant, Weighted Concise Association Rule

References

[1] R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In SIGMOD'93, May (1993).

DOI: 10.1145/170035.170072

[2] J. Han, I. Pei, and Y. Yin. Mining frequent paterns without candidate generation. In Proc. SIGMOD '00, pages 1-12, (2000).

DOI: 10.1145/335191.335372

[3] M. J. Zaki and C. -J Hsiao. Charm: An efficient algorithm for closed itemsets mining. In 2nd SIAM International Conference on Data Mining, April (2002).

DOI: 10.1137/1.9781611972726.27

[4] J. Liu, Y. Pan, K. Wang, and J. Han. Mining frequent item sets by opportunistic projection. In SIGKDD'02, July (2002).

DOI: 10.1145/775047.775081

[5] M. J. Zaki and K. Gouda. Fast vertical mining using diffsets. In Technical Report 01-1, Computer Science Dept., Rensselaer Polytechnic Institute, March (2001).

[6] J. Pei, J. Han, and J. Wang. Closet+: Searching for the best strategies for mining frequent closed itemsets. In SIGKDD '03, August (2003).

DOI: 10.1145/956750.956779

[7] C. Lucchese, S. Orlando, and R. Perego. Mining frequent closed itemsets without duplicates generation. I.S.T.I. -C.N.R. Technical Report 13, (2004).

[8] Haifeng Feng, Marie-Jeanne Lesot and Marcin Detyniecki. Using Association Rules to Discover Color-Emotion Relationships Based on Social Tagging. Lecture Notes in Computer Science, 2010, Volume 6276, Knowledge-Based and Intelligent Information and Engineering Systems, Pages 544-553. http: /www. ics. uci. edu/mlearn/MLRepository. html.

DOI: 10.1007/978-3-642-15387-7_58

[9] Maybin Muyeba, M. Sulaiman Khan and Frans Coenen. Fuzzy Weighted Association Rule Mining with Weighted Support and Confidence Framework. Lecture Notes in Computer Science, 2009, Volume 5433, New Frontiers in Applied Data Mining, Pages 49-61.

DOI: 10.1007/978-3-642-00399-8_5

[10] Feng Tao, Fionn Murtagh, Mohsen Farid. Weighted association rule mining using weighted support and significance framework. In Proc. of SIGKDD (2003).

DOI: 10.1145/956750.956836