A novel algorithm for frequent itemset mining in data warehouses

被引：3
|
作者：
徐利军
谢康林
机构：
[1] Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200030 China
[2] Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200030 China
来源：
Journal of Zhejiang University-Science A(Applied Physics & Engineering) | 2006年 / 02期
关键词：
Frequent itemset; Close itemset; Star schema; Dimension table; Fact table;
D O I：
暂无
中图分类号：
TP311.13 [];
学科分类号：
1201 ;
摘要：
Current technology for frequent itemset mining mostly applies to the data stored in a single transaction database. This paper presents a novel algorithm MultiClose for frequent itemset mining in data warehouses. MultiClose respectively computes the results in single dimension tables and merges the results with a very efficient approach. Close itemsets technique is used to improve the performance of the algorithm. The authors propose an efficient implementation for star schemas in which their al- gorithm outperforms state-of-the-art single-table algorithms.
引用
收藏
页码：216 / 224
页数：9
相关论文
共 50 条
  • [41] A Survey on Closed Frequent Itemset Mining on Data Streams
    Bai, Pavitra . S.
    Kumar, Ravi . G. . K.
    [J]. PROCEEDINGS OF THE 2016 2ND INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING AND INFORMATICS (IC3I), 2016, : 542 - 547
  • [42] An Efficient Spark-Based Hybrid Frequent Itemset Mining Algorithm for Big Data
    Al-Bana, Mohamed Reda
    Farhan, Marwa Salah
    Othman, Nermin Abdelhakim
    [J]. DATA, 2022, 7 (01)
  • [43] SWEclat: a frequent itemset mining algorithm over streaming data using Spark Streaming
    Wen Xiao
    Juan Hu
    [J]. The Journal of Supercomputing, 2020, 76 : 7619 - 7634
  • [44] A sliding window based algorithm for frequent closed itemset mining over data streams
    Nori, Fatemeh
    Deypir, Mahmood
    Sadreddini, Mohamad Hadi
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 2013, 86 (03) : 615 - 623
  • [45] Approximate Frequent Itemset Mining for Streaming Data on FPGA
    Li, Yubin
    Sun, Yuliang
    Dai, Guohao
    Xu, Qiang
    Wang, Yu
    Yang, Huazhong
    [J]. 2016 26TH INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE LOGIC AND APPLICATIONS (FPL), 2016,
  • [46] Efficient Incremental Itemset Tree for Approximate Frequent Itemset Mining On Data Stream
    Bai, Pavitra S.
    Kumar, Ravi G. K.
    [J]. PROCEEDINGS OF THE 2016 2ND INTERNATIONAL CONFERENCE ON APPLIED AND THEORETICAL COMPUTING AND COMMUNICATION TECHNOLOGY (ICATCCT), 2016, : 239 - 242
  • [47] Recommendation using Frequent Itemset Mining in Big Data
    Kunjachan, Honeytta
    Hareesh, M. J.
    Sreedevi, K. M.
    [J]. PROCEEDINGS OF THE 2018 SECOND INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS), 2018, : 561 - 566
  • [48] Parallel Incremental Frequent Itemset Mining for Large Data
    Yu-Geng Song
    Hui-Min Cui
    Xiao-Bing Feng
    [J]. Journal of Computer Science and Technology, 2017, 32 : 368 - 385
  • [49] A Parallel Algorithm for Approximate Frequent Itemset Mining using MapReduce
    Fumarola, Fabio
    Malerba, Donato
    [J]. 2014 INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING & SIMULATION (HPCS), 2014, : 335 - 342
  • [50] An efficient polynomial delay algorithm for pseudo frequent itemset mining
    Uno, Takeaki
    Arimura, Hiroki
    [J]. DISCOVERY SCIENCE, PROCEEDINGS, 2007, 4755 : 219 - +
12345