Skip to main content

Extracting Communities in Networks Based on Functional Properties of Nodes

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7457))

Abstract

We address the problem of extracting the groups of functionally similar nodes from a network. As functional properties of nodes, we focus on hierarchical levels, relative locations and/or roles with respect to the other nodes. For this problem, we propose a novel method for extracting functional communities from a given network. In our experiments using several types of synthetic and real networks, we evaluate the characteristics of functional communities extracted by our proposed method. From our experimental results, we confirmed that our method can extract functional communities, each of which consists of nodes with functionally similar properties, and these communities are substantially different from those obtained by the Newman clustering method.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • 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. Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Physical Review E 69(6), 066133 (2004)

    Article  Google Scholar 

  2. Seidman, S.B.: Network structure and minimum degree. Social Networks 5(3), 269–287 (1983)

    Article  MathSciNet  Google Scholar 

  3. Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)

    Article  Google Scholar 

  4. Langville, A.N., Meyer, C.D.: Deeper inside pagerank. Internet Mathematics 1(3), 335–380 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Mathematical Programming 14, 265–294 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ravasz, E., Barabási, A.L.: Hierarchical organization in complex networks. Physical Review E 67(2), 026112 (2003)

    Article  Google Scholar 

  7. Zachary, W.W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)

    Google Scholar 

  8. Yamada, T., Saito, K., Ueda, N.: Cross-entropy directed embedding of network data. In: Proceedings of the 20th International Conference on Machine Learning (ICML 2003), pp. 832–839 (2003)

    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

Fushimi, T., Saito, K., Kazama, K. (2012). Extracting Communities in Networks Based on Functional Properties of Nodes. In: Richards, D., Kang, B.H. (eds) Knowledge Management and Acquisition for Intelligent Systems. PKAW 2012. Lecture Notes in Computer Science(), vol 7457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32541-0_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32541-0_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32540-3

  • Online ISBN: 978-3-642-32541-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics