Vol. 25 No. 2 (2015)
Artículos de investigación

Computational algorithm dynamic merge of cliques to measure the resonance of individuals in social networks

PDF (Spanish) HTML (Spanish)
Untitled (Spanish) Untitled (Spanish) Untitled (Spanish) Untitled (Spanish) Untitled (Spanish) Untitled (Spanish) Untitled (Spanish) Untitled (Spanish)
  • Jorge Esteban Zaragoza Salazar,
  • Adrían Trueba Espinosa
Jorge Esteban Zaragoza Salazar Universidad Autónoma del Estado de México

Bio
Adrían Trueba Espinosa Universidad Autónoma del Estado de México

Bio

Published 2015-05-15

Keywords

  • Array,
  • Array,
  • Array,
  • Array,
  • Array,
  • Array,
  • Array,
  • Array
    • ...More
    Less
Copyright Notice

How to Cite

Computational algorithm dynamic merge of cliques to measure the resonance of individuals in social networks. (2015). Acta Universitaria, 25(2), 28-39. https://doi.org/10.15174/au.2015.733

Abstract

This article discusses the role social networks have in spreading information. This information  can become viral in a matter of hours and could have harmful or beneficial effects on society. In order to measure the spread of information, we propose metrics to measure the resonance (centrality) of an individual in social networks, using algorithms and mathematical models. Highlighting the Dynamic Time Warping (DTW) algorithm on the results obtained with random walk, to simulate a broadcast message as a graph consisting of nodes (people).

 
PDF (Spanish) HTML (Spanish)
Untitled (Spanish) Untitled (Spanish) Untitled (Spanish) Untitled (Spanish) Untitled (Spanish) Untitled (Spanish) Untitled (Spanish) Untitled (Spanish)

References

  2. Belo, R. & Ferreira, P. (September, 2012). Using Randomization to Identify Social Influence in Mobile Networks. Trabajo presentado en la 2012 International Conference on and 2012 International Confernece on Social Computing (SocialCom)Privacy, Security, Risk and Trust (PASSAT), Amsterdam, Países Bajos. doi: 10.1109/SocialCom-PASSAT.2012.62


  7. Durr, M., Protschky, V. & Linnhoff-Popien, C. (August, 2012). Modeling Social Network Interaction Graphs. Trabajo presentado en la 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Istanbul, Turquía. doi: 10.1109/ASONAM.2012.110


  11. Fortunato, S. (2010). Community detection in graphs. Physics Reports 486, 75-174. doi: 10.1016/j.physrep.2009.11.002


  16. Guo, R. (December, 2012). Research on Information Spreading Model of Social Network. Trabajo presentado en la 2012 Second International Conference on Instrumentation, Measurement, Computer, Communication and Control (IMCCC), Harbin, China. doi: 10.1109/IMCCC.2012.220


  19. Huang X., Acero A., & Hon H. W. (2001). Spoken Language Processing. USA: Prentice-Hall.


  23. Ilyas, M. U. & Radha, H. (June, 2011). Identifying Influential Nodes in Online Social Networks Using Principal Component Centrality. Trabajo presentado en la 2011 IEEE International Conference on Communications (ICC), Kyoto, Japón. doi: 10.1109/icc.2011.5963147


  26. Junquero-Trabado, V., Trench-Ribes, N., Aguila-Lorente, M. A. & Dominguez-Sal, D. (October, 2011). Comparison of influence metrics in information diffusion networks. Trabajo presentado en la 2011 International Conference on Computational Aspects of Social Networks (CASoN). Salamanca, España. doi: 10.1109/CASON.2011.6085914


  29. Khrabrov, A. & Cybenko, G. (August, 2010). Discovering Influence in Communication Networks using Dynamic Graph Analysis. Trabajo presentado en la 2010 IEEE Second International Conference on Social Computing (SocialCom), Minneapolis, EU. doi: 10.1109/SocialCom.2010.48


  32. Liu, D. & Chen, X. (November, 2011). Rumor Propagation in Online Social Networks Like Twitter —A Simulation Study. Trabajo presentado en la 2011 Third International Conference on Multimedia Information Networking and Security (MINES), Shanghai, China. doi: 10.1109/MINES.2011.109.


  35. Müller, M. (2007). Dynamic Time Warping. In Information Retrieval for Music and Motion. Berlin Heidelberg: Springer-Verlag.


  38. Nekovee, M., Moreno, Y., Bianconi, G. & Marsili, M. (2007). Theory of rumour spreading in complex social networks. Physica A, 374, 457-470. doi: 10.1016/j.physa.2006.07.017


  41. Svendsen, M., Mukherjee, A. P. & Tirthapura, S. (2014). Mining Maximal Cliques from a Large Graph using MapReduce: Tackling Highly Uneven Subproblem Sizes. Journal of Parallel and Distributed Computing (Available online). doi:10.1016/j.jpdc.2014.08.011


  44. Wei, X., Valler, N., Prakash, B. A., Neamtiu, I., Faloutsos, M. & Faloutsos, C. (2012). Competing memes propagation on networks: a case study of composite networks. ACM SIGCOMM Computer Communication Review, 42(5), 6-11. doi: 10.1145/2378956.2378958


  47. Yan, B. & Gregory, S. (November, 2009). Detecting Communities in Networks by Merging Cliques. Trabajo presentado en la ICIS 2009. IEEE International Conference on Intelligent Computing and Intelligent Systems, 2009, Shanghai, China. doi: 10.1109/ICICISYS.2009.5358036


  50. Zheng, J., Chen. W., Zhang, L. & Bu, J. (April, 2010). A Metric for Measuring Members’ Contribution to Information Propagation in Social Network Sites. Trabajo presnetad en la 2010 12th International Asia-Pacific Web Conference (APWEB), Busan, Corea del Sur. doi: 10.1109/APWeb.2010.50