Social matching in complex social systems
This project aims to create an Erdős–Rényi random network using the Stanford Network Analysis Platform(SNAP) and perform greedy matching algorithm with it to simulate social matching. Greedy matching algorithm makes nodes of the network prefer their neighbouring node with the highest fitness level....
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/74487 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|