Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Riktad kunskapsgrafanalys× | Riktad social nätverksanalys× | |
|---|---|---|
| Ämnesområde | Nätverksanalys | Nätverksanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2000s–2010s | 1994 |
| Upphovsperson≠ | Hogan, A. et al. (formalized); roots in Berners-Lee, T. et al. (Semantic Web) | Wasserman, S. & Faust, K. |
| Typ≠ | Graph-based knowledge representation and inference | Structural analysis of directed graphs |
| Ursprungskälla≠ | Hogan, A., Blomqvist, E., Cochez, M., d'Amato, C., Melo, G. D., Gutierrez, C., ... & Polleres, A. (2021). Knowledge graphs. ACM Computing Surveys, 54(4), 1–37. DOI ↗ | Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1 |
| Alias | directed KG analysis, knowledge graph mining, directed semantic graph analysis, KG reasoning | directed SNA, digraph analysis, directed graph network analysis, asymmetric network analysis |
| Närliggande≠ | 6 | 5 |
| Sammanfattning≠ | Directed Knowledge Graph Analysis represents factual knowledge as a directed labeled multigraph of entities (nodes) and typed relations (directed edges), enabling structured reasoning, inference, and discovery over large heterogeneous datasets. The direction of edges encodes asymmetric relationships such as 'authored-by', 'causes', or 'is-a', making the graph semantically richer than undirected alternatives. | Directed Social Network Analysis (directed SNA) studies networks in which every tie has an explicit direction — from a sender to a receiver — rather than treating relationships as symmetric. It extends the classical SNA toolkit with in-degree, out-degree, reciprocity, and asymmetric path measures, making it the appropriate framework wherever relationship direction carries substantive meaning, such as citation flows, advice-seeking, follower graphs, or information cascades. |
| ScholarGateDatamängd ↗ |
|
|