Clustering Transactions Based on Weighting Maximal Frequent Itemsets

被引:1
|
作者
Huang, Faliang [1 ,2 ]
Xie, Guoqing
Yao, Zhiqiang
Cai, Shengzhen
机构
[1] Fujian Normal Univ, Fac Software, Fuzhou 350007, Peoples R China
[2] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Peoples R China
关键词
D O I
10.1109/ISKE.2008.4730938
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose a new similarity measure for comparing maximal frequent itemset(MFI), which takes into account not only non-numeric attributes but also numeric attributes of each item while computing similarity between MFIs. This provides more reliable soundness for clustering results interpretation. Traditional approaches consider just one side and are apt to lead to unintelligible clustering results for decision-makers. Based on properties of maximal frequent itemset(MFI), we construct a multi-level hierarchical model (MHM) for our clustering algorithm. Moreover, to evaluate our approach and compare with other similarity strategies, we construct an original evaluating strategy NF_Measure which integrates both quantity similarity and quality similarity between transactions. We experimentally evaluate the proposed approach and demonstrate that our algorithm is promising and effective.
引用
收藏
页码:262 / +
页数:3
相关论文
共 50 条
  • [1] Clustering categorical data based on maximal frequent itemsets
    Yu, Dadong
    Liu, Dongbo
    Luo, Rui
    Wang, Jianxin
    [J]. ICMLA 2007: SIXTH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS, PROCEEDINGS, 2007, : 93 - +
  • [2] Clustering Frequent Itemsets Based on Generators
    Li, Jinhong
    Yang, Bingru
    Song, Wei
    Hou, Wei
    [J]. 2008 INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION, VOL II, PROCEEDINGS, 2008, : 1083 - +
  • [3] CL-MAX: a clustering-based approximation algorithm for mining maximal frequent itemsets
    Fatemi, Seyed Mohsen
    Hosseini, Seyed Mohsen
    Kamandi, Ali
    Shabankhah, Mahmood
    [J]. INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2021, 12 (02) : 365 - 383
  • [4] CL-MAX: a clustering-based approximation algorithm for mining maximal frequent itemsets
    Seyed Mohsen Fatemi
    Seyed Mohsen Hosseini
    Ali Kamandi
    Mahmood Shabankhah
    [J]. International Journal of Machine Learning and Cybernetics, 2021, 12 : 365 - 383
  • [5] A genetic algorithm based searching of maximal frequent itemsets
    Huang, JP
    Yang, CT
    Fu, CH
    [J]. IC-AI '04 & MLMTA'04 , VOL 1 AND 2, PROCEEDINGS, 2004, : 548 - 554
  • [6] Efficiently mining maximal frequent itemsets based on digraph
    Ren, Zhibo
    Zhang, Qiang
    Ma, Xiujuan
    [J]. FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS, 2007, : 140 - +
  • [7] Mining maximal frequent itemsets by a boolean based approach
    Salleb, A
    Maazouzi, Z
    Vrain, C
    [J]. ECAI 2002: 15TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2002, 77 : 385 - 389
  • [8] Efficiently mining maximal frequent itemsets
    Gouda, K
    Zaki, MJ
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 163 - 170
  • [9] On Maximal Frequent Itemsets Mining with Constraints
    Jabbour, Said
    Mana, Fatima Ezzahra
    Dlala, Imen Ouled
    Raddaoui, Badran
    Sais, Lakhdar
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, 2018, 11008 : 554 - 569
  • [10] Mining maximal frequent itemsets with frequent pattern list
    Qian, Jin
    Ye, Feiyue
    [J]. FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 1, PROCEEDINGS, 2007, : 628 - 632