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....
Guardat en:
Autors principals: | Dương, Văn Hải, Hoàng, Minh Tiến, Trần, Thống |
---|---|
Format: | Journal article |
Idioma: | Vietnamese |
Publicat: |
2024
|
Matèries: | |
Accés en línia: | https://doi.org/10.1016/j.knosys.2022.109921 https://www.sciencedirect.com/science/article/abs/pii/S0950705122010140 |
Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Ítems similars
-
Approximate high utility itemset mining in noisy environments
per: Yoonji Baek, et al.
Publicat: (2021) -
NUCLEAR: An Efficient Method for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
per: Phạm, Quang Huy, et al.
Publicat: (2023) -
An efficient algorithm for mining frequent itemsets containing a constraint subset /
per: Van Hai Duong. -
An efficient algorithm for mining frequent itemsets containing a constraint subset
per: Duong, Van Hai, et al.
Publicat: (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
per: Nguyễn, Thị Thúy Hằng
Publicat: (2025)