Results 1 to 10 of about 9,424 (197)

Personalized Privacy-Preserving Frequent Itemset Mining Using Randomized Response [PDF]

open access: yesThe 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

TKFIM: Top-K frequent itemset mining technique based on equivalence classes [PDF]

open access: yesPeerJ Computer Science, 2021
Frequently used items mining is a significant subject of data mining studies. In the last ten years, due to innovative development, the quantity of data has grown exponentially.
Saood Iqbal   +5 more
doaj   +3 more sources

On Differentially Private Frequent Itemset Mining. [PDF]

open access: yesVLDB 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   +4 more sources

Quick mining in dense data: applying probabilistic support prediction in depth-first order [PDF]

open access: yesPeerJ Computer Science
Frequent 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

DISCOVERING CONFUSING FREQUENT ITEMSETS

open access: yesTạp chí Khoa học Đại học Đà Lạt, 2018
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   +2 more sources

Inverted Index Automata Frequent Itemset Mining for Large Dataset Frequent Itemset Mining

open access: yesIEEE Access
Frequent 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

DeBi: Discovering Differentially Expressed Biclusters using a Frequent Itemset Approach [PDF]

open access: yesAlgorithms for Molecular Biology, 2011
Background The analysis of massive high throughput data via clustering algorithms is very important for elucidating gene functions in biological systems. However, traditional clustering methods have several drawbacks.
Vingron Martin, Serin Akdes
doaj   +2 more sources

Frequent Itemset Mining of High-Dimensional Data Based on MapReduce [PDF]

open access: yesJisuanji 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]

open access: yesITM 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

IMPLEMENTATION OF DYNAMIC AND FAST MINING ALGORITHMS ON INCREMENTAL DATASETS TO DISCOVER QUALITATIVE RULES [PDF]

open access: yesApplied Computer Science, 2021
Association Rule Mining is an important field in knowledge mining that allows the rules of association needed for decision making. Frequent mining of objects presents a difficulty to huge datasets.
Pannangi Naresh, R. Suguna
doaj   +2 more sources

Home - About - Disclaimer - Privacy