Dynamic Relationship Building: Exploitation Versus Exploration on a Social Network

Show simple item record

dc.contributor.author Yan, B en
dc.contributor.author Chen, Yang en
dc.contributor.author Liu, Jiamou en
dc.contributor.editor Bouguettaya, A en
dc.contributor.editor Gao, Y en
dc.contributor.editor Klimenko, A en
dc.contributor.editor Chen, L en
dc.contributor.editor Zhang, X en
dc.contributor.editor Dzerzhinskiy, F en
dc.contributor.editor Jia, W en
dc.contributor.editor Klimenko, S en
dc.contributor.editor Li, Q en
dc.coverage.spatial Puschino, Russia en
dc.date.accessioned 2018-11-15T01:49:22Z en
dc.date.issued 2017-10-04 en
dc.identifier.citation Web Information Systems Engineering – WISE 2017, 18th International Conference, Puschino, Russia,, 07 Oct 2017 - 11 Oct 2017. Editors: Bouguettaya A, Gao Y, Klimenko A, Chen L, Zhang X, Dzerzhinskiy F, Jia W, Klimenko SV, Li Q. Lecture Notes in Computer Science Web Information Systems Engineering – WISE 2017, 18th International Conference Proceedings, Part I. 10569 LNCS: 75-90. 2017 en
dc.identifier.isbn 978-3-319-68782-7 en
dc.identifier.issn 0302-9743 en
dc.identifier.uri http://hdl.handle.net/2292/44293 en
dc.description.abstract Interpersonal relations facilitate information flow and give rise to positional advantage of individuals in a social network. We ask the question: How would an individual build relations with members of a dynamic social network in order to arrive at a central position in the network? We formalize this question using the dynamic network building problem. Two strategies stand out to solve this problem: The first directs the individual to exploit their social proximity by linking to nodes that are close-by, while the second tries its best to explore distant regions of the network. We evaluate and contrast these two strategies with respect to edge- and distance-based cost metrics, as well as other structural properties such as embeddedness and clustering coefficient. Experiments are performed on models of dynamic random graphs and real-world data sets. We then discuss and test ways that combine these two strategies. en
dc.description.uri https://link.springer.com/book/10.1007/978-3-319-68783-4 en
dc.format.medium Paper and online en
dc.publisher Springer, Cham en
dc.relation.ispartof Web Information Systems Engineering – WISE 2017 18th International Conference, Puschino, Russia, October 7-11, 2017 en
dc.relation.ispartofseries Lecture Notes in Computer Science: Web Information Systems Engineering – WISE 2017 18th International Conference, Puschino, Russia, October 7-11, 2017, Proceedings, Part I en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Computer Science. The final authenticated version is available online at: http://dx.doi.org/10.1007/978-3-319-68783-4_6 en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.rights.uri https://www.springer.com/gp/open-access/authors-rights/self-archiving-policy/2124 en
dc.subject dynamic social networks en
dc.subject interpersonal ties en
dc.subject network evolution en
dc.subject centrality en
dc.subject Exploitation-exploration tradeoff en
dc.title Dynamic Relationship Building: Exploitation Versus Exploration on a Social Network en
dc.type Conference Item en
dc.identifier.doi 10.1007/978-3-319-68783-4_6 en
pubs.begin-page 75 en
pubs.volume LNCS 10569 en
dc.rights.holder Copyright: Springer en
pubs.author-url http://www.wise-conferences.org/ en
pubs.end-page 90 en
pubs.finish-date 2017-10-11 en
pubs.publication-status Published en
pubs.start-date 2017-10-07 en
dc.rights.accessrights http://purl.org/eprint/accessRights/OpenAccess en
pubs.subtype Proceedings en
pubs.elements-id 692801 en
pubs.org-id Science en
pubs.org-id School of Computer Science en
dc.identifier.eissn 1611-3349 en
pubs.record-created-at-source-date 2017-10-15 en
pubs.online-publication-date 2017-10-04 en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace