Classification using distance nearest neighbours

Details Classification using distance nearest neighbours Classification using distance nearest neighbours

2010-04-22

arxiv.org/abs/1004.3925v2

Statistics

Computation

12 pages, 2 figures. To appear in Statistics and Computing

Scientific paper

10.1007/s11222-010-9179-y

This paper proposes a new probabilistic classification algorithm using a Markov random field approach. The joint distribution of class labels is explicitly modelled using the distances between feature vectors. Intuitively, a class label should depend more on class labels which are closer in the feature space, than those which are further away. Our approach builds on previous work by Holmes and Adams (2002, 2003) and Cucala et al. (2008). Our work shares many of the advantages of these approaches in providing a probabilistic basis for the statistical inference. In comparison to previous work, we present a more efficient computational algorithm to overcome the intractability of the Markov random field model. The results of our algorithm are encouraging in comparison to the k-nearest neighbour algorithm.

Affiliated with

Also associated with

No associations

Rating

Classification using distance nearest neighbours 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 Classification using distance nearest neighbours, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classification using distance nearest neighbours will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-459565