On the efficiency of metric recognition algorithms based on k nearest neighbor

Ignatev , N.A., Tursunmurotov, D.Kh., Игнатьев , Н.А., Турсунмуротов, Д.Х.

Ҳисоблаш ва амалий математика муаммолари · 2024-yil

Annotatsiya

The article considers a solution to a two-class recognition problem using metric al gorithms based on k-nearest neighbors. The proposed solution options are: the classical KNN algorithm based on a nonparametric estimate of the probability density function; the Nadaraya-Watson NW method for calculating the regression dependence based on the determined values of the target feature; calculating estimates in the local neighbor hood of objects and dividing their values into non-overlapping intervals with dominance of representatives of one of the two classes. The optimality criteria were the majority rule for KNN, the accuracy of dividing the values of the target feature on the numerical axis for NW and the stability of object estimates within the interval boundaries. When searching for the optimal k values for the listed options, the sliding control method was used. The results of the obtained solutions are demonstrated on the GERMAN sample from the repository based on the descriptions of 1000 objects in a heterogeneous feature space. The efficiency of choosing the k values based on the stability of object estim.

Maqola ma’lumotlari
MualliflarIgnatev , N.A., Tursunmurotov, D.Kh., Игнатьев , Н.А., Турсунмуротов, Д.Х.
JurnalҲисоблаш ва амалий математика муаммолари
Nashr sanasi2024-10-11
Son4
Betlar117-125
TilRus

Kalit so‘zlar

Nadaraya-Watson method, decision rule, objective function, feature stability, Метод Надарая– Ватсона, решающее правило, целевая функция, устойчивость признака

Ilmiy soha

Ҳисоблаш ва амалий математика муаммолари jurnalidan boshqa maqolalar

Ҳисоблаш ва амалий математика муаммолари — barcha maqolalar