Algorithms and Dynamical Models for Communities and Reputation in Social Networks
6 Angebote vergleichen
| Preise | 2014 | 2018 | 2019 |
|---|---|---|---|
| Schnitt | € 103,52 | € 94,36 | € 77,47 |
| Nachfrage |
1
Algorithms and Dynamical Models for Communities and Reputation in Social Networks (2014)
~EN NW EBISBN: 9783319063911 bzw. 331906391X, vermutlich in Englisch, Springer, neu, E-Book.
Lieferung aus: Schweiz, Sofort per Download lieferbar.
Algorithms and Dynamical Models for Communities and Reputation in Social Networks, A persistent problem when finding communities in large complex networks is the so-called resolution limit. This thesis addresses this issue meticulously, and introduces the important notion of resolution-limit-free. Remarkably, only few methods possess this desirable property, and this thesis puts forward one such method. Moreover, it discusses how to assess whether communities can occur by chance or not. One aspect that is often ignored in this field is treated here: links can also be negative, as in war or conflict. Besides how to incorporate this in community detection, it also examines the dynamics of such negative links, inspired by a sociological theory known as social balance. This has intriguing connections to the evolution of cooperation, suggesting that for cooperation to emerge, groups often split in two opposing factions. In addition to these theoretical contributions, the thesis also contains an empirical analysis of the effect of trading communities on international conflict, and how communities form in a citation network with positive and negative links. PDF, 28.05.2014.
Algorithms and Dynamical Models for Communities and Reputation in Social Networks, A persistent problem when finding communities in large complex networks is the so-called resolution limit. This thesis addresses this issue meticulously, and introduces the important notion of resolution-limit-free. Remarkably, only few methods possess this desirable property, and this thesis puts forward one such method. Moreover, it discusses how to assess whether communities can occur by chance or not. One aspect that is often ignored in this field is treated here: links can also be negative, as in war or conflict. Besides how to incorporate this in community detection, it also examines the dynamics of such negative links, inspired by a sociological theory known as social balance. This has intriguing connections to the evolution of cooperation, suggesting that for cooperation to emerge, groups often split in two opposing factions. In addition to these theoretical contributions, the thesis also contains an empirical analysis of the effect of trading communities on international conflict, and how communities form in a citation network with positive and negative links. PDF, 28.05.2014.
2
Algorithms and Dynamical Models for Communities and Reputation in Social Networks (2014)
DE NW EBISBN: 9783319063911 bzw. 331906391X, in Deutsch, Springer, neu, E-Book.
Lieferung aus: Deutschland, Sofort per Download lieferbar.
Algorithms and Dynamical Models for Communities and Reputation in Social Networks A persistent problem when finding communities in large complex networks is the so-called resolution limit. This thesis addresses this issue meticulously, and introduces the important notion of resolution-limit-free. Remarkably, only few methods possess this desirable property, and this thesis puts forward one such method. Moreover, it discusses how to assess whether communities can occur by chance or not. One aspect that is often ignored in this field is treated here: links can also be negative, as in war or conflict. Besides how to incorporate this in community detection, it also examines the dynamics of such negative links, inspired by a sociological theory known as social balance. This has intriguing connections to the evolution of cooperation, suggesting that for cooperation to emerge, groups often split in two opposing factions. In addition to these theoretical contributions, the thesis also contains an empirical analysis of the effect of trading communities on international conflict, and how communities form in a citation network with positive and negative links. 28.05.2014, PDF.
Algorithms and Dynamical Models for Communities and Reputation in Social Networks A persistent problem when finding communities in large complex networks is the so-called resolution limit. This thesis addresses this issue meticulously, and introduces the important notion of resolution-limit-free. Remarkably, only few methods possess this desirable property, and this thesis puts forward one such method. Moreover, it discusses how to assess whether communities can occur by chance or not. One aspect that is often ignored in this field is treated here: links can also be negative, as in war or conflict. Besides how to incorporate this in community detection, it also examines the dynamics of such negative links, inspired by a sociological theory known as social balance. This has intriguing connections to the evolution of cooperation, suggesting that for cooperation to emerge, groups often split in two opposing factions. In addition to these theoretical contributions, the thesis also contains an empirical analysis of the effect of trading communities on international conflict, and how communities form in a citation network with positive and negative links. 28.05.2014, PDF.
3
Algorithms and Dynamical Models for Communities and Reputation in Social Networks
DE NW EB DLISBN: 9783319063911 bzw. 331906391X, in Deutsch, Springer International Publishing, neu, E-Book, elektronischer Download.
Lieferung aus: Deutschland, Versandkostenfrei.
Algorithms and Dynamical Models for Communities and Reputation in Social Networks: A persistent problem when finding communities in large complex networks is the so-called resolution limit. This thesis addresses this issue meticulously, and introduces the important notion of resolution-limit-free. Remarkably, only few methods possess this desirable property, and this thesis puts forward one such method. Moreover, it discusses how to assess whether communities can occur by chance or not. One aspect that is often ignored in this field is treated here: links can also be negative, as in war or conflict. Besides how to incorporate this in community detection, it also examines the dynamics of such negative links, inspired by a sociological theory known as social balance. This has intriguing connections to the evolution of cooperation, suggesting that for cooperation to emerge, groups often split in two opposing factions. In addition to these theoretical contributions, the thesis also contains an empirical analysis of the effect of trading communities on international conflict, and how communities form in a citation network with positive and negative links. Englisch, Ebook.
Algorithms and Dynamical Models for Communities and Reputation in Social Networks: A persistent problem when finding communities in large complex networks is the so-called resolution limit. This thesis addresses this issue meticulously, and introduces the important notion of resolution-limit-free. Remarkably, only few methods possess this desirable property, and this thesis puts forward one such method. Moreover, it discusses how to assess whether communities can occur by chance or not. One aspect that is often ignored in this field is treated here: links can also be negative, as in war or conflict. Besides how to incorporate this in community detection, it also examines the dynamics of such negative links, inspired by a sociological theory known as social balance. This has intriguing connections to the evolution of cooperation, suggesting that for cooperation to emerge, groups often split in two opposing factions. In addition to these theoretical contributions, the thesis also contains an empirical analysis of the effect of trading communities on international conflict, and how communities form in a citation network with positive and negative links. Englisch, Ebook.
4
Algorithms and Dynamical Models for Communities and Reputation in Social Networks (eBook, PDF)
DE NWISBN: 9783319063911 bzw. 331906391X, in Deutsch, neu.
Lieferung aus: Deutschland, zzgl. Versandkosten.
A persistent problem when finding communities in large complex networks is the so-called resolution limit. This thesis addresses this issue meticulously, and introduces the important notion of resolution-limit-free. Remarkably, only few methods possess th.
A persistent problem when finding communities in large complex networks is the so-called resolution limit. This thesis addresses this issue meticulously, and introduces the important notion of resolution-limit-free. Remarkably, only few methods possess th.
5
Algorithms and Dynamical Models for Communities and Reputation in Social Networks (2014)
DE NWISBN: 9783319063911 bzw. 331906391X, in Deutsch, neu.
Lieferung aus: Vereinigtes Königreich Großbritannien und Nordirland, Versandkostenfrei.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
6
Algorithms and Dynamical Models for Communities and Reputation in Social Networks als eBook von Vincent Traag, Vincent Traag (2014)
DE NWISBN: 9783319063911 bzw. 331906391X, in Deutsch, Springer International Publishing, neu.
Lieferung aus: Vereinigtes Königreich Großbritannien und Nordirland, Versandkostenfrei.
Algorithms and Dynamical Models for Communities and Reputation in Social Networks ab 87.99 EURO Auflage 2014.
Algorithms and Dynamical Models for Communities and Reputation in Social Networks ab 87.99 EURO Auflage 2014.
Lade…