An approximation algorithm for high-dimensional table compression on balanced K-partite graph.
Guangfeng LiJian SunZhiren SunDonglei DuXiaoyan ZhangPublished in: Comput. Electr. Eng. (2024)
Keyphrases
- k means
- high dimensional
- computational cost
- np hard
- significant improvement
- approximation ratio
- matching algorithm
- linear programming
- high accuracy
- worst case
- experimental evaluation
- search space
- cost function
- optimal solution
- objective function
- recognition algorithm
- segmentation algorithm
- optimization algorithm
- detection algorithm
- database
- noisy data
- error bounds
- learning algorithm
- theoretical analysis
- particle swarm optimization
- image segmentation
- similarity measure
- preprocessing