Skip to main content

Towards Democratic Group Detection in Complex Networks

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNISA,volume 7227)

Abstract

To detect groups in networks is an interesting problem with applications in social and security analysis. Many large networks lack a global community organization. In these cases, traditional partitioning algorithms fail to detect a hidden modular structure, assuming a global modular organization. We define a prototype for a simple local-first approach to community discovery, namely the democratic vote of each node for the communities in its ego neighborhood. We create a preliminary test of this intuition against the state-of-the-art community discovery methods, and find that our new method outperforms them in the quality of the obtained groups, evaluated using metadata of two real world networks. We give also the intuition of the incremental nature and the limited time complexity of the proposed algorithm.

Keywords

  • Crime Prevention
  • Label Propagation
  • Real World Network
  • Community Quality
  • Quantitative Attribute

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahn, Y.-Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761–764 (2010)

    CrossRef  Google Scholar 

  2. Coscia, M., Giannotti, F., Pedreschi, D.: A classification for community discovery methods in complex networks. SAM 4(5), 512–546 (2011)

    MathSciNet  Google Scholar 

  3. Derényi, I., Palla, G., Vicsek, T.: Clique Percolation in Random Networks. Physical Review Letters 94(16), 160202 (2005)

    CrossRef  Google Scholar 

  4. Fortunato, S., Barthélemy, M.: Resolution limit in community detection. Proceedings of the National Academy of Sciences 104(1), 36–41 (2007)

    CrossRef  Google Scholar 

  5. Goyal, A., On, B.-W., Bonchi, F., Lakshmanan, L.V.S.: Gurumine: A pattern mining system for discovering leaders and tribes. In: International Conference on Data Engineering, pp. 1471–1474 (2009)

    Google Scholar 

  6. Henderson, K., Eliassi-Rad, T., Papadimitriou, S., Faloutsos, C.: Hcdf: A hybrid community discovery framework. In: SDM, pp. 754–765 (2010)

    Google Scholar 

  7. Newman, M.E.J.: Modularity and community structure in networks. Proceedings of the National Academy of Sciences 103(23), 8577–8582 (2006)

    CrossRef  Google Scholar 

  8. Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Physical Review E (2007)

    Google Scholar 

  9. Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. PNAS 105(4), 1118–1123 (2008)

    CrossRef  Google Scholar 

  10. Shen, H.-W., Cheng, X.-Q., Guo, J.-F.: Quantifying and identifying the overlapping community structure in networks. J. Stat. Mech. (2009)

    Google Scholar 

  11. Yonas, M.A., Borrebach, J.D., Burke, J.G., Brown, S.T., Philp, K.D., Burke, D.S., Grefenstette, J.J.: Dynamic Simulation of Community Crime and Crime-Reporting Behavior. In: Salerno, J., Yang, S.J., Nau, D., Chai, S.-K. (eds.) SBP 2011. LNCS, vol. 6589, pp. 97–104. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coscia, M., Giannotti, F., Pedreschi, D. (2012). Towards Democratic Group Detection in Complex Networks. In: Yang, S.J., Greenberg, A.M., Endsley, M. (eds) Social Computing, Behavioral - Cultural Modeling and Prediction. SBP 2012. Lecture Notes in Computer Science, vol 7227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29047-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29047-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29046-6

  • Online ISBN: 978-3-642-29047-3

  • eBook Packages: Computer ScienceComputer Science (R0)