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 |
---|---|
Formáid: | Journal article |
Teanga: | Vietnamese |
Foilsithe: |
2024
|
Ábhair: | |
Rochtain Ar Líne: | https://doi.org/10.1016/j.knosys.2022.109921 https://www.sciencedirect.com/science/article/abs/pii/S0950705122010140 |
Clibeanna: |
Cuir Clib Leis
Gan Chlibeanna, Bí ar an gcéad duine leis an taifead seo a chlibeáil!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Míreanna Comhchosúla
-
Approximate high utility itemset mining in noisy environments
le: Yoonji Baek, et al.
Foilsithe: (2021) -
NUCLEAR: An Efficient Method for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
le: Phạm, Quang Huy, et al.
Foilsithe: (2023) -
An efficient algorithm for mining frequent itemsets containing a constraint subset /
le: Van Hai Duong. -
An efficient algorithm for mining frequent itemsets containing a constraint subset
le: Duong, Van Hai, et al.
Foilsithe: (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
le: Nguyễn, Thị Thúy Hằng
Foilsithe: (2025)