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....
Đã lưu trong:
Những tác giả chính: | Dương, Văn Hải, Hoàng, Minh Tiến, Trần, Thống |
---|---|
格式: | Journal article |
語言: | Vietnamese |
出版: |
2024
|
主題: | |
在線閱讀: | https://doi.org/10.1016/j.knosys.2022.109921 https://www.sciencedirect.com/science/article/abs/pii/S0950705122010140 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
相似書籍
-
Approximate high utility itemset mining in noisy environments
由: Yoonji Baek, et al.
出版: (2021) -
NUCLEAR: An Efficient Method for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
由: Phạm, Quang Huy, et al.
出版: (2023) -
An efficient algorithm for mining frequent itemsets containing a constraint subset /
由: Van Hai Duong. -
An efficient algorithm for mining frequent itemsets containing a constraint subset
由: Duong, Van Hai, et al.
出版: (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
由: Nguyễn, Thị Thúy Hằng
出版: (2025)