A minimum spanning tree equipartition algorithm for microaggregation

DOI10.1080/02664763.2014.993361MaRDI QIDQ5130200zbMATH OpenOpenAlexFDO

Authors Costas Panagiotakis, Georgios Tziritas

Publication date 4 November 2020

Published in Journal of Applied Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02664763.2014.993361

zbMATH Keywords

clusteringdata protectionmicroaggregationminimum spanning treestatistical disclosure control

Mathematics Subject Classification ID

Statistics (62-XX)

Recommendations

• A polynomial-time approximation to optimal multivariate microaggregation
• scientific article; zbMATH DE number 2080028
• A comparative study of microaggregation methods
• EXACT AND APPROXIMATE METHODS FOR DATA DIRECTED MICROAGGREGATION IN ONE OR MORE DIMENSIONS
• Importance partitioning in micro-aggregation

Cites work

• A family of methods for statistical disclosure control
• A local search approximation algorithm for \(k\)-means clustering
• A polynomial-time approximation to optimal multivariate microaggregation
• Elements of statistical disclosure control
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Natural Image Segmentation Based on Tree Equipartition, Bayesian Flooding and Region Merging
• On the uniform edge-partition of a tree
• The equipartition of curves

Describes a project that uses

Uses Software

• TFRP

This page was built for publication: A minimum spanning tree equipartition algorithm for microaggregation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5130200)