Talk:Label propagation algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Label Propagation AlgorithmS are a broad family of algorithms, this page is only about the seminal RAK algorithm[edit]

This page on Label Propagation Algorithm(s) (LPAs) is nowadays misleading, as in the last decade the seminal paper by Raghavan et al. (the RAK LPA) has been followed by a broad class of variants. The article should be updated accordingly, presenting LPAs as a class of algorithms, of which RAK has been the first instance. Here are some references corroborating my point

  1. M. J. Barber and J. W. Clark, “Detecting network communities by propagating labels under constraints,” Physical Review E, vol. 80, no. 2, Aug. 2009.
  2. S. Gregory, “Finding overlapping communities in networks by label propagation,” New Journal of Physics, vol. 12, no. 10, p. 103018, 2010.
  3. X. Liu and T. Murata, “Advanced modularity-specialized label propagation algorithm for detecting communities in networks,” Physica A: Statistical Mechanics and its Applications, vol. 389, no. 7, pp. 1493–1500, Apr. 2010.
  4. P. Boldi, M. Rosa, M. Santini, and S. Vigna, “Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks,” in Proceedings of the 20th international conference on World wide web, 2011, pp. 587–596.
  5. L. Šubelj and M. Bajec, “Robust network community detection using balanced propagation,” Eur. Phys. J. B, vol. 81, no. 3, pp. 353–362, Jun. 2011.
  6. L. Šubelj and M. Bajec, “Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction,” Phys. Rev. E, vol. 83, no. 3, p. 036103, Mar. 2011.
  7. J. Xie and B. K. Szymanski, “Community detection using a neighborhood strength driven label propagation algorithm,” in Network Science Workshop (NSW), 2011 IEEE, 2011, pp. 188–195.
  8. G. Cordasco and L. Gargano, “Label propagation algorithm: a semi-synchronous approach,” International Journal of Social Network Mining, vol. 1, no. 1, p. 3, 2012.
  9. K. Kothapalli, S. V. Pemmaraju, and V. Sardeshmukh, “On the analysis of a label propagation algorithm for community detection,” in International Conference on Distributed Computing and Networking, 2013, pp. 255–269.
  10. J. Ugander and L. Backstrom, “Balanced label propagation for partitioning massive graphs,” in Proceedings of the sixth ACM international conference on Web search and data mining, 2013, pp. 507–516.
  11. J. Xie and B. K. Szymanski, “Labelrank: A stabilized label propagation algorithm for community detection in networks,” in Network Science Workshop (NSW), 2013 IEEE 2nd, 2013, pp. 138–143.
  12. A. Clementi, M. Di Ianni, G. Gambosi, E. Natale, and R. Silvestri, “Distributed community detection in dynamic graphs,” Theoretical Computer Science, 2015.

--Natematic (talk) 11:15, 17 March 2018 (UTC)[reply]

(I am not sure I'm flagging this issue in the article page using the proper template.) --Natematic (talk) 11:15, 17 March 2018 (UTC)[reply]
This does seem flag-appropriate, especially since no reference has been made to Raghavan. 2406:7400:94:B6BC:1DC4:6B6:AE2F:7165 (talk) 09:10, 20 April 2024 (UTC)[reply]