A Note on Distance-Weighted k-Nearest Neighbor Rules

DOI10.1109/TSMC.1978.4309958MaRDI QIDQ4162687zbMATH OpenOpenAlexFDO

Authors

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Cited in

(13)

• On kernel difference-weighted \(k\)-nearest neighbor classification
• Effects of domain characteristics on instance-based learning algorithms.
• Application of interval-valued aggregation to optimization problem of \(k\)-NN classifiers for missing values case
• A penalized likelihood based pattern classification algorithm
• Techniques for dealing with incomplete data: a tutorial and survey
• Estimating the Posterior Probabilities Using the K-Nearest Neighbor Rule
• KNN loss and deep KNN
• 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
• A unified weighting framework for evaluating nearest neighbour classification
• Optimal weighted nearest neighbour classifiers
• Possibilistic instance-based learning
• Nearest neighbour group-based classification

This page was built for publication: A Note on Distance-Weighted k-Nearest Neighbor Rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162687)