Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Κατευθυνόμενη Κεντρικότητα Ιδιοδιανύσματος× | Κατευθυνόμενη Κεντρικότητα Ενδιαμεσότητας× | |
|---|---|---|
| Πεδίο | Ανάλυση Δικτύων | Ανάλυση Δικτύων |
| Οικογένεια | Machine learning | Machine learning |
| Έτος προέλευσης≠ | 1972–1987 | 1977 |
| Δημιουργός≠ | Bonacich, P. | Freeman, L. C. |
| Τύπος≠ | Centrality measure (eigenvector-based, directed) | Centrality measure (directed graph) |
| Θεμελιώδης πηγή≠ | Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182. DOI ↗ | Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI ↗ |
| Εναλλακτικές ονομασίες | directed EC, asymmetric eigenvector centrality, right eigenvector centrality, left eigenvector centrality | directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness |
| Συναφείς | 5 | 5 |
| Σύνοψη≠ | Directed eigenvector centrality extends the classic eigenvector centrality to directed graphs by scoring each node according to the centrality of the nodes that point to it (in-direction) or that it points to (out-direction). A node earns a high score not merely by having many connections but by being connected to other highly central nodes, capturing asymmetric influence in citation networks, social hierarchies, and information flows. | Directed Betweenness Centrality extends Freeman's classic betweenness measure to directed graphs, quantifying how often a node lies on the shortest directed paths between all other pairs of nodes. It identifies gatekeepers, brokers, and bottlenecks in asymmetric flows such as information cascades, citation networks, and organizational hierarchies. |
| ScholarGateΣύνολο δεδομένων ↗ |
|
|