Existing association-rule mining algorithms mainly rely on the support-based pruning strategy to prune its combinatorial search space. This strategy is not quite effective in the process of mining potentially interesting low-support patterns. To solve this problem, the paper presents a novel concept of association pattern called credible association rule (CAR), in which each item has the same support level. The confidence directly reflects the credible degree of the rule instead of the traditional support. This paper also proposes a MaxCliqueMining algorithm which creates 2-item credible sets by adjacency matrix and then generates all rules based on maximum clique. Some propositions are verified and which show the properties of CAR and the feasibility and validity of the algorithm. Experimental results on the alarm dataset and Pumsb dataset demonstrate the effectiveness and accuracy of this method for finding CAR.
[1] Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases. 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.
[2] Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Bocca JB, Jarke M, Zaniolo C, eds. Proc. of the 20th Int’l Conf. on Very Large Data Bases. Santigo: Morgan Kaufman Publishers, 1994. 478-499.
[3] Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. In: Chen WD, Naughton J, Bernstein PA, eds. Proc. of the 2000 ACM SIGMOD Int’l Conf. on Management of Data (SIGMOD 2000). New York: ACM Press, 2000. 1-12.
[4] Hipp J, Güntzer U, Nakhaeizadeh G. Algorithms for association rule mining—A general survey and comparison. SigKDD Explorations, 2000,2(1):58-64,
[5] Mannila H, Toivonen H, Verkamo A. Discovery of frequent episodes in event sequences. In: Katharina M, Hanna K eds. Data Mining and Knowledge Discovery 1. Netherlands: Kluwer Academic Publishers, 1997. 259-289.
[6] Xu QF, Xiao B, Guo J. A mining algorithm with alarm association rules based on statistical correlation. Journal of Beijing University of Posts and Telecommunications, 2007,30(1):66-70 (in Chinese with English abstract).
[7] Omiecinski ER. Alternative interest measures for mining associations in databases. IEEE Trans. on Knowledge and Data Engineering (TKDE), 2003,15(1):57-69.
[8] Xiong H, Tan PN, Kumar V. Mining strong affinity association patterns in data sets with skewed support distribution. In: Wu XD, Tuzhilin A, Shavlik J, eds. Proc. of the ICDM 2003. Melbourne: IEEE Computer Society, 2003. 387-394.
[9] Chen AL, Tang CJ, Tao HC, Yuan CA, Xie FJ. An improved algorithm based on maximum clique and FP-tree for mining association rules. Journal of Software, 2004,15(8):1198-1207 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/ 15/1198.htm
You are the first2038686Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.