Network Flows Heuristics for Complementary Cell Suppression: An Empirical Evaluation and Extensions
Inference Control in Statistical Databases, From Theory to Practice
HiTaS: A Heuristic Approach to Cell Suppression in Hierarchical Tables
Inference Control in Statistical Databases, From Theory to Practice
An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Ant Colony Optimization
Ant colony system with communication strategies
Information Sciences—Informatics and Computer Science: An International Journal
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1
Scaling up a hybrid genetic linear programming algorithm for statistical disclosure control
Proceedings of the 13th annual conference on Genetic and evolutionary computation
IEEE Computational Intelligence Magazine
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
In this paper Ant Colony Optimisation (ACO) is applied in the field of Statistical Disclosure Control (SDC) for the first time. It has been applied to a permutation problem found in Cell Suppression. ACO has successfully improved the suppression patterns created to protect published statistical tables but when compared to using the Genetic Algorithm (GA) it has not performed as well. It has however performed well enough to merit further investigation into its use in SDC. In particular research into how to construct a distance matrix for the Cell Suppression Problem (CSP) may both improve the performance of ACO when it is applied in that field and provide further insight into SDC.