Efficient Algorithm for Mining Non-Redundant High-Utility Association Rules [PDF]
In business, managers may use the association information among products to define promotion and competitive strategies. The mining of high-utility association rules (HARs) from high-utility itemsets enables users to select their own weights for rules ...
Thang Mai +4 more
doaj +2 more sources
Mining actionable combined high utility incremental and associated sequential patterns. [PDF]
High utility sequential pattern (HUSP) mining aims to mine actionable patterns with high utilities, widely applied in real-world learning scenarios such as market basket analysis, scenic route planning and click-stream analysis.
Min Shi +3 more
doaj +3 more sources
HUIL-TN & HUI-TN: Mining high utility itemsets based on pattern-growth. [PDF]
In recent years, high utility itemsets (HUIs) mining has been an active research topic in data mining. In this study, we propose two efficient pattern-growth based HUI mining algorithms, called High Utility Itemset based on Length and Tail-Node tree ...
Le Wang, Shui Wang
doaj +2 more sources
Multi-level high utility-itemset hiding. [PDF]
Privacy is as a critical issue in the age of data. Organizations and corporations who publicly share their data always have a major concern that their sensitive information may be leaked or extracted by rivals or attackers using data miners. High-utility
Loan T T Nguyen +3 more
doaj +2 more sources
A high utility itemsets mining algorithm based on co-evolution [PDF]
Metaheuristic high utility itemsets mining algorithms often face challenges such as poor initial population quality, low time efficiency, and itemsets loss due to premature convergence. To address these issues, this study proposes a high utility itemsets
Wenyan Yang +4 more
doaj +2 more sources
A GA-Based Approach to Hide Sensitive High Utility Itemsets [PDF]
A GA-based privacy preserving utility mining method is proposed to find appropriate transactions to be inserted into the database for hiding sensitive high utility itemsets.
Chun-Wei Lin +4 more
doaj +2 more sources
Hiding Sensitive High Utility and Frequent Itemsets Based on Constrained Intersection Lattice
Hiding high utility and frequent itemset is the method used to preserve sensitive knowledge from being revealed by pattern mining process. Its goal is to remove sensitive high utility and frequent itemsets from a database before sharing it for data ...
Vy Huynh Trieu +4 more
doaj +1 more source
A single‐phase algorithm for mining high utility itemsets using compressed tree structures
Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two‐phase tree‐based algorithms transform a database into compressed tree structures and generate candidate patterns
Anup Bhat B, Harish SV, Geetha M
doaj +1 more source
Efficient Algorithm for High Utility Pattern Mining Based on Top-k [PDF]
Getting the high utility pattern through user-specified threshold is inefficient,and the result of mining may not satisfy user’s needs.Therefore,an efficient Top-k pattern mining algorithm based on EFIM algorithm is proposed.The number of high utility ...
ZHAO Linliu,LV Xin,TAO Feifei
doaj +1 more source
FCHUIM: Efficient Frequent and Closed High-Utility Itemsets Mining
Mining a closed high-utility itemset is a prevalent research task in analyzing transaction databases. However, numerous target itemsets are generated in the closed high-utility itemset mining task.
Tianyou Wei +5 more
doaj +1 more source

