![](/assets/images/picto-drapeau-france-3a76576a5d60a512053b4612ab58dae5.png)
4. Distance- and neighborhood-based methods
Here, we examine a first family of intuitive, high-performance methods based on the notion of distance between shapes. We successively study a classification method and a partitioning method, both based on this idea.
Among the multitude of RDF methods, the nearest-neighbor classification method and its immediate extension, the K-nearest-neighbor method, hold a special place. They are both natural and justified by certain theoretical results. We first describe the principle behind them, and then describe some of their properties.
Finally, we take a look at the partitioning framework and describe a common partitioning method based on the notion of distance, the K-means algorithm.
4.1 Classification by nearest neighbor
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference
This article is included in
Software technologies and System architectures
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Distance- and neighborhood-based methods
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference