So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Weighted PageRank× | Eigenvector Centrality× | |
|---|---|---|
| Lĩnh vực | Phân tích mạng lưới | Phân tích mạng lưới |
| Họ | Machine learning | Machine learning |
| Năm ra đời≠ | 2004 | 1972 |
| Người khởi xướng≠ | Xing, W. & Ghorbani, A. | Bonacich, P. |
| Loại≠ | Centrality measure / ranking algorithm | Centrality measure |
| Công trình gốc≠ | Xing, W., & Ghorbani, A. (2004). Weighted PageRank algorithm. Proceedings of the Second Annual Conference on Communication Networks and Services Research (CNSR '04), pp. 305–314. IEEE. DOI ↗ | Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120. DOI ↗ |
| Tên gọi khác | WPR, weighted page rank, edge-weighted PageRank, strength-based PageRank | eigenvector centrality, EC, Bonacich centrality, power centrality |
| Liên quan | 6 | 6 |
| Tóm tắt≠ | Weighted PageRank extends the classic PageRank algorithm to networks where edges carry different strengths or frequencies, distributing importance proportionally to both incoming and outgoing edge weights rather than treating all links equally. This makes it substantially more informative than binary PageRank in any network where connection strength matters. | Eigenvector centrality, introduced by Bonacich in 1972, measures a node's influence by considering not just how many neighbors it has, but how influential those neighbors are. A node scores highly if it is connected to other high-scoring nodes, making it a recursive, globally-aware measure of structural importance in a network. |
| ScholarGateBộ dữ liệu ↗ |
|
|