On Differentially Private Frequent Itemset Mining. [PDF]
VLDB J, 2012 We consider differentially private frequent itemset mining. We begin by exploring the theoretical difficulty of simultaneously providing good utility and good privacy in this task. While our analysis proves that in general this is very difficult, it leaves a glimmer of hope in that our proof of difficulty relies on the existence of long ...
Zeng C, Naughton JF, Cai JY.
europepmc +5 more sources
Personalized Privacy-Preserving Frequent Itemset Mining Using Randomized Response [PDF]
The Scientific World Journal, 2014 Frequent itemset mining is the important first step of association rule mining, which discovers interesting patterns from the massive data. There are increasing concerns about the privacy problem in the frequent itemset mining.
Chongjing Sun +3 more
doaj +2 more sources
Inverted Index Automata Frequent Itemset Mining for Large Dataset Frequent Itemset Mining
IEEE AccessFrequent itemset mining (FIM) faces significant challenges with the expansion of large-scale datasets. Traditional algorithms such as Apriori, FP-Growth, and Eclat suffer from poor scalability and low efficiency when applied to modern datasets ...
Xin Dai +3 more
doaj +2 more sources
A primer to frequent itemset mining for bioinformatics. [PDF]
Brief Bioinform, 2015 Over the past two decades, pattern mining techniques have become an integral part of many bioinformatics solutions. Frequent itemset mining is a popular group of pattern mining techniques designed to identify elements that frequently co-occur. An archetypical example is the identification of products that often end up together in the same shopping ...
Naulaerts S +6 more
europepmc +7 more sources
A pattern-growth approach for mining maximal fault-tolerant frequent itemsets [PDF]
Scientific ReportsMining fault-tolerant (FT) frequent itemsets in noisy datasets is more challenging than conventional frequent itemset mining due to the high cost of evaluating fault-tolerance conditions.
Shariq Bashir
doaj +2 more sources
Multi-Objective Optimization for High-Dimensional Maximal Frequent Itemset Mining
Applied Sciences, 2021 The solution space of a frequent itemset generally presents exponential explosive growth because of the high-dimensional attributes of big data. However, the premise of the big data association rule analysis is to mine the frequent itemset in high ...
Yalong Zhang +4 more
doaj +3 more sources
Quick mining in dense data: applying probabilistic support prediction in depth-first order [PDF]
PeerJ Computer ScienceFrequent itemset mining (FIM) is a major component in association rule mining, significantly influencing its performance. FIM is a computationally intensive nondeterministic polynomial time (NP)-hard problem.
Muhammad Sadeequllah +3 more
doaj +3 more sources
Research on association analysis between electricity consumption behaviors and weather factors based on mapreduce [PDF]
Scientific ReportsThe change of weather factors will lead to great changes in users’ electricity consumption behaviors. In order to discover the associations between users’ electricity consumption behavior and weather factors, and meet the needs of efficient mining of ...
Yuehua Yang, Yun Wu
doaj +2 more sources
Frequent Itemset Mining of High-Dimensional Data Based on MapReduce [PDF]
Jisuanji gongcheng, 2022 In the mining process of large-scale high-dimensional data, the traditional data mining algorithm has some problem, such as low accuracy of data feature capture, unbalanced node load, frequent data interaction, and low compactness of frequent itemset ...
ZHAO Xincan, ZHU Yun, MAO Yimin
doaj +1 more source
A Parallel Apriori Algorithm and FP- Growth Based on SPARK [PDF]
ITM Web of Conferences, 2021 Frequent Itemset Mining is an important data mining task in real-world applications. Distributed parallel Apriori and FP-Growth algorithm is the most important algorithm that works on data mining for finding the frequent itemsets.
Gupta Priyanka, Sawant Vinaya
doaj +1 more source