Security-control methods for statistical databases: a comparative study
ACM Computing Surveys (CSUR)
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast discovery of association rules
Advances in knowledge discovery and data mining
Associative dynamics in a chaotic neural network
Neural Networks
Associative Clustering for Clusters of Arbitrary Distribution Shapes
Neural Processing Letters
Using a Hash-Based Method with Transaction Trimming for Mining Association Rules
IEEE Transactions on Knowledge and Data Engineering
Practical Data-Oriented Microaggregation for Statistical Disclosure Control
IEEE Transactions on Knowledge and Data Engineering
A Privacy-Enhanced Microaggregation Method
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
On the security of microaggregation with individual ranking: analytical attacks
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Aggregation techniques for statistical confidentiality
Aggregation operators
A Polynomial Algorithm for Optimal Univariate Microaggregation
IEEE Transactions on Knowledge and Data Engineering
Minimum Spanning Tree Partitioning Algorithm for Microaggregation
IEEE Transactions on Knowledge and Data Engineering
Probabilistic Information Loss Measures in Confidentiality Protection of Continuous Microdata
Data Mining and Knowledge Discovery
Ordinal, Continuous and Heterogeneous k-Anonymity Through Microaggregation
Data Mining and Knowledge Discovery
Self-organizing maps as substitutes for k-means clustering
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
On optimizing the k-ward micro-aggregation technique for secure statistical databases
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
A fixed structure learning automaton micro-aggregation technique for secure statistical databases
PSD'06 Proceedings of the 2006 CENEX-SDC project international conference on Privacy in Statistical Databases
Optimal multivariate 2-microaggregation for microdata protection: a 2-approximation
PSD'06 Proceedings of the 2006 CENEX-SDC project international conference on Privacy in Statistical Databases
Self-organizing map for cluster analysis of a breast cancer database
Artificial Intelligence in Medicine
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
An AI-Based Causal Strategy for Securing Statistical Databases Using Micro-aggregation
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Software—Practice & Experience - Focus on Selected PhD Literature Reviews in the Practical Aspects of Software Technology
| Hi-index | 0.00 |
We consider the problem of micro-aggregation in secure statistical databases, by enhancing the primitive Micro-Aggregation Technique (MAT), which incorporates proximity information. The state-of-the-art MAT recursively reduces the size of the data set by excluding points which are farthest from the centroid, and those which are closest to these farthest points, while it ignores the mutual Interaction between the records. In this paper, we argue that inter-record relationships can be quantified in terms of two entities, namely their "Association" and "Interaction". Based on the theoretically sound principles of the neural networks (NN), we believe that the proximity information can be quantified using the mutual Association, and their mutual Interaction can be quantified by invoking transitive-closure like operations on the latter. By repeatedly invoking the inter-record Associations and Interactions, the records are grouped into sizes of cardinality "k", where k is the security parameter in the algorithm. Our experimental results, which are done on artificial data and on the benchmark data sets for real-life data, demonstrate that the newly proposed method is superior to the state-of-the-art by as much as 13%.