A K-Anonymous Full Domain Generalization Algorithm Based on Heap Sort.
Xuyang ZhouMeikang QiuPublished in: SmartCom (2018)
Keyphrases
- learning algorithm
- computational cost
- times faster
- theoretical analysis
- experimental evaluation
- single pass
- optimal solution
- np hard
- worst case
- matching algorithm
- segmentation algorithm
- search space
- expectation maximization
- neural network
- improved algorithm
- selection algorithm
- convergence rate
- memory requirements
- objective function
- linear programming
- domain specific
- computational complexity
- dynamic programming
- cost function
- k means
- particle swarm optimization
- detection algorithm
- ant colony optimization
- tree structure
- face recognition
- significant improvement