方法对比

	K-Nearest Neighbors	支持向量机（分类）
领域	机器学习	机器学习
方法族	Machine learning	Machine learning
起源年份	1967	1995
提出者	Cover, T.M. & Hart, P.E.	Cortes, C. & Vapnik, V.
类型	Instance-based (non-parametric) learning	Maximum-margin classifier (kernel method)
开创性文献	Cover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27.	Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297.
别名	KNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learning	Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier
相关	5	5
摘要	K-Nearest Neighbors (KNN), formalized by Cover and Hart in 1967, is a non-parametric, instance-based method that classifies or predicts a new observation by looking at the k closest examples in the training data. For classification it takes a majority vote among those neighbors; for regression it averages their values.	The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data.