ScholarGate
アシスタント

手法を比較

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

HDBSCAN×オンライン学習×
分野機械学習機械学習
系統Machine learningMachine learning
提唱年20131958–2000s
提唱者Campello, R. J. G. B.; Moulavi, D.; Sander, J.Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)
種類Hierarchical density-based clusteringLearning paradigm (sequential model update)
原典Campello, R. J. G. B., Moulavi, D., & Sander, J. (2013). Density-Based Clustering Based on Hierarchical Density Estimates. In J. Pei et al. (Eds.), Advances in Knowledge Discovery and Data Mining. PAKDD 2013. Lecture Notes in Computer Science, vol. 7819 (pp. 160–172). Springer, Berlin, Heidelberg. DOI ↗Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗
別名HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*incremental learning, sequential learning, streaming learning, online machine learning
関連36
概要HDBSCAN (Hierarchical Density-Based Spatial Clustering of Applications with Noise) is a density-based clustering algorithm introduced by Campello, Moulavi, and Sander in 2013. It extends DBSCAN by building a full hierarchy of density-based clusters across all density scales and then extracting a stable flat partition, making it robust to datasets where cluster densities vary substantially across regions.Online learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight.
ScholarGateデータセット
  1. v1
  2. 3 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: HDBSCAN · Online Learning. 2026-06-18に以下より取得 https://scholargate.app/ja/compare