ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

LightGBM×Isolation Forest×
분야머신러닝머신러닝
계열Machine learningMachine learning
기원 연도20172008
창시자Ke, G. et al. (Microsoft)Liu, F.T., Ting, K.M. & Zhou, Z.-H.
유형Gradient boosting decision tree ensembleUnsupervised ensemble (random partitioning trees)
원전Ke, 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 ↗Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗
별칭LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boostingIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
관련55
요약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.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.
ScholarGate데이터셋
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: LightGBM · Isolation Forest. 2026-06-17에 다음에서 검색함: https://scholargate.app/ko/compare