Privacy-preserving association rule mining via multi-key fully homomorphic encryption

Jia, Peiheng; Zhang, Jie; Zhao, Bowen; Li, Hongtao; Liu, Ximeng

doi:10.1016/j.jksuci.2023.01.007

Cited by 1 publication

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Association Rule Mining (ARM) discovers meaningful relationships among the items that appear either frequently or rarely in a dataset [1]. If the occurrence of the itemset satisfies the user-defined minimum support threshold, then it is considered as frequent itemset otherwise, it is considered rare [2]. Frequent Itemset Mining (FIM) and Rare Itemset Mining (RIM) are first step in discovering strong association rules from large volumes of data where FIM involves identifying items that occur together frequently and RIM involves identifying items that occur infrequently in a dataset [3,4].…”

Section: Introductionmentioning

confidence: 99%

WBIN-Tree: A Single Scan Based Complete, Compact and Abstract Tree for Discovering Rare and Frequent Itemset Using Parallel Technique

Rai,

Kumar,

Shetty

et al. 2024

IEEE Access

View full text Add to dashboard Cite

Data analytics is an integral part of strategic decision making in various fields but not limited to business, education, and healthcare systems. Existing research works focus on the discovery of itemsets with rare antecedents and consequent or frequent antecedents and consequent. Analysis of association among itemsets with rare antecedents and frequent consequent is equally important to gain valuable insights before making crucial decisions. Mining these itemsets from large datasets is time and resource intensive process. Expedition in the process of mining aids in quick decision making and hence, the entire dataset needs to be stored in the RAM. In this paper, a novel Weighted Binary Count Tree (WBIN-Tree) is proposed and implemented in CUDA to exploit the power of GPU and discover itemsets with rare antecedent and frequent consequent using parallel approach. WBIN-Tree stores the entire dataset in an abstract, complete, and compact form in the RAM using single database scan. WBIN-Tree is compared with existing sequential and parallel algorithms by varying the data size and dimension. The performance evaluation of WBIN-Tree showed promising results, proving to be the most time and space efficient algorithm to store the entire large dataset in the RAM. However, based on the size of the GPU, the performance drops when executed on datasets with large dimensions which could be handled by processing the attributes in batches. Additionally, a case study is included to understand the importance of mining association rules with rare antecedent and frequent consequent by executing the algorithm on breast cancer dataset.

show abstract