Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Bayesiansk kunskapsgrafanalys× | Bayesian Exponential Random Graph Model× | |
|---|---|---|
| Ämnesområde | Nätverksanalys | Nätverksanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2010s | 2011 |
| Upphovsperson≠ | Nickel, M.; Murphy, K.; Tresp, V.; Gabrilovich, E. (and related Bayesian KG literature, 2010s) | Caimo, A., & Friel, N. |
| Typ≠ | Probabilistic graph inference | Bayesian statistical model for networks |
| Ursprungskälla≠ | Chen, M., Zhang, W., Zhang, W., Chen, Q., & Chen, H. (2020). Meta Relational Learning for Few-Shot Link Prediction in Knowledge Graphs. Proceedings of EMNLP 2020. link ↗ | Caimo, A., & Friel, N. (2011). Bayesian inference for exponential random graph models. Social Networks, 33(1), 41–55. DOI ↗ |
| Alias | Bayesian KG analysis, probabilistic knowledge graph reasoning, Bayesian knowledge base completion, BKGA | Bayesian ERGM, Bayesian p-star model, Bayesian p* model, BERGM |
| Närliggande≠ | 5 | 4 |
| Sammanfattning≠ | Bayesian knowledge graph analysis applies probabilistic Bayesian inference to knowledge graphs — structured representations of entities and their relations — to reason under uncertainty, complete missing links, and quantify confidence in inferred facts. It treats unknown graph edges as random variables and updates beliefs about them given observed relational evidence, making it especially suited to incomplete or noisy knowledge bases. | The Bayesian Exponential Random Graph Model (Bayesian ERGM or BERGM) extends the classical ERGM framework by placing prior distributions over the model parameters and using Markov chain Monte Carlo methods to obtain full posterior distributions. Introduced by Caimo and Friel (2011), it allows researchers to quantify parameter uncertainty and incorporate prior knowledge when modelling the structural features of social and other complex networks. |
| ScholarGateDatamängd ↗ |
|
|