Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Centralidade de Grau× | Centralidade de Grau Ponderado× | |
|---|---|---|
| Área | Análise de redes | Análise de redes |
| Família | Machine learning | Machine learning |
| Ano de origem≠ | 1978 | 2004 |
| Autor original≠ | Freeman, L. C. | Barrat, A.; Barthélemy, M.; Pastor-Satorras, R.; Vespignani, A. |
| Tipo≠ | Node-level centrality measure | Centrality measure for weighted networks |
| Fonte seminal≠ | Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. DOI ↗ | Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752. DOI ↗ |
| Outros nomes | node degree, degree score, DC, connectivity centrality | node strength, strength centrality, weighted node degree, WDC |
| Relacionados | 6 | 6 |
| Resumo≠ | 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. | Weighted degree centrality — also called node strength — extends the classic degree centrality measure to networks whose edges carry numeric weights. Instead of simply counting a node's connections, it sums the weights of all edges incident to that node, capturing both the volume and the intensity of a node's ties in a single, interpretable score. |
| ScholarGateConjunto de dados ↗ |
|
|