Algorithm for k-anonymity based on ball-tree and projection area density partition.
Cheng ChenXiaoli LiuLinfeng WeiLongxin LinXiaofeng WuPublished in: ICCSE (2019)
Keyphrases
- tree structure
- detection algorithm
- computational complexity
- computational cost
- learning algorithm
- minimum spanning tree
- cost function
- segmentation algorithm
- matching algorithm
- objective function
- search space
- optimization algorithm
- dynamic programming
- density function
- expectation maximization
- input data
- worst case
- np hard
- preprocessing
- similarity measure
- information loss
- data mining
- unordered trees
- graph structure
- simulated annealing
- evolutionary algorithm
- genetic algorithm