I/O Efficient Algorithm for c-Approximate Furthest Neighbor Search in High-Dimensional Space.
Wanqi LiuHanchen WangYing ZhangLu QinWenjie ZhangPublished in: DASFAA (3) (2020)
Keyphrases
- experimental evaluation
- computational complexity
- np hard
- segmentation algorithm
- times faster
- cost function
- preprocessing
- high accuracy
- k means
- convex hull
- optimal solution
- detection algorithm
- computationally efficient
- improved algorithm
- simulated annealing
- selection algorithm
- classification algorithm
- optimization algorithm
- theoretical analysis
- expectation maximization
- worst case
- significant improvement
- objective function
- feature selection
- tree structure
- computational cost
- recognition algorithm
- data structure