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....
Uloženo v:
Hlavní autoři: | Dương, Văn Hải, Hoàng, Minh Tiến, Trần, Thống |
---|---|
Médium: | Journal article |
Jazyk: | Vietnamese |
Vydáno: |
2024
|
Témata: | |
On-line přístup: | https://doi.org/10.1016/j.knosys.2022.109921 https://www.sciencedirect.com/science/article/abs/pii/S0950705122010140 |
Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Podobné jednotky
-
Approximate high utility itemset mining in noisy environments
Autor: Yoonji Baek, a další
Vydáno: (2021) -
NUCLEAR: An Efficient Method for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
Autor: Phạm, Quang Huy, a další
Vydáno: (2023) -
An efficient algorithm for mining frequent itemsets containing a constraint subset /
Autor: Van Hai Duong. -
An efficient algorithm for mining frequent itemsets containing a constraint subset
Autor: Duong, Van Hai, a další
Vydáno: (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
Autor: Nguyễn, Thị Thúy Hằng
Vydáno: (2025)