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....
שמור ב:
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)