Conference Paper2015

Fusion based approach to discovering social circles in EGO networks

A Kamal, MM Lutfe Elahi, Bruce Poon, M Ashraful Amin

2015 International Conference on Machine Learning and Cybernetics (ICMLC)

IEEE, Vol. 2, pp. 511–517

DOI: 10.1109/icmlc.2015.7340609URL

CCDS Authors

M Ashraful Amin, PhD

M Ashraful Amin, PhD

Founder DirectorDirector, Artificial Intelligence & Machine Learing WingDirector, Human-Computer Interaction WingDirector, Data Science Wing

References

  1. 1.Vincent D. Blondel, Jean‐Loup Guillaume, Renaud Lambiotte, Etienne Lefebvre. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics Theory and Experiment, 2008(10), P10008[10.1088/1742-5468/2008/10/p10008]
  2. 2.Michael Newman. (2003). The Structure and Function of Complex Networks. SIAM Review, 45(2), 167–256[10.1137/s003614450342480]
  3. 3.Michelle Girvan, M. E. J. Newman. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12), 7821–7826[10.1073/pnas.122653799]
  4. 4.Michelle G. Newman, Michelle Girvan. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113[10.1103/physreve.69.026113]
  5. 5.Ulrike von Luxburg. (2007). A tutorial on spectral clustering. Statistics and Computing, 17(4), 395–416[10.1007/s11222-007-9033-z]
  6. 6.M. E. J. Newman. (2004). Fast algorithm for detecting community structure in networks. Physical Review E, 69(6), 066133[10.1103/physreve.69.066133]
  7. 7.M. E. J. Newman. (2006). Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3), 036104[10.1103/physreve.74.036104]
  8. 8.Martin Rosvall, Carl T. Bergstrom. (2008). Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences, 105(4), 1118–1123[10.1073/pnas.0706851105]
  9. 9.Usha Nandini Raghavan, Réka Albert, Soundar Kumara. (2007). Near linear time algorithm to detect community structures in large-scale networks. Physical Review E, 76(3), 036106[10.1103/physreve.76.036106]
  10. 10.Filippo Radicchi, Claudio Castellano, Federico Cecconi, Vittorio Loreto, Domenico Parisi. (2004). Defining and identifying communities in networks. Proceedings of the National Academy of Sciences, 101(9), 2658–2663[10.1073/pnas.0400054101]
  11. 11.Jörg Reichardt, Stefan Bornholdt. (2006). Statistical mechanics of community detection. Physical Review E, 74(1), 016110[10.1103/physreve.74.016110]
  12. 12.Pascal Pons, Matthieu Latapy. (2005). Computing Communities in Large Networks Using Random Walks. Lecture notes in computer science, 284–293[10.1007/11569596_31]
  13. 13.Martin Rosvall, D. Axelsson, Carl T. Bergstrom. (2009). The map equation. The European Physical Journal Special Topics, 178(1), 13–23[10.1140/epjst/e2010-01179-1]
  14. 14.Stijn van Dongen. (2008). Graph Clustering Via a Discrete Uncoupling Process. SIAM Journal on Matrix Analysis and Applications, 30(1), 121–141[10.1137/040608635]
  15. 15.Julian McAuley, Jure Leskovec. (2014). Discovering social circles in ego networks. ACM Transactions on Knowledge Discovery from Data, 8(1), 1–28[10.1145/2556612]
  16. 16.Donetti, L, Muñoz, M A. (2005). Improved spectral algorithm for the detection of network communities.
  17. 17.Vincent Labatut, Hocine Cherifi, Hal Id Hal, Günce Keziban Orman, Hocine Cherifi. (2011). On Accuracy of Community Structure Discovery Algorithms.
  18. 18.Luca Donetti. (2005). Improved spectral algorithm for the detection of network communities. AIP conference proceedings, 779, 104–107[10.1063/1.2008598]
← All publications
Fusion based approach to discovering social circles in EGO networks | CCDS