Jämför metoder

	Viktad grafanalys av kunskapsgrafer	Analys av viktad nätverksdiffusion
Ämnesområde	Nätverksanalys	Nätverksanalys
Familj	Machine learning	Machine learning
Ursprungsår	2010s–present	2004
Upphovsperson	Hogan et al. and the broader knowledge graph community	Barrat, A.; Newman, M. E. J.
Typ	Network analysis variant	Network diffusion model
Ursprungskälla	Hogan, A., Blomqvist, E., Cochez, M., d'Amato, C., Melo, G., Gutierrez, C., Kirrane, S., Gayo, J. E. L., Navigli, R., Neumaier, S., Ngomo, A. N., Polleres, A., Rashid, S. M., Rula, A., Schmelzeisen, L., Sequeda, J., Staab, S., & Zimmermann, A. (2021). Knowledge Graphs. ACM Computing Surveys, 54(4), 1–37.	Barrat, A., Barthelemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752.
Alias	WKGA, weighted KG analysis, confidence-weighted knowledge graph, weighted semantic network analysis	WNDA, weighted diffusion process, edge-weighted spreading analysis, weighted information diffusion
Närliggande	6	6
Sammanfattning	Weighted Knowledge Graph Analysis extends standard knowledge graph methods by assigning numerical weights — such as confidence scores, co-occurrence frequencies, or relation strengths — to edges between entities. These weights allow analysts to prioritise high-confidence triples, find the most influential paths, and compute weight-aware centrality and community structure in large structured knowledge bases.	Weighted Network Diffusion Analysis models how information, influence, disease, or resources spread through a network whose edges carry quantitative strength values. By letting tie weights govern transition probabilities, the method produces more realistic spreading dynamics than binary-edge diffusion, revealing which high-traffic pathways dominate propagation in social, biological, and information networks.