Results 11 to 20 of about 530 (210)
Approximate Parallel High Utility Itemset Mining [PDF]
High utility itemset mining discovers itemsets whose utility is above a given threshold, where the utility measures the importance of an itemset. It overcomes the limitation of frequent pattern mining, which uses frequency as its quality measure. To speed up the performance for mining high utility itemsets, many algorithms have been proposed which ...
Yan Chen 0021, Aijun An
openaire +2 more sources
A Parallel High-Utility Itemset Mining Algorithm Based on Hadoop [PDF]
High-utility itemset mining (HUIM) can consider not only the profit factor but also the profitable factor, which is an essential task in data mining. However, most HUIM algorithms are mainly developed on a single machine, which is inefficient for big ...
Zaihe Cheng +3 more
doaj +2 more sources
Proof Learning in PVS With Utility Pattern Mining [PDF]
Interactive theorem provers (ITPs) are software tools that allow human users to write and verify formal proofs. In recent years, an emerging research area in ITPs is proof mining, which consists of identifying interesting proof patterns that can be used ...
M. Saqib Nawaz +2 more
doaj +2 more sources
Mining Locally Trending High Utility Itemsets [PDF]
High utility itemset mining consists of identifying all the sets of items that appear together and yield a high profit in a customer transaction database. Recently, this problem was extended to discover trending high utility itemsets (itemsets that yield an increasing or decreasing profit over time).
Fournier-Viger P +3 more
europepmc +3 more sources
An Efficient Approach for Mining High Average-Utility Itemsets in Incremental Database
Traditional high-utility itemset (HUI) mining methods tend to overestimate utility for long itemsets, leading to biased results. High average-utility itemset (HAUI) mining addresses this problem by normalizing utility with itemset length.
Ye-In Chang +2 more
doaj +2 more sources
This research proposes the optimization of the Frequent Closed High-Utility Itemset Mining (FCHUIM) algorithm for retail transaction datasets using heuristic-based pruning techniques, Observed Support Ratio (OSR), Observed Weighted Lift (OWL), and ...
Kinana Syah Sulanjari, Chastine Fatichah
doaj +3 more sources
Top ‘N’ Variant Random Forest Model for High Utility Itemsets Recommendation [PDF]
High-utility based itemset mining is the advancement of recurrent pattern mining that discovers occurrence of frequent transactions from a huge database.
Pazhaniraja N +3 more
doaj +1 more source
TKU-PSO: An Efficient Particle Swarm Optimization Model for Top-K High-Utility Itemset Mining. [PDF]
Top-k high-utility itemset mining (top- HUIM) is a data mining procedure used to identify the most valuable patterns within transactional data. Although many algorithms are proposed for this purpose, they require substantial execution times when the ...
Simen Carstensen, Jerry Chun Wei Lin
doaj +5 more sources
FHUQI-Miner: Fast high utility quantitative itemset mining [PDF]
High utility itemset mining is a popular pattern mining task, which aims at revealing all sets of items that yield a high profit in a transaction database. Although this task is useful to understand customer behavior, an important limitation is that high
Nouioua, Mourad +4 more
core +2 more sources
High-utility Itemsets Mining Algorithm Based on Double Binary Particle Swarm Optimization [PDF]
High-utility itemset mining algorithm is an important part of association analysis.By improving the basic binary particle swarm optimization algorithm,a Double Binary Particle Swarm Optimization(DBPSO) algorithm is proposed.The minimum utility threshold ...
JIN Xiaole,LIU Xiabi,MA Xiao
doaj +1 more source

