Algorithms Based on Dynamic Minimum Probabilistic Support and Utility Thresholds for Mining Top-K High-Utility Itemsets From Uncertain Databases

Mining high-utility itemsets (HUIs) from large and uncertain databases is challenging due to the vast data volume and extensive search space. Determining the minimum utility and probabilistic support for all items is also a time-consuming task. Setting these thresholds too high results in too few it...

תיאור מלא

מידע ביבליוגרפי

Principais autores:	Khoi Nguyen, Thien Nguyen
פורמט:	Artigo
שפה:	Inglês
יצא לאור:	IEEE 2025-01-01
סדרה:	IEEE Access
נושאים:	Uncertain databases high-utility itemsets mining Top-K probabilistic support threshold
גישה מקוונת:	https://ieeexplore.ieee.org/document/11173640/
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!