A Note on Distance-Weighted k-Nearest Neighbor Rules
From MaRDI portal
Publication:4162687
DOI10.1109/TSMC.1978.4309958zbMath0383.68067OpenAlexW3105578466MaRDI QIDQ4162687
No author found.
Publication date: 1978
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsmc.1978.4309958
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)
Related Items (12)
Effects of domain characteristics on instance-based learning algorithms. ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Моделирование графов ближайших соседей для оценки вероятности независимости выборочных данных;Modeling of nearest neighbor graphs to estimate the probability of independence of data ⋮ Application of interval-valued aggregation to optimization problem of \(k\)-NN classifiers for missing values case ⋮ Estimating the Posterior Probabilities Using the K-Nearest Neighbor Rule ⋮ A penalized likelihood based pattern classification algorithm ⋮ Nearest neighbour group-based classification ⋮ On kernel difference-weighted \(k\)-nearest neighbor classification ⋮ Optimal weighted nearest neighbour classifiers ⋮ Techniques for dealing with incomplete data: a tutorial and survey ⋮ KNN Loss and Deep KNN ⋮ Possibilistic instance-based learning
This page was built for publication: A Note on Distance-Weighted k-Nearest Neighbor Rules
