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 条
  • [21] A Novel Method of Interestingness Measures for Association Rules Mining Based on Profit
    Ju, Chunhua
    Bao, Fuguang
    Xu, Chonghuan
    Fu, Xiaokang
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2015, 2015
  • [22] Closed frequent itemsets mining and structuring association rules based on Q-analysis
    Boulmakoul, Azedine
    Idri, Abdelfatah
    Marghoubi, Rabia
    2007 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY, VOLS 1-3, 2007, : 126 - 131
  • [23] Mining Positive and Negative Weighted Association Rules from Frequent Itemsets Based on Interest
    Jiang, He
    Zhao, Yuanyuan
    Dong, Xiangjun
    PROCEEDINGS OF THE 2008 INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN, VOL 2, 2008, : 242 - 245
  • [24] Interestingness Measures for Classification Based on Association Rules
    Nguyen, Loan T. T.
    Bay Vo
    Hong, Tzung-Pei
    Hoang Chi Thanh
    COMPUTATIONAL COLLECTIVE INTELLIGENCE - TECHNOLOGIES AND APPLICATIONS, PT II, 2012, 7654 : 383 - 392
  • [25] Mining frequent generalized itemsets and generalized association rules without redundancy
    Kunkle, Daniel
    Zhang, Donghui
    Cooperman, Gene
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2008, 23 (01) : 77 - 102
  • [26] EXTRACT: New extraction algorithm of association rules from frequent itemsets
    Feddaoui, Ilhem
    Felhi, Faical
    Akaichi, Jalel
    PROCEEDINGS OF THE 2016 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING ASONAM 2016, 2016, : 752 - 756
  • [27] Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
    Daniel Kunkle
    张冬晖
    Gene Cooperman
    JournalofComputerScience&Technology, 2008, 23 (01) : 77 - 102
  • [28] Mining Opened Frequent Itemsets to Generate Maximal Boolean Association Rules
    Jiang, Baoqing
    Han, Chong
    Li, Lingsheng
    2009 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING ( GRC 2009), 2009, : 274 - 277
  • [29] Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
    Daniel Kunkle
    Donghui Zhang
    Gene Cooperman
    Journal of Computer Science and Technology, 2008, 23 : 77 - 102
  • [30] Visualizing frequent itemsets, association rules, and sequential patterns in parallel coordinates
    Yang, L
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2003, PT 1, PROCEEDINGS, 2003, 2667 : 21 - 30