Efficiently mining maximal frequent itemsets based on digraph

被引：0
|
作者：
Ren, Zhibo [1 ]
Zhang, Qiang [2 ]
Ma, Xiujuan [3 ]
机构：
[1] Hebei Univ, Sch Management, Baoding, Peoples R China
[2] Beijing Inst Technol, Sch Management & Econ, Beijing, Peoples R China
[3] North China Elect Power Univ, Baoding, Peoples R China
来源：
FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS | 2007年
关键词：
D O I：
10.1109/FSKD.2007.268
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We present MFIMiner, a new algorithm for mining maximal frequent itemsets. The algorithm has a preprocessing phase in which a digraph is constructed The digraph represents the set of the frequent 2-itemsets which is the key issue of the performance of the data mining. Then the search for maximal frequent itemsets is done in the digraph. Experiments show that the algorithm is efficient not only to dense data, but to sparse data.
引用
收藏
页码：140 / +
页数：2
相关论文
共 50 条
  • [41] GeneticMax: An Efficient Approach to Mining Maximal Frequent Itemsets Based on Genetic Algorithms
    Kabir, Mir Md. Jahangir
    Xu, Shuxiang
    Kang, Byeong Ho
    Zhao, Zongyuan
    [J]. INFORMATION TECHNOLOGY IN INDUSTRY, 2015, 3 (03): : 64 - 73
  • [42] Distributed Mining of Maximal Frequent Itemsets on a Data Grid System
    Congnan Luo
    Anil L. Pereira
    Soon M. Chung
    [J]. The Journal of Supercomputing, 2006, 37 : 71 - 90
  • [43] New Policy of Maximal Frequent Itemsets in Data Stream Mining
    Xu, ChongHuan
    Ju, ChunHua
    [J]. ADVANCED MECHANICAL ENGINEERING, PTS 1 AND 2, 2010, 26-28 : 118 - +
  • [44] A novel approach for data stream maximal frequent itemsets mining
    [J]. Xu, Chong-Huan (talentxch@163.com), 1600, Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (10):
  • [45] Mining maximal frequent itemsets for large scale transaction databases
    Xia, R
    Yuan, W
    Ding, SC
    Liu, J
    Zhou, HB
    [J]. PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 1480 - 1485
  • [46] Distributed mining of maximal frequent itemsets on a Data Grid system
    Luo, Congnan
    Pereira, Anil L.
    Chung, Soon M.
    [J]. JOURNAL OF SUPERCOMPUTING, 2006, 37 (01): : 71 - 90
  • [47] An algorithm for mining maximal frequent itemsets without candidate generation
    Li Haiwen
    Yang Li
    Hong De
    [J]. 2011 INTERNATIONAL CONFERENCE ON COMPUTER, ELECTRICAL, AND SYSTEMS SCIENCES, AND ENGINEERING (CESSE 2011), 2011, : 330 - 333
  • [48] MFI-TransSW plus : Efficiently Mining Frequent Itemsets in Clickstreams
    de Amorim, Franklin A.
    Nunes, Bernardo Pereira
    Lopes, Giseli Rabello
    Casanova, Marco A.
    [J]. E-COMMERCE AND WEB TECHNOLOGIES, EC-WEB 2016, 2017, 278 : 87 - 99
  • [49] Efficiently mining maximal frequent mutually associated patterns
    Zhou, Zhongmei
    Wu, Zhaohui
    Wang, Chunshan
    Feng, Yi
    [J]. ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS, 2006, 4093 : 110 - 117
  • [50] Maximal Frequent Itemsets in Data Stream Mining Based on Orderly-Compound Policy
    Chen, PeiShuai
    Xu, ChongHuan
    [J]. ADVANCED MECHANICAL ENGINEERING, PTS 1 AND 2, 2010, 26-28 : 113 - +
12345