An Improved Multi-Parameters Perturbation Privacy Preserving Association Rules Mining Algorithm

2011 ◽  
Vol 130-134 ◽  
pp. 2629-2632
Author(s):  
Jie Liu ◽  
Tian Qi Li ◽  
Jian Pei Zhang
Keyword(s):  
Association Rules ◽  
Original Data ◽  
Privacy Preserving ◽  
Frequent Itemsets ◽  
Data Perturbation ◽  
First Line ◽  
Time Efficiency ◽  
Association Rules Mining ◽  
Original Algorithm ◽  
Parameters Perturbation

Multi-parameters data perturbation method is a kind of original data perturbation methods for privacy preserving association rules mining. However, the time-efficiency of restoring the frequent itemsets in multi-parameters perturbation algorithm is still not high.One method is proposed in this paper to improve the time efficiency of multi-parameters randomized perturbation algorithm according to the characteristics of the model to restore frequent itemsets. The method improves the time efficiency by getting the elements of the first line of the inversed matrix of transformation matrix. Finally, both theoretical analysis and experimental results show that the improved algorithm is more time-efficient and space-efficient than the original algorithm.

DWFIST

2008 ◽  
pp. 3142-3163
Author(s):  
Rodrigo Salvador Monteiro ◽  
Geraldo Zimbrao ◽  
Holger Schwarz ◽  
Bernhard Mitschang ◽  
Jano Moreira de Souza
Keyword(s):  
Data Warehouse ◽  
Association Rules ◽  
Original Data ◽  
Frequent Itemsets ◽  
Upper And Lower Bounds ◽  
Sufficient Information ◽  
Interestingness Measures ◽  
The Core ◽  
Pattern Retrieval ◽  
Frequency Counts

This chapter presents the core of the DWFIST approach, which is concerned with supporting the analysis and exploration of frequent itemsets and derived patterns, e.g., association rules in transactional datasets. The goal of this new approach is to provide: (1) flexible pattern-retrieval capabilities without requiring the original data during the analysis phase; and (2) a standard modeling for data warehouses of frequent itemsets, allowing an easier development and reuse of tools for analysis and exploration of itemset-based patterns. Instead of storing the original datasets, our approach organizes frequent itemsets holding on different partitions of the original transactions in a data warehouse that retains sufficient information for future analysis. A running example for mining calendar-based patterns on data streams is presented. Staging area tasks are discussed and standard conceptual and logical schemas are presented. Properties of this standard modeling allow retrieval of frequent itemsets holding on any set of partitions, along with upper and lower bounds on their frequency counts. Furthermore, precision guarantees for some interestingness measures of association rules are provided as well.

Association Rules Mining Based on Adaptive Fuzzy Clustering Algorithm

2014 ◽  
Vol 998-999 ◽  
pp. 842-845 ◽  
Author(s):  
Jia Mei Guo ◽  
Yin Xiang Pei
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Clustering Algorithm ◽  
Original Data ◽  
Data Set ◽  
Association Rules Mining ◽  
Fuzzy Association Rules ◽  
Redundant Data ◽  
Fuzzy Partitions ◽  
Rules Extraction

Association rules extraction is one of the important goals of data mining and analyzing. Aiming at the problem that information lose caused by crisp partition of numerical attribute , in this article, we put forward a fuzzy association rules mining method based on fuzzy logic. First, we use c-means clustering to generate fuzzy partitions and eliminate redundant data, and then map the original data set into fuzzy interval, in the end, we extract the fuzzy association rules on the fuzzy data set as providing the basis for proper decision-making. Results show that this method can effectively improve the efficiency of data mining and the semantic visualization and credibility of association rules.

Sign in / Sign up

Export Citation Format

Share Document