Mining erasable itemsets with subset and superset itemset constraints

Bay Vo; Tuong Le; Witold Pedrycz; Giang Nguyen; Sung Wook Baik

doi:10.1016/j.eswa.2016.10.028

Back

Discussion(0)

No comments yet. Be the first to comment.

Related publications

Article2016

Efficient mining of class association rules with the itemset constraint

Dang Nguyen, Loan T. T. Nguyen, Bay Vo, Witold Pedrycz

Article2017

Efficient frequent itemsets mining through sampling and information granulation

Zhongjie Zhang, Witold Pedrycz, Jian Huang

Article2024

Uncertainty Oriented-Incremental Erasable Pattern Mining Over Data Streams

Hanju Kim, Myungha Cho, Hyeonmo Kim, Yoonji Baek, Chanhee Lee, Taewoong Ryu, Heonho Kim, Seungwan Park, Doyoon Kim, Do‐Young Kim, Sinyoung Kim, Bay Vo, Jerry Chun‐Wei Lin, Witold Pedrycz, Unil Yun

Article2016

An efficient algorithm for mining frequent weighted itemsets using interval word segments

Ham Nguyen, Bay Vo, Le-Minh Nguyen, Witold Pedrycz

Article2021

Efficient algorithms for mining closed high utility itemsets in dynamic profit databases

Trinh D. D. Nguyen, Loan T. T. Nguyen, Lung Vu, Bay Vo, Witold Pedrycz