Φορτώνει......
A Fast and Efficient Algorithm for Mining Top-k Nodes in Complex Networks
One of the key problems in social network analysis is influence maximization, which has great significance both in theory and practical applications. Given a complex network and a positive integer k, and asks the k nodes to trigger the largest expected number of the remaining nodes. Many mature algo...
Αποθηκεύτηκε σε:
| Τόπος έκδοσης: | Sci Rep |
|---|---|
| Κύριοι συγγραφείς: | , , , , |
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Nature Publishing Group
2017
|
| Θέματα: | |
| Διαθέσιμο Online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5327405/ https://ncbi.nlm.nih.gov/pubmed/28240238 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1038/srep43330 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|