Mining erasable itemsets with subset and superset itemset constraints
详细信息 查看全文
- 作者：Bay Voa ; b ; bayvodinh@gmail.com" class="auth_mail" title="E-mail the corresponding author ; Tuong Lec ; d ; lecungtuong@tdt.edu.vn" class="auth_mail" title="E-mail the corresponding author ; tuonglecung@gmail.com" class="auth_mail" title="E-mail the corresponding author ; Witold Pedrycze ; f ; g ; wpedrycz@ualberta.ca" class="auth_mail" title="E-mail the corresponding author ; Giang Nguyena ; nh.giang@hutech.edu.vn" class="auth_mail" title="E-mail the corresponding author ; Sung Wook Baikb ; sbaik@sejong.ac.kr" class="auth_mail" title="E-mail the corresponding author
- 关键词：Data mining ; Erasable itemset ; Subset and superset itemset constraint ; Pruning techniques
- 刊名：Expert Systems with Applications
- 出版年：2017
- 出版时间：1 March 2017
- 年：2017
- 卷：69
- 期：Complete
- 页码：50-61
- 全文大小：2548 K
文摘
- •
We state the problem of mining EIs with subset and superset itemset constraints.
- •
Two propositions supporting a quick pruning nodes were proposed.
- •
pMEIC algorithm based on two above propositions was proposed.
- •
The experiments were conducted to show the effectiveness of pMEIC.