Bandingkan kaedah

	Pohon Keputusan	Mesin Vektor Sokongan (Klasifikasi)
Bidang	Pembelajaran Mesin	Pembelajaran Mesin
Keluarga	Machine learning	Machine learning
Tahun asal	1984	1995
Pengasas	Breiman, Friedman, Olshen & Stone	Cortes, C. & Vapnik, V.
Jenis	Recursive partitioning (if-then rules)	Maximum-margin classifier (kernel method)
Sumber perintis	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297.
Alias	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier
Berkaitan	5	5
Ringkasan	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.	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.