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:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/74487 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
Be the first to leave a comment!