방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 가중 지식 그래프 분석× | 가중치 고유벡터 중심성× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2010s–present | 1987 (binary); 2010 (weighted generalization) |
| 창시자≠ | Hogan et al. and the broader knowledge graph community | Bonacich, P. (binary); Opsahl, T. et al. (weighted extension) |
| 유형≠ | Network analysis variant | Spectral centrality measure |
| 원전≠ | 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. DOI ↗ | Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI ↗ |
| 별칭 | WKGA, weighted KG analysis, confidence-weighted knowledge graph, weighted semantic network analysis | WEC, weighted spectral centrality, strength-weighted eigenvector centrality, weighted eigenvector prestige |
| 관련 | 6 | 6 |
| 요약≠ | 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 eigenvector centrality extends the classic eigenvector centrality measure to graphs where edges carry numerical weights, scoring each node proportionally to the sum of its neighbors' scores multiplied by the connecting edge weights. Nodes score highly not just by having many connections but by being strongly linked to other influential nodes, making the measure sensitive to both tie strength and network position simultaneously. |
| ScholarGate데이터셋 ↗ |
|
|