The Parameterized Complexity of Network Microaggregation
DOI:
https://doi.org/10.1609/aaai.v37i5.25771Keywords:
KRR: Computational Complexity of Reasoning, CSO: Other Foundations of Constraint Satisfaction & Optimization, DMKM: Graph Mining, Social Network Analysis & Community Mining, GTEP: Other Foundations of Game Theory & Economic Paradigms, ML: ClusteringAbstract
Microaggregation is a classical statistical disclosure control technique which requires the input data to be partitioned into clusters while adhering to specified size constraints. We provide novel exact algorithms and lower bounds for the task of microaggregating a given network while considering both unrestricted and connected clusterings, and analyze these from the perspective of the parameterized complexity paradigm. Altogether, our results assemble a complete complexity-theoretic picture for the network microaggregation problem with respect to the most natural parameterizations of the problem, including input-specified parameters capturing the size and homogeneity of the clusters as well as the treewidth and vertex cover number of the network.Downloads
Published
2023-06-26
How to Cite
Blažej, V., Ganian, R., Knop, D., Pokorný, J., Schierreich, Šimon, & Simonov, K. (2023). The Parameterized Complexity of Network Microaggregation. Proceedings of the AAAI Conference on Artificial Intelligence, 37(5), 6262-6270. https://doi.org/10.1609/aaai.v37i5.25771
Issue
Section
AAAI Technical Track on Knowledge Representation and Reasoning