ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

DBSCAN×アイソレーションフォレスト×
分野機械学習機械学習
系統Machine learningMachine learning
提唱年19962008
提唱者Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.Liu, F.T., Ting, K.M. & Zhou, Z.-H.
種類Density-based clustering algorithmUnsupervised ensemble (random partitioning trees)
原典Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗Liu, F.T., Ting, K.M. & Zhou, Z.-H. (2008). Isolation Forest. IEEE ICDM, 413–422. DOI ↗
別名DBSCAN Kümeleme, density-based clustering, density-based spatial clusteringIsolation Forest (Aykırı Değer Tespiti), iForest, isolation forest anomaly detection
関連35
概要DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.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手法を比較: DBSCAN · Isolation Forest. 2026-06-18に以下より取得 https://scholargate.app/ja/compare