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 条
  • [21] Recent Weighted Maximal Frequent Itemsets Mining
    Subbulakshmi, B.
    Dharini, B.
    Deisy, C.
    [J]. 2017 INTERNATIONAL CONFERENCE ON I-SMAC (IOT IN SOCIAL, MOBILE, ANALYTICS AND CLOUD) (I-SMAC), 2017, : 391 - 397
  • [22] Maintenance of Maximal Frequent Itemsets in Large Databases
    Lian, Wang
    Cheung, David W.
    Yiu, S. M.
    [J]. APPLIED COMPUTING 2007, VOL 1 AND 2, 2007, : 388 - 392
  • [23] An efficient approach based on selective partitioning for maximal frequent itemsets mining
    Bai, Anita
    Dhabu, Meera
    Jagtap, Viraj
    Deshpande, Parag S.
    [J]. SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2019, 44 (08):
  • [24] Efficiently Mining Maximal Diverse Frequent Itemsets
    Wu, Dingming
    Luo, Dexin
    Jensen, Christian S.
    Huang, Joshua Zhexue
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2019), PT II, 2019, 11447 : 191 - 207
  • [25] An efficient approach based on selective partitioning for maximal frequent itemsets mining
    Anita Bai
    Meera Dhabu
    Viraj Jagtap
    Parag S Deshpande
    [J]. Sādhanā, 2019, 44
  • [26] A New Method for Mining Maximal Frequent Itemsets based on Graph Theory
    Nadi, Farzad
    Foroozandeh, Atefeh
    Hormozi, Shahram Golzari
    Shahraki, Mohammad H. Nadimi
    [J]. 2014 4TH INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE), 2014, : 183 - 188
  • [27] FCILINK: Mining Frequent Closed Itemsets Based on a Link Structure between Transactions
    Han, Kyong
    Kim, Jae
    [J]. JOURNAL OF INFORMATION & KNOWLEDGE MANAGEMENT, 2005, 4 (04) : 257 - 267
  • [28] Fast mining maximal frequent itemsets; Based on FP-tree
    Yan, YJ
    Li, ZJ
    Chen, HW
    [J]. CONCEPTUAL MODELING - ER 2004, PROCEEDINGS, 2004, 3288 : 348 - 361
  • [29] Document clustering based on maximal frequent sequences
    Hernandez-Reyes, Edith
    Garcia-Hernandez, Rene A.
    Carrasco-Ochoa, J. A.
    Martinez-Trinidad, J. Fco.
    [J]. ADVANCES IN NATURAL LANGUAGE PROCESSING, PROCEEDINGS, 2006, 4139 : 257 - 267
  • [30] Hierarchical document clustering using frequent itemsets
    Fung, BCM
    Wang, K
    Ester, M
    [J]. PROCEEDINGS OF THE THIRD SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2003, : 59 - 70