Using Graph Homomorphisms for Vertex Classification Analysis in Social Networks
Authors: 
Giovani Melo Marzano, Pedro Henrique B. Ruas da Silveira, Gabriel Barbosa da Fonseca, Pasteur Ottoni M. Jr., Silvio Jamil F. GuimarãesAuthors Info & Claims
Giovani Melo Marzano, Pedro Henrique B. Ruas da Silveira, Gabriel Barbosa da Fonseca, Pasteur Ottoni M. Jr., Silvio Jamil F. GuimarãesAuthors Info & ClaimsPages 157 - 164
Abstract
A social network consists on a finite set of social entities and the relationships between them. These entities are represented as vertices in a graph which represents this network. Usually, the entities (or vertices) can be classified according to their features, like interactions (comments, posts, likes, etc.) for example. However, to work directly with these graphs and understand the relationships between the several pre-defined classes are not easy tasks due to, for instance, the graph's size. In this work, we propose metrics for evaluating how good is a graph transformation based on graph homomorphism, measuring how much the relationships of the original one are preserved after the transformation. The proposed metrics measure the edge regularity indices and indicate the proportion of the original graph's vertices that participates in the relations, moreover they measure how close to a regular homomorphism is the graph transformation. For assessing the regularity indices, some experiments taking into account synthetic and real social network data are given.
References
[1]
1] Jean-François Baget. 2005. RDF entailment as a graph homomorphism. In International Semantic Web Conference. Springer, Berlin, Berlin Heidelberg, 82--96.
[2]
Fabrício Benevenuto. 2010. Redes sociais online: Técnicas de coleta, abordagens de medição e desafios futuros. Tópicos em Sistemas Colaborativos, Interativos, Multimidia, Web e Banco de Dados (2010), 41--70.
[3]
Fabrício Benevenuto, Adriano Pereira, Tiago Rodrigues, Virgílio Almeida, Jussara Almeida, and Marcos Gonçalves. 2009. Evaluation of Users Access and Navigation Profiles on Web Video Sharing Environments. In Proceedings of the XV Brazilian Symposium on Multimedia and the Web (WebMedia '09). ACM, New York, NY, USA, Article 31, 8 pages.
[4]
Josep Domingo-Ferrer, Alexandre Viejo, Francesc Sebé, and Úrsula González- Nicolás. 2008. Privacy homomorphisms for social networks with private relationships. Computer Networks 52, 15 (2008), 3007--3016.
[5]
Guillaume Erétéo, Fabien Gandon, Olivier Corby, and Michel Buffa. 2009. Semantic social network analysis. arXiv preprint arXiv:0904.3701 (2009).
[6]
Facebook. 2016. Facebok News Room. (Novembro 2016). http://br.newsroom.fb.com/company-info/Acessoem: 10 mar. 2016.
[7]
L.C. Freeman, D.R. White, and A.K. Romney. 1992. Research Methods in Social Network Analysis. Transaction Publishers, New Jersey, EUA.
[8]
Ivan Herman, Guy Melançon, and M Scott Marshall. 2000. Graph visualization and navigation in information visualization: A survey. IEEE Transactions on visualization and computer graphics 6, 1 (2000), 24--43.
[9]
E. H Menezes, P. B.; Haeusler. 2008. Teoria das categorias para ciência da computação. Bookman, Porto Alegre, Brazil.
[10]
EM Mirkes. 2011. Principal Component Analysis and Self-Organizing Maps: applet. University of Leicester (2011).
[11]
Peter Rousseeuw. 1987. Silhouettes: A Graphical Aid to the Interpretation and Validation of Cluster Analysis. J. Comput. Appl. Math. 20, 1 (Nov. 1987), 53--65.
[12]
Pedro Henrique B. Ruas, Luis Enrique Zárate, Ana Maria Cardoso, and Cristiane Neri Nobre. 2015. Caracterização do Comportamento dos Usuários da Rede Social Facebook utilizando Métricas de Redes Complexas e Algoritmos de Clusterização. In 30th Brazilian Symposium on Databases (SBBD '15). Sociedade Brasileira de Computação, Porto Alegre, Brazil.
[13]
Hiroki Sasamura and Toshimichi Saito. 2003. A simple learning algorithm for growing self-organizing maps and its application to the skeletonization. In Neural Networks, 2003. Proceedings of the International Joint Conference on, Vol. 1. IEEE, 787--790.
[14]
David I Spivak. 2014. Category theory for the sciences. MIT Press, Massachusetts, EUA.
[15]
B. K. Tripathy, M. S. Sishodia, and Sumeet Jain. 2014. Societal Networks: The Networks of Dynamics of Interpersonal Associations. Springer International Publishing, Cham, 101--127.
[16]
Changzhong Wang, Degang Chen, Chong Wu, and Qinhua Hu. 2011. Data compression with homomorphism in covering information systems. International Journal of Approximate Reasoning 52, 4 (2011), 519--525.
[17]
S. Wasserman and K. Faust. 1994. Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge, United Kingdom.
[18]
Douglas R White and Karl P Reitz. 1983. Graph and semigroup homomorphisms on networks of relations. Social Networks 5, 2 (1983), 193--234.
Index Terms
- Using Graph Homomorphisms for Vertex Classification Analysis in Social Networks
Recommendations
On homomorphisms of oriented graphs with respect to the push operation
An oriented graph G is a directed graph without directed cycles of length at most 2 having set of vertices V(G) and set of arcs A(G). To push a vertex of an oriented graph is to reverse the orientation of the arcs incident to that vertex. If G can be ...
Homomorphisms from sparse graphs with large girth
We show that a planar graph with girth at least 20t - 2/3 has circular chromatic number at most 2 + 1/t, improving earlier results. This follows from a general result establishing homomorphisms into special targets for graphs with given girth and given ...
Graph homomorphisms through random walks
In this paper we introduce some general necessary conditions for the existence of graph homomorphisms, which hold in both directed and undirected cases. Our method is a combination of Diaconis and Saloff–Coste comparison technique for Markov chains and ...
Comments
Information & Contributors
Information
Published In
October 2017
522 pages
ISBN:9781450350969
DOI:10.1145/3126858
- General Chairs:
- Valter Roesler,
- José Valdeni de Lima,
- Program Chairs:
- Celso Alberto Saibel Santos,
- Roberto Willrich
Copyright © 2017 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- SBC: Brazilian Computer Society
- CNPq: Conselho Nacional de Desenvolvimento Cientifico e Tecn
- CGIBR: Comite Gestor da Internet no Brazil
- CAPES: Brazilian Higher Education Funding Council
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 October 2017
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- CAPES
- CNPq
- PUC Minas
- FAPEMIG
Conference
Webmedia '17
Sponsor:
- SBC
- CNPq
- CGIBR
- CAPES
Acceptance Rates
WebMedia '17 Paper Acceptance Rate 38 of 138 submissions, 28%;
Overall Acceptance Rate 270 of 873 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 62Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 07 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in