ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

الگوریتم‌های کشف علّی (PC, FCI, LiNGAM)×دی‌بی‌اسکن×شبکه توجه گراف×
حوزهاستنتاج علّییادگیری ماشینیادگیری عمیق
خانوادهRegression modelMachine learningMachine learning
سال پیدایش200019962018
پدیدآورSpirtes, Glymour & Scheines (PC/FCI); Shimizu et al. (LiNGAM)Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.Veličković, P. et al.
نوعCausal structure learningDensity-based clustering algorithmGraph neural network (attention-based)
منبع بنیادینSpirtes, P., Glymour, C., & Scheines, R. (2000). Causation, Prediction, and Search (2nd ed.). MIT Press. ISBN: 978-0262194402Ester, 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 ↗Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗
نام‌های دیگرPC algorithm, FCI algorithm, LiNGAM, causal structure learningDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringGraf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural network
مرتبط534
خلاصهCausal discovery is a family of algorithms that automatically learn a directed acyclic graph (DAG) describing causal structure directly from observational data. The constraint-based PC and FCI algorithms were developed by Spirtes, Glymour and Scheines (2000), while the LiNGAM model of Shimizu et al. (2006) exploits linear non-Gaussian structure to orient edges.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.The Graph Attention Network (GAT), introduced by Veličković and colleagues in 2018, is a graph neural network variant that learns how much importance to assign to each neighbouring node through a self-attention mechanism. On heterogeneous neighbourhoods and relational classification it produces results superior to graph convolutional networks (GCN).
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Causal Discovery Algorithms · DBSCAN · Graph Attention Network. بازیابی‌شده در 2026-06-18 از https://scholargate.app/fa/compare