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....
保存先:
主要な著者: | 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, 等
出版事項: (2021) -
NUCLEAR: An Efficient Method for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
著者:: Phạm, Quang Huy, 等
出版事項: (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, 等
出版事項: (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)