Vertaile menetelmiä
Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.
| Ohjattu tietograafianalyysi× | Suunnattu PageRank× | |
|---|---|---|
| Tieteenala | Verkostoanalyysi | Verkostoanalyysi |
| Menetelmäperhe | Machine learning | Machine learning |
| Syntyvuosi≠ | 2000s–2010s | 1998 |
| Kehittäjä≠ | Hogan, A. et al. (formalized); roots in Berners-Lee, T. et al. (Semantic Web) | Brin, S. & Page, L. |
| Tyyppi≠ | Graph-based knowledge representation and inference | Iterative authority-scoring algorithm |
| Alkuperäislähde≠ | 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 ↗ | Brin, S. & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. Proceedings of the 7th International Conference on World Wide Web (WWW7), 107–117. Elsevier. link ↗ |
| Rinnakkaisnimet | directed KG analysis, knowledge graph mining, directed semantic graph analysis, KG reasoning | PageRank, PR, Google PageRank, directed link analysis |
| Liittyvät≠ | 6 | 5 |
| Tiivistelmä≠ | 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 PageRank is a link-based authority scoring algorithm that assigns importance scores to nodes in a directed graph by iteratively redistributing rank through outgoing edges. Introduced by Brin and Page in 1998 as the backbone of Google Search, it measures not just how many in-links a node has but how authoritative the nodes pointing to it are. |
| ScholarGateAineisto ↗ |
|
|