Evidential K-NN classification with enhanced performance via optimizing a class of parametric conjunctive t-rules

作者:

Highlights:

摘要

Dempster's rule of combination is commonly used to pool distinct/independent bodies of evidence in the evidential k-nearest neighbor (K-NN) classifier, which sometimes limits the performance of this classifier. To solve this problem, we propose a class of parametric conjunctive combination rules based on a new family of triangular norms with selectable functions and tunable parameters. We show that the performance of the evidential K-NN classifier can be enhanced via this class of so-called parametric conjunctive t-rules when appropriate functions and parameters are selected. Numerical simulations validate our conclusions.

论文关键词:Evidence theory,Dempster-shafer theory,Belief functions,Combination rules,Pattern recognition,Supervised learning

论文评审过程:Received 2 July 2017, Revised 4 September 2017, Accepted 15 November 2017, Available online 17 November 2017, Version of Record 17 January 2018.

论文官网地址:https://doi.org/10.1016/j.knosys.2017.11.020