Skip to Main content Skip to Navigation
Conference papers

K-Nearest Neighbour Classification for Interval-Valued Data

Abstract : This paper studies the problem of providing predictions with a K-nn approach when data have partial features given in the form of intervals. To do so, we adopt an optimistic approach to replace the ill-known values, that requires to compute sets of possible and necessary neighbours of an instance. We provide an easy way to compute such sets, as well as the decision rule that follows from them. Our approach is then compared to a simple imputation method in different scenarios, in order to identify those ones where it is advantageous.
Document type :
Conference papers
Complete list of metadata
Contributor : Laboratoire Heudiasyc Connect in order to contact the contributor
Submitted on : Monday, June 21, 2021 - 9:15:32 PM
Last modification on : Tuesday, November 16, 2021 - 4:31:14 AM
Long-term archiving on: : Wednesday, September 22, 2021 - 7:09:57 PM


Files produced by the author(s)


  • HAL Id : hal-01680870, version 1



Vu-Linh Nguyen, Sébastien Destercke, Marie-Hélène Masson. K-Nearest Neighbour Classification for Interval-Valued Data. 11th International Conference on Scalable Uncertainty Management (SUM 2017), Oct 2017, Granada, Spain. pp.93-106. ⟨hal-01680870⟩



Les métriques sont temporairement indisponibles