ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

LightGBM×Arbre de décision×Isolation Forest×Régression logistique×
DomaineApprentissage automatiqueApprentissage automatiqueApprentissage automatiqueStatistiques de recherche
FamilleMachine learningMachine learningMachine learningProcess / pipeline
Année d'origine2017198420081958
Auteur d'origineKe, G. et al. (Microsoft)Breiman, Friedman, Olshen & StoneLiu, F.T., Ting, K.M. & Zhou, Z.-H.David Roxbee Cox
TypeGradient boosting decision tree ensembleRecursive partitioning (if-then rules)Unsupervised ensemble (random partitioning trees)Method
Source fondatriceKe, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q. & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154. link ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗
AliasLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boostingKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detectionlogit model, binomial logistic regression, LR
Apparentées5553
RésuméLightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy.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.Isolation Forest is an unsupervised machine-learning method for anomaly and outlier detection, introduced by Liu, Ting and Zhou in 2008, that isolates anomalies through random partitioning of the data. It works without any labelled anomaly data and scales to high-dimensional datasets.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.
ScholarGateJeu de données
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: LightGBM · Decision Tree · Isolation Forest · Logistic Regression. Consulté le 2026-06-19 sur https://scholargate.app/fr/compare