A node degree dependent random perturbation method for prediction of missing links in the network
In present study, I proposed a node degree dependent random perturbation algorithm for prediction of missing links in the network. In the algorithm, I assume that a node with more existing links harbors more missing links. There are two rules. Rule 1 means that a randomly chosen node tends to connec...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
International Academy of Ecology and Environmental Sciences
2016-03-01
|
| Series: | Network Biology |
| Subjects: | |
| Online Access: | http://www.iaees.org/publications/journals/nb/articles/2016-6(1)/perturbation-method-for-prediction-of-missing-links.pdf |