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
An introduction to database systems (7th ed.)
An introduction to database systems (7th ed.)
Compromising statistical databases responding to queries about means
ACM Transactions on Database Systems (TODS)
Secure statistical databases with random sample queries
ACM Transactions on Database Systems (TODS)
Associative Clustering for Clusters of Arbitrary Distribution Shapes
Neural Processing Letters
Database Security and Integrity
Database Security and Integrity
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
Sensitive Micro Data Protection Using Latin Hypercube Sampling Technique
Inference Control in Statistical Databases, From Theory to Practice
Disclosure Risk Assessment in Perturbative Microdata Protection
Inference Control in Statistical Databases, From Theory to Practice
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
Efficient multivariate data-oriented microaggregation
The VLDB Journal — The International Journal on Very Large Data Bases
Novel micro-aggregation techniques for secure statistical databases
Novel micro-aggregation techniques for secure statistical databases
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Self-organizing maps as substitutes for k-means clustering
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
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
Software—Practice & Experience - Focus on Selected PhD Literature Reviews in the Practical Aspects of Software Technology
Hi-index | 0.00 |
This paper presents a possibly pioneering endeavor to tackle the Microaggregation Techniques (MATs) in secure statistical databases by resorting to the principles of associative neural networks (NNs). The prior art has improved the available solutions to the MAT by incorporating proximity information, and this approach is done by recursively reducing the size of the data set by excluding points that are farthest from the centroid and points that are closest to these farthest points. Thus, although the method is extremely effective, arguably, it uses only the proximity information while ignoring the mutual interaction between the records. In this paper, we argue that interrecord relationships can be quantified in terms of the following two entities: 1) their "association" and 2) their "interaction." This case means that records that are not necessarily close to each other may still be "grouped," because their mutual interaction, which is quantified by invoking transitive-closure-like operations on the latter entity, could be significant, as suggested by the theoretically sound principles of NNs. By repeatedly invoking the interrecord 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 benchmark real-life data sets, demonstrate that the newly proposed method is superior to the state of the art not only based on the Information Loss (IL) perspective but also when it concerns a criterion that involves a combination of the IL and the Disclosure Risk (DR).