A Fast Algorithm for Mining Top-Rank-k Erasable Closed Patterns-Reference-Cited by-同舟云学术

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

A Fast Algorithm for Mining Top-Rank-k Erasable Closed Patterns

Published:2022 Issue:2 Volume:72 Page:3571-3583
ISSN:1546-2226
Container-title:Computers, Materials & Continua
language:en
Short-container-title:

Author:

Nguyen Ham,Le Tuong

Publisher

Computers, Materials and Continua (Tech Science Press)

Subject

Electrical and Electronic Engineering,Computer Science Applications,Mechanics of Materials,Modeling and Simulation,Biomaterials

Reference33 articles.

1. Efficient algorithms for mining closed itemsets and their lattice structure;Zaki;IEEE Transactions on Knowledge and Data Engineering,2005

2. Fast algorithms for frequent itemset mining using FP-trees;Grahne;IEEE Transactions on Knowledge and Data Engineering,2005

3. Interestingness measures for mining association rules: Combination between lattice and hash tables;Vo;Expert Systems with Applications,2011

4. Mining frequent itemsets using the N-list and subsume concepts;Vo;International Journal of Machine Learning and Cybernetics,2016

5. Frequent itemset mining of user's multi-attribute under local differential privacy;Liu;CMC-Computers, Materials & Continua,2020

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

1. A Parallel Mining Algorithm for Maximum Erasable Itemset Based on Multi-core Processor;Tehnicki vjesnik - Technical Gazette;2024-04-15

2. Predicting Monthly Household Water Consumption;2022 RIVF International Conference on Computing and Communication Technologies (RIVF);2022-12-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP