CFP-tree: A compact disk-based structure for storing and querying frequent itemsets-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

CFP-tree: A compact disk-based structure for storing and querying frequent itemsets

Published:2007-04 Issue:2 Volume:32 Page:295-319
ISSN:0306-4379
Container-title:Information Systems
language:en
Short-container-title:Information Systems

Author:

Liu Guimei,Lu Hongjun,Xu Yu Jeffrey

Publisher

Elsevier BV

Subject

Hardware and Architecture,Information Systems,Software

Reference44 articles.

1. Mining association rules between sets of items in large databases;Agrawal,1993

2. Discovering frequent closed itemsets for association rules;Pasquier,1999

3. Mining minimal non-redundant association rules using frequent closed itemsets;Bastide,2000

4. Mining all non-derivable frequent itemsets;Calders,2002

5. Efficient mining of emerging patterns: discovering trends and differences;Dong,1999

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mining Frequents Itemset and Association Rules in Diabetic Dataset;Business Intelligence;2022

2. Upper bounds for can-tree and FP-tree;Journal of Intelligent Information Systems;2021-09-21

3. Making Frequent-Pattern Mining Scalable, Efficient, and Compact on Nonvolatile Memories;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2021-07

4. Upper Bound on the Size of FP-Tree;Advances in Databases and Information Systems;2020

5. An algorithm for fast mining top-rank-k frequent patterns based on Node-list data structure;Intelligent Automation and Soft Computing;2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP