Community Structure in Endorsement Social Networks

Garrido Yuste, Guillermo. (2010). Community Structure in Endorsement Social Networks Master Thesis, Universidad Nacional de Educación a Distancia (España). Escuela Técnica Superior de Ingeniería Informática. Departamento de Lenguajes y Sistemas Informáticos

Ficheros (Some files may be inaccessible until you login with your e-spacio credentials)
Nombre Descripción Tipo MIME Size
GARRIDO_YUSTE_Guillermo_TFM.pdf Full text (open access) application/pdf 1.35MB

Título Community Structure in Endorsement Social Networks
Autor(es) Garrido Yuste, Guillermo
Abstract In this work, we study the community structure of endorsement networks, i.e., social networks in which a directed edge u → v is asserting an action of support from user u to user v. Examples include scenarios where a user u is favouring a photo, liking a post, or following the microblog of user v. Very often, endorsement networks are sub- networks of more complex social systems; for instance, a photo-sharing site typically includes a “favouring” function, which induces an endorsement network. We start from the hypothesis that the footprint of a community in an endorsement network is a bipartite directed clique from a set of followers to a set of leaders, and apply frequent itemset mining techniques to discover such bicliques. Our analysis of real networks indicated that, with high statistical significance, this hypothesis holds, and that the leaders of a community are endorsing each other forming a very dense nucleus. Our method produces many similar bicliques, which are different footprints of the same community. Thus, we propose a novel clustering technique in order to coalesce similar bicliques into meaningful communities. We explore different similarity measures based on set similarity and on edge density between followers and leaders, and by expressing edge density as an inner product operation we show how to make the clustering algo- rithm scalable. Our experiments demonstrate that our clustering algorithm is capable of discovering communities characterised by a set of leaders who link to each other and followers who link to the leaders.
Notas adicionales Trabajo final de Máster Universitario en Lenguajes y Sistemas Informáticos
Materia(s) Informática
Editor(es) Universidad Nacional de Educación a Distancia (España). Escuela Técnica Superior de Ingeniería Informática. Departamento de Lenguajes y Sistemas Informáticos
Director/Tutor Peñas, Anselmo
Fecha 2010-09-01
Formato application/pdf
Identificador bibliuned:master-ETSIInformatica-LSI-Ggarrido
http://e-spacio.uned.es/fez/view/bibliuned:master-ETSIInformatica-LSI-Ggarrido
Idioma eng
Versión de la publicación acceptedVersion
Nivel de acceso y licencia http://creativecommons.org/licenses/by-nc-nd/4.0
info:eu-repo/semantics/openAccess
Tipo de recurso master Thesis
Tipo de acceso Acceso abierto

 
Versiones
Versión Tipo de filtro
Contador de citas: Google Scholar Search Google Scholar
Estadísticas de acceso: 168 Visitas, 180 Descargas  -  Estadísticas en detalle
Creado: Tue, 06 Oct 2015, 02:57:05 CET