Fast object partitioning using Stochastic learning automata
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
Deterministic Learning Automata Solutions to the Equipartitioning Problem
IEEE Transactions on Computers
Learning automata: an introduction
Learning automata: an introduction
Security-control methods for statistical databases: a comparative study
ACM Computing Surveys (CSUR)
Improvements to an Algorithm for Equipartitioning
IEEE Transactions on Computers
Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd 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)
An Introduction to Database Systems
An Introduction to Database Systems
Database Security and Integrity
Database Security and Integrity
Practical Data-Oriented Microaggregation for Statistical Disclosure Control
IEEE Transactions on Knowledge and Data Engineering
Learning Approaches for Detecting and Tracking News Events
IEEE Intelligent Systems
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
A Fixed-Structure Learning Automaton Solution to the Stochastic Static Mapping Problem
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 18 - Volume 19
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
A 2^d-Tree-Based Blocking Method for Microaggregating Very Large Data Sets
ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security
Efficient multivariate data-oriented microaggregation
The VLDB Journal — The International Journal on Very Large Data Bases
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
String taxonomy using learning automata
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Dynamic algorithms for the shortest path routing problem: learning automata-based solutions
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Cellular learning automata with multiple learning automata in each cell and its applications
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
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 microaggregation problem (MAP) that involves partitioning a set of individual records in a microdata file into a number of mutually exclusive and exhaustive groups. This problem, which seeks for the best partition of the microdata file, is known to be NP-hard and has been tackled using many heuristic solutions. In this paper, we present the first reported fixed-structure-stochastic-automata-based solution to this problem. The newly proposed method leads to a lower value of the information loss (IL), obtains a better tradeoff between the IL and the disclosure risk (DR) when compared with state-of-the-art methods, and leads to a superior value of the scoring index, which is a criterion involving a combination of the IL and the DR. The scheme has been implemented, tested, and evaluated for different real-life and simulated data sets. The results clearly demonstrate the applicability of learning automata to the MAP and its ability to yield a solution that obtains the best tradeoff between IL and DR when compared with the state of the art.