Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
Closed high utility itemsets (CHUIs) and maximal high utility itemsets (MaxHUIs) are two important concise representations of HUIs. Discovering these itemsets is important because they are lossless and compact, i.e., they provide a concise summary of all HUIs that can be orders of magnitude smaller....
Wedi'i Gadw mewn:
Prif Awduron: | Dương, Văn Hải, Hoàng, Minh Tiến, Trần, Thống |
---|---|
Fformat: | Journal article |
Iaith: | Vietnamese |
Cyhoeddwyd: |
2024
|
Pynciau: | |
Mynediad Ar-lein: | https://doi.org/10.1016/j.knosys.2022.109921 https://www.sciencedirect.com/science/article/abs/pii/S0950705122010140 |
Tagiau: |
Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Eitemau Tebyg
-
Approximate high utility itemset mining in noisy environments
gan: Yoonji Baek, et al.
Cyhoeddwyd: (2021) -
NUCLEAR: An Efficient Method for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
gan: Phạm, Quang Huy, et al.
Cyhoeddwyd: (2023) -
An efficient algorithm for mining frequent itemsets containing a constraint subset /
gan: Van Hai Duong. -
An efficient algorithm for mining frequent itemsets containing a constraint subset
gan: Duong, Van Hai, et al.
Cyhoeddwyd: (2014) -
Nghiên cứu một số chặn trên của hàm lợi ích trung bình trên các tập mục
gan: Nguyễn, Thị Thúy Hằng
Cyhoeddwyd: (2025)