ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

K-Närmaste Grannar×Beslutsträd×Naiv Bayes×
ÄmnesområdeMaskininlärningMaskininlärningMaskininlärning
FamiljMachine learningMachine learningMachine learning
Ursprungsår196719841997
UpphovspersonCover, T.M. & Hart, P.E.Breiman, Friedman, Olshen & StoneMitchell, T. M. (textbook treatment)
TypInstance-based (non-parametric) learningRecursive partitioning (if-then rules)Probabilistic classifier (Bayes' theorem with conditional independence)
UrsprungskällaCover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072
AliasKNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learningKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeNaive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes
Närliggande554
SammanfattningK-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.A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.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.
ScholarGateDatamängd
  1. v1
  2. 1 Källor
  3. PUBLISHED
  1. v1
  2. 1 Källor
  3. PUBLISHED
  1. v1
  2. 1 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: K-Nearest Neighbors · Decision Tree · Naive Bayes. Hämtad 2026-06-19 från https://scholargate.app/sv/compare