Skip to content
RDL
Network
Ecosystem
Switch app
TR
About
FAQ
Sign in
Get started
Efficient algorithms for mining closed high utility itemsets in dynamic profit databases — Trinh D. D. Nguyen (2021) | RDL Network
Back
Cite
Save
Save for later
Share
Home
Publications
Efficient algorithms for mining closed high utility itemsets in dynamic profit databases
Shared by
Witold Pedrycz
University of Alberta
Efficient algorithms for mining closed high utility itemsets in dynamic profit databases
Article
2021
en
Authors
+2 more
TN
Trinh D. D. Nguyen
LN
Loan T. T. Nguyen
LV
Lung Vu
Discussion
(0)
Sign in
to like and join the discussion.
No comments yet. Be the first to comment.
Related publications
Article
2019
Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases
Unil Yun
,
Hyoju Nam
,
Jong-Seong Kim
,
Heonho Kim
,
Yoonji Baek
,
Judae Lee
,
Eunchul Yoon
,
Tin Truong
,
Bay Vo
,
Witold Pedrycz
Article
2017
Efficient frequent itemsets mining through sampling and information granulation
Zhongjie Zhang
,
Witold Pedrycz
,
Jian Huang
Article
2022
Scalable and Efficient Approach for High Temporal Fuzzy Utility Pattern Mining
Taewoong Ryu
,
Heonho Kim
,
Chanhee Lee
,
Heonmo Kim
,
Bay Vo
,
Jerry Chun‐Wei Lin
,
Witold Pedrycz
,
Unil Yun
Article
2016
An efficient algorithm for mining frequent weighted itemsets using interval word segments
Ham Nguyen
,
Bay Vo
,
Le-Minh Nguyen
,
Witold Pedrycz
Article
2022
Occupancy‐based utility pattern mining in dynamic environments of intelligent systems
Discussion(0)
No comments yet. Be the first to comment.