Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2019, Article ID 1439415, 14 pages
https://doi.org/10.1155/2019/1439415
Research Article

NOESIS: A Framework for Complex Network Data Analysis

Department of Computer Science and Artificial Intelligence & Research Center for Information and Communications Technologies (CITIC), University of Granada, Granada, Spain

Correspondence should be addressed to Fernando Berzal; gro.mca@lazreb

Received 28 June 2019; Accepted 9 September 2019; Published 31 October 2019

Academic Editor: Giulio Cimini

Copyright © 2019 Víctor Martínez et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P.-N. Tan, M. Steinbach, V. Kumar et al., Introduction to Data Mining, Pearson, Addison Wesley, Boston, MA, USA, 2006.
  2. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. Hwang, “Complex networks: structure and dynamics,” Physics Reports, vol. 424, no. 4-5, pp. 175–308, 2006. View at Publisher · View at Google Scholar · View at Scopus
  3. R. Tamassia, Handbook of Graph Drawing and Visualization, CRC Press, Boca Raton, FL, USA, 2013.
  4. A. Lancichinetti and S. Fortunato, “Community detection algorithms: a comparative analysis,” Physical Review E, vol. 80, no. 5, 2009. View at Publisher · View at Google Scholar · View at Scopus
  5. L. Getoor and C. P. Diehl, “Link mining,” ACM SIGKDD Explorations Newsletter, vol. 7, no. 2, pp. 3–12, 2005. View at Publisher · View at Google Scholar
  6. L. Lü and T. Zhou, “Link prediction in complex networks: a survey,” Physica A: Statistical Mechanics and Its Applications, vol. 390, no. 6, pp. 1150–1170, 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. V. Martínez, C. Cano, and A. Blanco, “ProphNet: a generic prioritization method through propagation of information,” BMC Bioinformatics, vol. 15, no. S1, 2014. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Pavlov and R. Ichise, “Finding experts by link prediction in co-authorship networks,” Finding Experts on the Web with Semantics Workshop, vol. 290, pp. 42–55, 2007. View at Google Scholar
  9. L. Page, S. Brin, R. Motwani, and W. Terry, “The PageRank citation ranking: bringing order to the web,” Tech. Rep., Stanford InfoLab, Stanford, CA, USA, 1999, Technical Report. View at Google Scholar
  10. J. Ellson, E. Gansner, L. Koutsofios, S. C. North, and W. Gordon, “Graphviz–open source graph drawing tools,” in Graph Drawing, pp. 483-484, Springer, Berlin, Gemany, 2002. View at Google Scholar
  11. P. Shannon, A. Markiel, O. Owen et al., “Cytoscape: a software environment for integrated models of biomolecular interaction networks,” Genome Research, vol. 13, no. 11, pp. 2498–2504, 2003. View at Publisher · View at Google Scholar · View at Scopus
  12. G. Csardi and T. Nepusz, “The igraph software package for complex network research,” InterJournal, Complex Systems, vol. 1695, no. 5, pp. 1–9, 2006. View at Google Scholar
  13. D. A. Schult and P. Swart, “Exploring network structure, dynamics, and function using networkX,” in Proceedings of the 7th Python in Science Conferences (SciPy 2008), vol. 2008, pp. 11–16, Pasadena, CA, USA, August 2008.
  14. J. Leskovec and R. Sosič, “SNAP,” ACM Transactions on Intelligent Systems and Technology, vol. 8, no. 1, pp. 1–20, 2016. View at Publisher · View at Google Scholar · View at Scopus
  15. V. Batagelj and A. Mrvar, “Pajek-program for large network analysis,” Connections, vol. 21, no. 2, pp. 47–57, 1998. View at Google Scholar
  16. M. A. Smith, S. Ben, N. Milic-Frayling et al., “Analyzing (social media) networks with NodeXL,” in Proceedings of the Fourth International Conference on Communities and Technologies, pp. 255–264, ACM, University Park, PA, USA, June 2009.
  17. M. Bastian, S. Heymann, M. Jacomy et al., “Gephi: an open source software for exploring and manipulating networks,” International AAAI Conference on Weblogs and Social Media, vol. 8, pp. 361-362, 2009. View at Google Scholar
  18. S. P. Borgatti, M. G. Everett, and L. C. Freeman, “UCINET for windows: software for social network analysis,” Tech. Rep., Technical Report, Analytic Technologies, Lexington, KY, USA, 2002. View at Google Scholar
  19. J. Dean and S. Ghemawat, “MapReduce,” Communications of the ACM, vol. 51, no. 1, pp. 107–113, 2008. View at Publisher · View at Google Scholar · View at Scopus
  20. J. Leskovec and A. Krevl, SNAP Datasets: Stanford Large Network Dataset Collection, Stanford University, Stanford, CA, USA, 2014, http://snap.stanford.edu/data.
  21. M. E. J. Newman, Networks: An Introduction, Oxford University Press, Oxford, UK, 2010.
  22. M. O. Jackson, Social and Economic Networks, Princeton University Press, Princeton, NJ, USA, 2008.
  23. P. Erdős and A. Rényi, “On random graphs,” Publicationes Mathematicae Debrecen, vol. 6, pp. 290–297, 1959. View at Google Scholar
  24. E. N. Gilbert, “Random graphs,” The Annals of Mathematical Statistics, vol. 30, no. 4, pp. 1141–1144, 1959. View at Publisher · View at Google Scholar
  25. D. J. Watts and S. H. Strogatz, “Collective dynamics of “small-world” networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998. View at Publisher · View at Google Scholar
  26. R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,” Reviews of Modern Physics, vol. 74, no. 1, pp. 47–97, 2002. View at Publisher · View at Google Scholar · View at Scopus
  27. M. E. J. Newman, “The structure and function of complex networks,” SIAM Review, vol. 45, no. 2, pp. 167–256, 2003. View at Publisher · View at Google Scholar · View at Scopus
  28. M. Piraveenan, M. Prokopenko, and A. Y. Zomaya, “Local assortativeness in scale-free networks,” EPL (Europhysics Letters), vol. 84, no. 2, Article ID 28002, 2008. View at Publisher · View at Google Scholar · View at Scopus
  29. M. Piraveenan, M. Prokopenko, Y. Albert, and Zomaya, “Classifying complex networks using unbiased local assortativity,” in Proceedings of the Twelfth International Conference on the Synthesis and Simulation of Living Systems, pp. 329–336, Odense, Denmark, August 2010.
  30. P. Hage and F. Harary, “Eccentricity and centrality in networks,” Social Networks, vol. 17, no. 1, pp. 57–63, 1995. View at Publisher · View at Google Scholar · View at Scopus
  31. A. Bavelas, “Communication patterns in task-oriented groups,” The Journal of the Acoustical Society of America, vol. 22, no. 6, pp. 725–730, 1950. View at Publisher · View at Google Scholar · View at Scopus
  32. L. C. Freeman, “A set of measures of centrality based on betweenness,” Sociometry, vol. 40, no. 1, pp. 35–41, 1977. View at Publisher · View at Google Scholar
  33. J. M. Kleinberg, “Authoritative sources in a hyperlinked environment,” Journal of the ACM, vol. 46, no. 5, pp. 604–632, 1999. View at Publisher · View at Google Scholar · View at Scopus
  34. L. Katz, “A new status index derived from sociometric analysis,” Psychometrika, vol. 18, no. 1, pp. 39–43, 1953. View at Publisher · View at Google Scholar · View at Scopus
  35. C. Kang, C. Molinaro, S. Kraus, Y. Shavitt, and V. S. Subrahmanian, “Diffusion centrality in social networks,” in Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012), pp. 558–564, IEEE Computer Society, Istanbul Turkey, August 2012.
  36. M. Piraveenan, M. Prokopenko, and L. Hossain, “Percolation centrality: quantifying graph-theoretic impact of nodes during percolation in networks,” PLoS One, vol. 8, no. 1, Article ID e53095, 2013. View at Publisher · View at Google Scholar · View at Scopus
  37. M. R. Faghani and U. T. Nguyen, “A study of XSS worm propagation and detection mechanisms in online social networks,” IEEE Transactions on Information Forensics and Security, vol. 8, no. 11, pp. 1815–1826, 2013. View at Publisher · View at Google Scholar · View at Scopus
  38. M. Piraveenan, G. Thedchanamoorthy, S. Uddin, and K. S. K. Chung, “Quantifying topological robustness of networks under sustained targeted attacks,” Social Network Analysis and Mining, vol. 3, no. 4, pp. 939–952, 2013. View at Publisher · View at Google Scholar · View at Scopus
  39. T. M. J. Fruchterman and E. M. Reingold, “Graph drawing by force-directed placement,” Software: Practice and Experience, vol. 21, no. 11, pp. 1129–1164, 1991. View at Publisher · View at Google Scholar · View at Scopus
  40. T. Kamada and S. Kawai, “An algorithm for drawing general undirected graphs,” Information Processing Letters, vol. 31, no. 1, pp. 7–15, 1989. View at Publisher · View at Google Scholar · View at Scopus
  41. D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson, “The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations,” Behavioral Ecology and Sociobiology, vol. 54, no. 4, pp. 396–405, 2003. View at Publisher · View at Google Scholar · View at Scopus
  42. G. J. Wills, “NicheWorks: interactive visualization of very large graphs,” Journal of Computational and Graphical Statistics, vol. 8, no. 2, pp. 190–212, 1999. View at Publisher · View at Google Scholar · View at Scopus
  43. D. Liben-Nowell and J. Kleinberg, “The link-prediction problem for social networks,” Journal of the American Society for Information Science and Technology, vol. 58, no. 7, pp. 1019–1031, 2007. View at Publisher · View at Google Scholar · View at Scopus
  44. W. W. Zachary, “An information flow model for conflict and fission in small groups,” Journal of Anthropological Research, vol. 33, no. 4, pp. 452–473, 1977. View at Publisher · View at Google Scholar
  45. R. Sibson, “Slink: an optimally efficient algorithm for the single-link cluster method,” The Computer Journal, vol. 16, no. 1, pp. 30–34, 1973. View at Publisher · View at Google Scholar
  46. D. Defays, “An efficient algorithm for a complete link method,” The Computer Journal, vol. 20, no. 4, pp. 364–366, 1977. View at Publisher · View at Google Scholar
  47. B. Liu, Web Data Mining, Springer, Berlin, Germany, 2 edition, 2011.
  48. M. E. J. Newman, “Fast algorithm for detecting community structure in networks,” Physical Review E, vol. 69, no. 6, 2004. View at Publisher · View at Google Scholar · View at Scopus
  49. P. Schuetz and A. Caflisch, “Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement,” Physical Review E, vol. 77, no. 4, 2008. View at Publisher · View at Google Scholar · View at Scopus
  50. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell System Technical Journal, vol. 49, no. 2, pp. 291–307, 1970. View at Publisher · View at Google Scholar · View at Scopus
  51. J. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297, Oakland, CA, USA, January 1967.
  52. L. Hagen and A. B. Kahng, “New spectral methods for ratio cut partitioning and clustering,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 11, no. 9, pp. 1074–1085, 1992. View at Publisher · View at Google Scholar · View at Scopus
  53. A. Y. Ng, M. I. Jordan, Y. Weiss et al., “On spectral clustering: analysis and an algorithm,” Advances in Neural Information Processing Systems, vol. 2, pp. 849–856, 2002. View at Google Scholar
  54. J. Jianbo Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888–905, 2000. View at Publisher · View at Google Scholar · View at Scopus
  55. J. Yang and J. Leskovec, “Overlapping community detection at scale: a nonnegative matrix factorization approach,” in Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 587–596, ACM, Rome, Italy, February 2013.
  56. S. Fortunato, “Community detection in graphs,” Physics Reports, vol. 486, no. 3–5, pp. 75–174, 2010. View at Publisher · View at Google Scholar · View at Scopus
  57. M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E, vol. 69, no. 2, 2004. View at Publisher · View at Google Scholar · View at Scopus
  58. D. E. Knuth and S. GraphBase, A Platform for Combinatorial Computing, Addison-Wesley, Boston, MA, USA, 1st edition, 2009.
  59. M. E. J. Newman, “Clustering and preferential attachment in growing networks,” Physical Review E, vol. 64, no. 2, 2001. View at Publisher · View at Google Scholar · View at Scopus
  60. L. A. Adamic and E. Adar, “Friends and neighbors on the web,” Social Networks, vol. 25, no. 3, pp. 211–230, 2003. View at Publisher · View at Google Scholar · View at Scopus
  61. T. Zhou, L. Lü, and Y.-C. Zhang, “Predicting missing links via local information,” The European Physical Journal B, vol. 71, no. 4, pp. 623–630, 2009. View at Publisher · View at Google Scholar · View at Scopus
  62. V. Martínez, F. Berzal, and J.-C. Cubero, “Adaptive degree penalization for link prediction,” Journal of Computational Science, vol. 13, no. 1–9, 2016. View at Publisher · View at Google Scholar · View at Scopus
  63. J. Paul, “Étude comparative de la distribution florale dans une portion des alpes et des jura,” Bulletin de la Société Vaudoise des Sciences Naturelles, vol. 37, pp. 547–579, 1901. View at Google Scholar
  64. E. A. Leicht, P. Holme, and M. E. J. Newman, “Vertex similarity in networks,” Physical Review E, vol. 73, no. 2, 2006. View at Publisher · View at Google Scholar · View at Scopus
  65. G. Salton and M. J. McGill, Introduction to Modern Information Retrieval, McGraw-Hill, Inc., New York, NY, USA, 1986.
  66. T. Sørensen, “A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on Danish commons,” Biologiske Skrifter, vol. 5, pp. 1–34, 1948. View at Google Scholar
  67. E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A.-L. Barabási, “Hierarchical organization of modularity in metabolic networks,” Science, vol. 297, no. 5586, pp. 1551–1555, 2002. View at Publisher · View at Google Scholar · View at Scopus
  68. A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999. View at Publisher · View at Google Scholar · View at Scopus
  69. K. Pearson, “The problem of the random walk,” Nature, vol. 72, no. 1867, p. 342, 1905. View at Publisher · View at Google Scholar · View at Scopus
  70. H. Tong, C. Faloutsos, and J.-Y. Pan, “Fast random walk with restart and its applications,” in Proceedings of the Sixth International Conference on Data Mining ICDM’06, pp. 613–622, IEEE Computer Society, Hong Kong, China, December 2006.
  71. O. Vanunu and R. Sharan, “A propagation-based algorithm for inferring gene-disease assocations,” in Proceedings of the German Conference on Bioinformatics, pp. 54–52, Dresden, Germany, September 2008.
  72. F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens, “Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 3, pp. 355–369, 2007. View at Publisher · View at Google Scholar · View at Scopus
  73. P. Chebotarev and E. Shamis, “Matrix-forest theorems,” 2006, https://arxiv.org/abs/math/0602575. View at Google Scholar
  74. M. Ripeanu, I. Foster, and A. Iamnitchi, “Mapping the gnutella network: properties of large-scale peer-to-peer systems and implications for system design,” 2002, https://arxiv.org/ftp/cs/papers/0209/0209028.pdf. View at Google Scholar
  75. J. Leskovec and J. J. Mcauley, “Learning to discover social circles in ego networks,” in Proceedings of the Advances in Neural Information Processing Systems, pp. 539–547, Lake Tahoe, NV, USA, December 2012.
  76. R. D. Blumofe and C. E. Leiserson, “Scheduling multithreaded computations by work stealing,” Journal of the ACM, vol. 46, no. 5, pp. 720–748, 1999. View at Publisher · View at Google Scholar · View at Scopus
  77. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou, “Cilk: an efficient multithreaded runtime system,” Journal of Parallel and Distributed Computing, vol. 37, no. 1, pp. 55–69, 1996. View at Publisher · View at Google Scholar · View at Scopus
  78. D. Lea, “A Java fork/join framework,” in Proceedings of the ACM 2000 Conference on Java Grande, pp. 36–43, ACM, San Francisco, CA, USA, June 2000.
  79. D. Leijen, W. Schulte, and S. Burckhardt, “The design of a task parallel library,” ACM SIGPLAN Notices, vol. 44, no. 10, pp. 227–242, 2009. View at Publisher · View at Google Scholar
  80. M. D. McCool, A. D. Robison, and J. Reinders, Structured Parallel Programming: Patterns for Efficient Computation, Elsevier, Amsterdam, Netherlands, 2012.
  81. V. M. Gómez, “Supervised data mining in networks: link prediction and applications,” University of Granada, Granada, Spain, 2018, Ph.D. thesis. View at Google Scholar