An Interestingness Measure and Computation Method of Association Rules Based on Frequent Itemsets Relatedness

被引:0
|
作者
Chen, Xiang [1 ]
Zhou, Xuefeng [1 ]
Zhang, Yong [2 ]
机构
[1] Xian Technol Univ, Sch Civil Engn, Xian, Peoples R China
[2] Wuhan Univ Sci & Technol, Wuhan, Peoples R China
关键词
Association rules; Frequent itemsets; Relatedness; Interestingness;
D O I
10.4028/www.scientific.net/AMM.71-78.4039
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
To address inadequacy of association rules interestingness measure method currently, we present a novel method to measure interestingness with relatedness among items in frequent itemsets. It firstly computed relatedness between frequent k-itemsets and each subset of frequent 2-itemsets, which is a linear combination of Complementarity Intensity (CI), Substitutability Intensity (SI) and Mutual Interaction (MI). The mean of relatedness of all frequent 2-itemsets subsets was regarded as relatedness of frequent k-itemsets. Finally weighted computation method of association rule interestingness was given according to principle of objective interestingness of association rule is inversely proportional to relatedness of frequent itemsets. The method can not only sort rules, but also analyze actual relationship among all items in frequent 2-itemsets, which is conductive to selection of users on rules.
引用
收藏
页码:4039 / +
页数:2
相关论文
共 50 条
  • [41] A framework for evaluating knowledge-based interestingness of association rules
    Shekar B.
    Natarajan R.
    Fuzzy Optimization and Decision Making, 2004, 3 (02) : 157 - 185
  • [42] Negative and Positive Association Rules Mining from Text Using Frequent and Infrequent Itemsets
    Mahmood, Sajid
    Shahbaz, Muhammad
    Guergachi, Aziz
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [43] Mining minimal non-redundant association rules using frequent closed itemsets
    Bastide, I
    Pasquier, N
    Taouil, R
    Stumme, G
    Lakhal, L
    COMPUTATIONAL LOGIC - CL 2000, 2000, 1861 : 972 - 986
  • [44] Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees
    Riondato, Matteo
    Upfal, Eli
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2014, 8 (04)
  • [45] Computing and pruning method for frequent pattern interestingness based on Bayesian networks
    Hu C.-L.
    Wu X.-D.
    Hu X.-G.
    Yao H.-L.
    Ruan Jian Xue Bao/Journal of Software, 2011, 22 (12): : 2934 - 2950
  • [46] An efficient interestingness based algorithm for mining association rules in medical databases
    Wasan, Siri Krishan
    Bhatnagar, Vasudha
    Kaur, Harleen
    ADVANCES AND INNOVATIONS IN SYSTEMS, COMPUTING SCIENCES AND SOFTWARE ENGINEERING, 2007, : 167 - +
  • [47] A fuzzy-graph-based approach to the determination of interestingness of association rules
    Shekar, B
    Natarajan, R
    PRACTICAL ASPECTS OF KNOWLEDGE MANAGEMENT, 2002, 2569 : 377 - 388
  • [48] A taxonomy-based approach to determining generic interestingness of association rules
    Natarajan, R
    Shekar, B
    IEEE TENCON 2003: CONFERENCE ON CONVERGENT TECHNOLOGIES FOR THE ASIA-PACIFIC REGION, VOLS 1-4, 2003, : 703 - 707
  • [49] Interestingness of discovered association rules in terms of neighborhood-based unexpectedness
    Dong, GZ
    Li, JY
    RESEARCH AND DEVELOPMENT IN KNOWLEDGE DISCOVERY AND DATA MINING, 1998, 1394 : 72 - 86
  • [50] MINING CONCISE ASSOCIATION RULES BASED ON GENERATORS AND CLOSED ITEMSETS
    Song, Wei
    Li, Jin-Hong
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6, 2009, : 249 - 254