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....
Kaydedildi:
Asıl Yazarlar: | Dương, Văn Hải, Hoàng, Minh Tiến, Trần, Thống |
---|---|
Materyal Türü: | Journal article |
Dil: | Vietnamese |
Baskı/Yayın Bilgisi: |
2024
|
Konular: | |
Online Erişim: | https://doi.org/10.1016/j.knosys.2022.109921 https://www.sciencedirect.com/science/article/abs/pii/S0950705122010140 |
Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Benzer Materyaller
-
Approximate high utility itemset mining in noisy environments
Yazar:: Yoonji Baek, ve diğerleri
Baskı/Yayın Bilgisi: (2021) -
NUCLEAR: An Efficient Method for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
Yazar:: Phạm, Quang Huy, ve diğerleri
Baskı/Yayın Bilgisi: (2023) -
An efficient algorithm for mining frequent itemsets containing a constraint subset /
Yazar:: Van Hai Duong. -
An efficient algorithm for mining frequent itemsets containing a constraint subset
Yazar:: Duong, Van Hai, ve diğerleri
Baskı/Yayın Bilgisi: (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
Yazar:: Nguyễn, Thị Thúy Hằng
Baskı/Yayın Bilgisi: (2025)