Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/93167
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Torra, Vicenç | - |
dc.contributor.author | Jonsson, Annie | - |
dc.contributor.author | Salas Piñón, Julián | - |
dc.contributor.author | Navarro-Arribas, Guillermo | - |
dc.contributor.other | Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3) | - |
dc.contributor.other | Universitat Autònoma de Barcelona (UAB) | - |
dc.contributor.other | University of Skövde | - |
dc.date.accessioned | 2019-04-15T11:37:05Z | - |
dc.date.available | 2019-04-15T11:37:05Z | - |
dc.date.issued | 2018-10-03 | - |
dc.identifier.citation | Torra, V., Jonsson, A., Navarro-Arribas, G. & Salas, J. (2018). Synthetic generation of spatial graphs. International Journal of Intelligent Systems, 33(12), 2364-2378. doi: 10.1002/int.22034 | - |
dc.identifier.issn | 0884-8173MIAR | - |
dc.identifier.uri | http://hdl.handle.net/10609/93167 | - |
dc.description.abstract | Graphs can be used to model many different types of interaction networks, for example, online social networks or animal transport networks. Several algorithms have thus been introduced to build graphs according to some predefined conditions. In this paper, we present an algorithm that generates spatial graphs with a given degree sequence. In spatial graphs, nodes are located in a space equiped with a metric. Our goal is to define a graph in such a way that the nodes and edges are positioned according to an underlying metric. More particularly, we have constructed a greedy algorithm that generates nodes proportional to an underlying probability distribution from the spatial structure, and then generates edges inversely proportional to the Euclidean distance between nodes. The algorithm first generates a graph that can be a multigraph, and then corrects multiedges. Our motivation is in data privacy for social networks, where a key problem is the ability to build synthetic graphs. These graphs need to satisfy a set of required properties (e.g., the degrees of the nodes) but also be realistic, and thus, nodes (individuals) should be located according to a spatial structure and connections should be added taking into account nearness. | en |
dc.language.iso | eng | - |
dc.publisher | International Journal of Intelligent Systems | - |
dc.relation.ispartof | International Journal of Intelligent Systems, 2018, 33(12) | - |
dc.relation.uri | https://onlinelibrary.wiley.com/doi/full/10.1002/int.22034 | - |
dc.rights | CC BY-NC-ND | - |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | - |
dc.subject | data privacy | en |
dc.subject | graphs generating algorithms | en |
dc.subject | network modeling | en |
dc.subject | spatial graphs | en |
dc.subject | privacitat de dades | ca |
dc.subject | gràfics que generen algorismes | ca |
dc.subject | modelització de xarxa | ca |
dc.subject | gràfics espacials | ca |
dc.subject | privacidad de datos | es |
dc.subject | gráficos generando algoritmos | es |
dc.subject | modelado de red | es |
dc.subject | gráficas espaciales | es |
dc.subject.lcsh | Computer security | en |
dc.title | Synthetic generation of spatial graphs | - |
dc.type | info:eu-repo/semantics/article | - |
dc.subject.lemac | Seguretat informàtica | ca |
dc.subject.lcshes | Seguridad informática | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | - |
dc.identifier.doi | 10.1002/int.22034 | - |
dc.gir.id | AR/0000006560 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/ TIN2014-57364-C2-2-R | - |
dc.relation.projectID | info:eu-repo/grantAgreement/TIN2014-55243-P | - |
dc.relation.projectID | info:eu-repo/grantAgreement/VR2016-03346 | - |
dc.type.version | info:eu-repo/semantics/publishedVersion | - |
Aparece en las colecciones: | Articles cientÍfics Articles |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
spatialgrahs.pdf | 755,14 kB | Adobe PDF | Visualizar/Abrir |
Comparte:
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons