Mining bridging rules between conceptual clusters

被引:4
作者
Zhang, Shichao [1 ,5 ]
Chen, Feng [2 ]
Wu, Xindong [3 ,4 ]
Zhang, Chengqi [5 ]
Wang, Ruili [6 ]
机构
[1] Zhejiang Normal Univ, Inst Artificial Intelligence, Jinhua, Peoples R China
[2] La Trobe Univ, Melbourne, Vic, Australia
[3] Hefei Univ Technol, Hefei, Peoples R China
[4] Univ Vermont, Burlington, VT 05405 USA
[5] Univ Technol Sydney, Ctr Quantum Computat & Intelligent Syst, Sydney, NSW 2007, Australia
[6] Massey Univ, Sch Engn & Adv Technol, Palmerston North, New Zealand
基金
美国国家科学基金会; 澳大利亚研究理事会;
关键词
Bridging rule; Clustering; Weighting; Association rule; Entropy; CLASSIFICATION;
D O I
10.1007/s10489-010-0247-y
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Bridging rules take the antecedent and action from different conceptual clusters. They are distinguished from association rules (frequent itemsets) because (1) they can be generated by the infrequent itemsets that are pruned in association rule mining, and (2) they are measured by their importance including the distance between two conceptual clusters, whereas frequent itemsets are measured only by their support. In this paper, we first design two algorithms for mining bridging rules between clusters, and then propose two non-linear metrics to measure their interestingness. We evaluate these algorithms experimentally and demonstrate that our approach is promising.
引用
收藏
页码:108 / 118
页数:11
相关论文
共 37 条
  • [1] DRFP-tree: disk-resident frequent pattern tree
    Adnan, Muhaimenul
    Alhajj, Reda
    [J]. APPLIED INTELLIGENCE, 2009, 30 (02) : 84 - 97
  • [2] [Anonymous], 1994, Wiley series in probability and mathematical statistics applied probability and statistics
  • [3] Arning A., 1996, KDD-96 Proceedings. Second International Conference on Knowledge Discovery and Data Mining, P164
  • [4] Detecting group differences: Mining contrast sets
    Bay, SD
    Pazzani, MJ
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2001, 5 (03) : 213 - 246
  • [5] Detecting small group activities from multimodal observations
    Brdiczka, Oliver
    Maisonnasse, Jerome
    Reignier, Patrick
    Crowley, James L.
    [J]. APPLIED INTELLIGENCE, 2009, 30 (01) : 47 - 57
  • [6] Breunig M., 2000, P ACM INT C MAN DAT
  • [7] On nearest-neighbor graphs
    Eppstein, D
    Paterson, MS
    Yao, FF
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1997, 17 (03) : 263 - 282
  • [8] StatApriori: an efficient algorithm for searching statistically significant association rules
    Hamalainen, Wilhelmiina
    [J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2010, 23 (03) : 373 - 399
  • [9] Han J, 2000, Data mining: Concepts and Techniques
  • [10] HUSSAIN F, 2000, P PAC AS C KNOWL DIS, P86