Results 31 to 40 of about 2,506 (215)
Memory-efficient frequent-itemset mining
Efficient discovery of frequent itemsets in large datasets is a key component of many data mining tasks. In-core algorithms---which operate entirely in main memory and avoid expensive disk accesses---and in particular the prefix tree-based algorithm FP-growth are generally among the most efficient of the available algorithms.
Benjamin Schlegel +2 more
openaire +3 more sources
Weighted Association Rule Mining using Weighted Support and Significance Framework [PDF]
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to handle weighted association rule mining problems where each item is allowed to
Feng Tao +5 more
core +1 more source
DISCOVERING CONFUSING FREQUENT ITEMSETS
Frequent itemset mining is one of the most important research areas in the field of association rule mining. Exploiting frequent itemsets at different abstraction levels of data will yield valuable knowledge.
Huỳnh Thành Lộc
doaj +1 more source
Efficient Mining of Frequent Itemsets Using Only One Dynamic Prefix Tree
Frequent itemset mining is a fundamental problem in data mining area because frequent itemsets have been extensively used in reasoning, classifying, clustering, and so on.
Jun-Feng Qu +5 more
doaj +1 more source
An Efficient Spark-Based Hybrid Frequent Itemset Mining Algorithm for Big Data
Frequent itemset mining (FIM) is a common approach for discovering hidden frequent patterns from transactional databases used in prediction, association rules, classification, etc. Apriori is an FIM elementary algorithm with iterative nature used to find
Mohamed Reda Al-Bana +2 more
doaj +1 more source
Parallel algorithms for mining of frequent itemsets
In the recent decade companies started collecting of large amount of data. Without a proper analyse, the data are usually useless. The field of analysing the data is called data mining. Unfortunately, the amount of data is quite large: the data do not fit into main memory and the processing time can become quite huge.
openaire +2 more sources
Proof Learning in PVS With Utility Pattern Mining
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 +1 more source
Closed frequent itemset mining with arbitrary side constraints [PDF]
Frequent itemset mining (FIM) is a method for finding regularities in transaction databases. It has several application areas, such as market basket analysis, genome analysis, and drug design. Finding frequent itemsets allows further analysis to focus on
Nightingale, Peter William +7 more
core +1 more source
Generic Itemset Mining Based on Reinforcement Learning
One of the biggest problems in itemset mining is the requirement of developing a data structure or algorithm, every time a user wants to extract a different type of itemsets.
Kazuma Fujioka, Kimiaki Shirahama
doaj +1 more source
The MapReduce Model on Cascading Platform for Frequent Itemset Mining
The implementation of parallel algorithms is very interesting research recently. Parallelism is very suitable to handle large-scale data processing. MapReduce is one of the parallel and distributed programming models.
Nur Rokhman, Amelia Nursanti
doaj +1 more source

