Advertisement

Derivatives in Graph Space with Applications for Finding and Tracking Local Communities

  • M. Amin RigiEmail author
  • Irene Moser
  • M. Mehdi Farhangi
Chapter
Part of the Lecture Notes in Social Networks book series (LNSN)

Abstract

Community detection in networks has gained a lot of attention especially after emergence of online social networks. Community detection methods in networks can be classified into two domains: global methods and local methods. Global methods need the whole information of the network, whereas the local ones need information of a certain area of the network where they want to discover communities. Real-world social networks are typically very large, making the global community detection methods impractical due to the computation expenses. Therefore, local community detection algorithms, which are requiring less computation and space, have met with renewed interest. In this research two derivative-based methods for finding and tracking local communities are proposed. Mapping the concepts of derivatives into graph space in a practical manner poses few challenges. For instance, in Euclidean space, every point has three dimensions, whereas in graph space the dimension (or degree) of every node can be different. Firstly, we propose a general framework for finding derivatives in graph space. This mentioned framework enables us to bring derivative-based methods into graph theory. Secondly, inspired by the active contour algorithm in computer vision domain, we propose a local derivative-based community detection method. The proposed method is built upon concepts of curvature and gradient of the community’s boundary. Curvature and gradient comprise a velocity function to determine whether the boundary should expand to include a candidate node in its vicinity. Finally, based on derivative-based concept of surface tension in chemistry, we propose a model for tracking local communities in dynamic networks where new nodes/edges are added in a stream of atomic changes. The binding forces between the molecules of the same liquid substance give them shape with the minimum surface tension. That is to say, if molecules of the same substance are added to the community, the surface tension should not increase. In the network context, if a node can be added to a community it reduces the surface tension of the community. Experimental results validate the superiority of the proposed methods.

Keywords

Local community detection Tracking community Derivatives in networks Surface tension 

References

  1. 1.
    Ames, W.F.: Nonlinear Partial Differential Equations in Engineering, vol. 18. Academic, New York (1965)CrossRefGoogle Scholar
  2. 2.
    Andersen, R., Lang, K.J.: Communities from seed sets. In: Proceedings of the 15th International Conference on World Wide Web, pp. 223–232. ACM, New York (2006)Google Scholar
  3. 3.
    Bagrow, J.P., Bollt, E.M.: Local method for detecting communities. Phys. Rev. E 72(4), 046108 (2005)CrossRefGoogle Scholar
  4. 4.
    Canu, M., Lesot, M.J., d’Allonnes, A.R.: Vertex-centred method to detect communities in evolving networks. In: International Workshop on Complex Networks and Their Applications, pp. 275–286. Springer, Berlin (2016)Google Scholar
  5. 5.
    Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. Int. J. Comput. Vis. 22(1), 61–79 (1997)CrossRefGoogle Scholar
  6. 6.
    Chen, J., Yuan, B.: Detecting functional modules in the yeast protein–protein interaction network. Bioinformatics 22(18), 2283–2290 (2006)CrossRefGoogle Scholar
  7. 7.
    Clauset, A.: Finding local community structure in networks. Phys. Rev. E 72(2), 026132 (2005)CrossRefGoogle Scholar
  8. 8.
    Coleman, J.S.: Introduction to Mathematical Sociology. London Free Press, Glencoe (1964)Google Scholar
  9. 9.
    Courant, R., Friedrichs, K., Lewy, H.: Über die partiellen differenzengleichungen der mathematischen physik. Math. Ann. 100(1), 32–74 (1928)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Diao, P., Guillot, D., Khare, A., Rajaratnam, B.: Differential calculus on graphon space. J. Comb. Theory Ser. A 133, 183–227 (2015)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Falkowski, T.: Community analysis in dynamic social networks. Ph.D. thesis, Otto-von-Guericke-University, Magdeburg (2009)Google Scholar
  12. 12.
    Farhangi, M.M., Frigui, H., Bert, R., Amini, A.A.: Incorporating shape prior into active contours with a sparse linear combination of training shapes: application to corpus callosum segmentation. In: 2016 IEEE 38th Annual International Conference of the Engineering in Medicine and Biology Society (EMBC), pp. 6449–6452. IEEE, Piscataway (2016)Google Scholar
  13. 13.
    Farhangi, M.M., Frigui, H., Seow, A., Amini, A.A.: 3-D active contour segmentation based on sparse linear combination of training shapes (SCoTS). IEEE Trans. Med. Imaging 36(11), 2239–2249 (2017)CrossRefGoogle Scholar
  14. 14.
    Friedman, J., Tillich, J.P.: Calculus on graphs. arXiv preprint cs/0408028 (2004)Google Scholar
  15. 15.
    Görke, R., Kluge, R., Schumm, A., Staudt, C., Wagner, D.: An efficient generator for clustered dynamic random networks. In: Proceedings of the Design and Analysis of Algorithms – First Mediterranean Conference on Algorithms. Lecture Notes in Computer Science, vol. 7659, pp. 219–233. Springer, Berlin (2012)Google Scholar
  16. 16.
    Golub, G.H., Van Loan, C.F.: Matrix Computations, vol. 3. JHU Press, Baltimore (2012)zbMATHGoogle Scholar
  17. 17.
    Jeub, L.G., Balachandran, P., Porter, M.A., Mucha, P.J., Mahoney, M.W.: Think locally, act locally: detection of small, medium-sized, and large communities in large networks. Phys. Rev. E 91(1), 012821 (2015)CrossRefGoogle Scholar
  18. 18.
    Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604–632 (1999)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Kottak, C.P.: Cultural Anthropology: Appreciating Cultural Diversity. McGraw-Hill, New York (2011)Google Scholar
  20. 20.
    Krishnamurthy, B., Wang, J.: On network-aware clustering of web clients. ACM SIGCOMM Comput. Commun. Rev. 30(4), 97–110 (2000)CrossRefGoogle Scholar
  21. 21.
    Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009)CrossRefGoogle Scholar
  22. 22.
    Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems, vol. 15. SIAM, Philadelphia (1995)CrossRefGoogle Scholar
  23. 23.
    Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 177–187. ACM, New York (2005)Google Scholar
  24. 24.
    Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29–123 (2009)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Mahoney, M.W., Orecchia, L., Vishnoi, N.K.: A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally. J. Mach. Learn. Res. 13(1), 2339–2365 (2012)MathSciNetzbMATHGoogle Scholar
  26. 26.
    Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. Adv. Neural Inf. Process. Syst. 2, 849–856 (2002)Google Scholar
  27. 27.
    Nguyen, N.P., Dinh, T.N., Tokala, S., Thai, M.T.: Overlapping communities in dynamic networks: their detection and mobile applications. In: Proceedings of the 17th Annual International Conference on Mobile Computing and Networking, pp. 85–96. ACM, New York (2011)Google Scholar
  28. 28.
    Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846–850 (1971)CrossRefGoogle Scholar
  29. 29.
    Rigi, M.A., Moser, I., Rigi, S., Liu, C.: Re-imaging the networks: detecting local communities in networks by approximating derivatives in graph space. In: Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM ’17), pp. 974–981. ACM, New York (2017)Google Scholar
  30. 30.
    Rives, A.W., Galitski, T.: Modular organization of cellular networks. Proc. Natl. Acad. Sci. 100(3), 1128–1133 (2003)CrossRefGoogle Scholar
  31. 31.
    Samie, M.E., Hamzeh, A.: Community detection in dynamic social networks: a local evolutionary approach. J. Inf. Sci. 43(5), 615–634 (2017)CrossRefGoogle Scholar
  32. 32.
    Shang, J., Liu, L., Li, X., Xie, F., Wu, C.: Targeted revision: a learning-based approach for incremental community detection in dynamic networks. Phys A: Stat. Mech. Appl. 443(Suppl. C), 70–85 (2016)CrossRefGoogle Scholar
  33. 33.
    Sobolevsky, S., Campari, R., Belyi, A., Ratti, C.: General optimization technique for high-quality community detection in complex networks. Phys. Rev. E 90(1), 012811 (2014)CrossRefGoogle Scholar
  34. 34.
    Solomon, J.: PDE approaches to graph analysis. arXiv preprint, arXiv:1505.00185 (2015)Google Scholar
  35. 35.
    Spiliopoulou, M., Ntoutsi, I., Theodoridis, Y., Schult, R.: Monic: modeling and monitoring cluster transitions. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 706–711. ACM, New York (2006)Google Scholar
  36. 36.
    Sun, J., Faloutsos, C., Papadimitriou, S., Yu, P.S.: Graphscope: parameter-free mining of large time-evolving graphs. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 687–696. ACM, New York (2007)Google Scholar
  37. 37.
    Ta, V.-T., Elmoataz, A., Lézoray, O.: Partial difference equations over graphs: morphological processing of arbitrary discrete data. In: European Conference on Computer Vision, pp. 668–680. Springer, Berlin (2008)Google Scholar
  38. 38.
    Tong, H., Papadimitriou, S., Sun, J., Yu, P.S., Faloutsos, C.: Colibri: fast mining of large static and dynamic graphs. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 686–694. ACM, New York (2008)Google Scholar
  39. 39.
    Toyoda, M., Kitsuregawa, M.: Creating a web community chart for navigating related communities. In: Proceedings of the 12th ACM Conference on Hypertext and Hypermedia (HYPERTEXT ’01), pp. 103–112. ACM, New York (2001)Google Scholar
  40. 40.
    Traud, A.L., Mucha, P.J., Porter, M.A.: Social structure of Facebook networks. Phys. A: Stat. Mech. Appl. 391(16), 4165–4180 (2012)CrossRefGoogle Scholar
  41. 41.
    Xu, T., Zhang, Z., Yu, P.S., Long, B.: Generative models for evolutionary clustering. ACM Trans. Knowl. Discov. Data 6(2), 7 (2012)CrossRefGoogle Scholar
  42. 42.
    Yang, T., Chi, Y., Zhu, S., Gong, Y., Jin, R.: Detecting communities and their evolutions in dynamic social networks—a Bayesian approach. Mach. Learn. 82(2), 157–189 (2011)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • M. Amin Rigi
    • 1
    Email author
  • Irene Moser
    • 1
  • M. Mehdi Farhangi
    • 2
  1. 1.Swinburne University of TechnologyMelbourneAustralia
  2. 2.University of LouisvilleLouisvilleUSA

Personalised recommendations