ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Mașina cu Vectori Suport (Clasificare)×K-Nearest Neighbors×Regresia Logistică×Naive Bayes×
DomeniuÎnvățare automatăÎnvățare automatăStatistică pentru cercetareÎnvățare automată
FamilieMachine learningMachine learningProcess / pipelineMachine learning
Anul apariției1995196719581997
Autorul originalCortes, C. & Vapnik, V.Cover, T.M. & Hart, P.E.David Roxbee CoxMitchell, T. M. (textbook treatment)
TipMaximum-margin classifier (kernel method)Instance-based (non-parametric) learningMethodProbabilistic classifier (Bayes' theorem with conditional independence)
Sursa seminalăCortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗Cover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072
Denumiri alternativeDestek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifierKNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learninglogit model, binomial logistic regression, LRNaive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes
Înrudite5534
RezumatThe 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.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.Logistic regression is a statistical method for modeling the probability of a binary outcome (disease present/absent, success/failure) as a function of continuous and categorical predictors. Developed by David Roxbee Cox (1958), it solves the problem of predicting categorical outcomes by applying a logistic transformation to constrain predictions to the [0,1] probability interval, enabling accurate risk stratification, diagnostic prediction, and causal inference in epidemiology, medicine, and social science.Naive Bayes is a fast probabilistic classifier that applies Bayes' theorem while assuming that the features are conditionally independent given the class — a method given its standard machine-learning treatment in Tom Mitchell's 1997 textbook Machine Learning. Despite this simplifying ('naive') assumption, it is quick to train and often surprisingly accurate.
ScholarGateSet de date
  1. v1
  2. 1 Surse
  3. PUBLISHED
  1. v1
  2. 1 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 1 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Support Vector Machine · K-Nearest Neighbors · Logistic Regression · Naive Bayes. Preluat la 2026-06-19 de pe https://scholargate.app/ro/compare