Comparar métodos
Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.
| PageRank Dirigido× | Centralidad de grado× | |
|---|---|---|
| Campo | Análisis de redes | Análisis de redes |
| Familia | Machine learning | Machine learning |
| Año de origen≠ | 1998 | 1978 |
| Autor original≠ | Brin, S. & Page, L. | Freeman, L. C. |
| Tipo≠ | Iterative authority-scoring algorithm | Node-level centrality measure |
| Fuente seminal≠ | 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 ↗ | Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ |
| Alias | PageRank, PR, Google PageRank, directed link analysis | node degree, degree score, DC, connectivity centrality |
| Relacionados≠ | 5 | 6 |
| Resumen≠ | 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. | Degree centrality is the simplest and most intuitive measure of a node's importance in a network, defined as the number of direct ties a node has to other nodes. Normalized by dividing by the maximum possible ties, it allows comparison across networks of different sizes and is the starting point of almost every network analysis. |
| ScholarGateConjunto de datos ↗ |
|
|