A New Approach for Mining Top-Rank-k Erasable Itemsets

Giang Nguyen,Tuong Le,Bay Vo,Bac Le

doi:10.1007/978-3-319-05476-6_8

A New Approach for Mining Top-Rank-k Erasable Itemsets

Giang Nguyen, Tuong Le + Show 2 more

https://doi.org/10.1007/978-3-319-05476-6_8

Copy DOI

Publication Date: Jan 1, 2014

Citations: 15

Affiliation: Ho Chi Minh City University of Technology, Ton Duc Thang University, Ho Chi Minh City University of Science, Information Technology University

#Erasable Itemsets #Problem Of Mining + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

AbstractErasable itemset mining first introduced in 2009 is an interesting variation of pattern mining. The managers can use the erasable itemsets for planning production plan of the factory. Besides the problem of mining erasable itemsets, the problem of mining top-rank-k erasable itemsets is an interesting and practical problem. In this paper, we first propose a new structure, call dPID_List and two theorems associated with it. Then, an improved algorithm for mining top-rank-k erasable itemsets using dPID_List structure is developed. The effectiveness of the proposed method has been demonstrated by comparisons in terms of mining time and memory usage with VM algorithm for three datasets.Keywordsdata miningerasable itemsetpattern miningtop-rank-k

Full Text