Efficient K-Nearest Neighbor Join Algorithms for High Dimensional Sparse Data

Details Efficient K-Nearest Neighbor Join Algorithms for High Dimensional Sparse Data Efficient K-Nearest Neighbor Join Algorithms for High Dimensional Sparse Data

2010-11-12

arxiv.org/abs/1011.2807v1

Computer Science

Databases

12 pages, This paper has been submitted to PAKDD2011

Scientific paper

The K-Nearest Neighbor (KNN) join is an expensive but important operation in many data mining algorithms. Several recent applications need to perform KNN join for high dimensional sparse data. Unfortunately, all existing KNN join algorithms are designed for low dimensional data. To fulfill this void, we investigate the KNN join problem for high dimensional sparse data. In this paper, we propose three KNN join algorithms: a brute force (BF) algorithm, an inverted index-based(IIB) algorithm and an improved inverted index-based(IIIB) algorithm. Extensive experiments on both synthetic and real-world datasets were conducted to demonstrate the effectiveness of our algorithms for high dimensional sparse data.

Affiliated with

Also associated with

No associations

Rating

Efficient K-Nearest Neighbor Join Algorithms for High Dimensional Sparse Data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient K-Nearest Neighbor Join Algorithms for High Dimensional Sparse Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient K-Nearest Neighbor Join Algorithms for High Dimensional Sparse Data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-203331