Advertisement

Autonomous Agents and Multi-Agent Systems

, Volume 20, Issue 2, pp 123–157 | Cite as

An autonomy-oriented computing approach to community mining in distributed and dynamic networks

  • Bo Yang
  • Jiming LiuEmail author
  • Dayou Liu
Article

Abstract

A network community refers to a special type of network structure that contains a group of nodes connected based on certain relationships or similar properties. Our ability to mine communities hidden inside networks will readily enable us to effectively understand and exploit such networks. So far, various methods and algorithms have been developed to perform the task of community mining, where it is often required that the networks are processed in a centralized manner, and their structures will not dynamically change. However, in the real world, many applications involve distributed and dynamically evolving networks, in which resources and controls are not only decentralized but also updated frequently. It would be difficult for the existing methods to deal with these types of networks since their global topological representations are either not available or too hard to obtain due to their huge size, decentralization, and/or dynamic updates. The aim of our work is to address the problem of mining communities from a distributed and dynamic network. It differs from the previous ones in that here we introduce the notion of self-organizing agent networks, and provide an autonomy-oriented computing (AOC) approach to distributed and incremental mining of network communities. The AOC-based method utilizes reactive agents that can collectively detect and update community structures in a distributed and dynamically evolving network, based only on their local views and interactions. While providing detailed formulations, we present the results of our systematic validations using real-world benchmark networks as well as synthetic networks that include a distributed intelligent Portable Digital Assistant (iPDA) network example.

Keywords

Social networks Distributed networks Community mining Autonomy-oriented computing Self-organization Agent networks Multi-agent systems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bae K., Yoon H. (2005) Autonomous clustering scheme for wireless sensor networks using coverage estimation-based self-pruning. IEICE Transactions on Communications, E88 B(3): 973–980CrossRefGoogle Scholar
  2. 2.
    Bui, T. N., & Rizzo, J. R. (2004). Finding maximum cliques with distributed ants. In Proceedings of the conference on genetic and evolutionary computation (pp. 24–35). Springer.Google Scholar
  3. 3.
    Chakrabarti, S., Van Der Berg, M., & Dom, B. (1999). Focused crawling: A new approach to topic-specific web resource discovery. In Proceedings of the eighth international conference on world wide web (pp. 1623–1640). ACM Press.Google Scholar
  4. 4.
    Fiedler M. (1973) Algebraic connectivity of graphs. Czechoslovakian Mathematical Journal 23(2): 298–305MathSciNetGoogle Scholar
  5. 5.
    Flake G.W., Lawrence S., Giles C.L., Coetzee F.M. (2002) Self-organization and identification of web communities. IEEE Computer 35(3): 66–71Google Scholar
  6. 6.
    Freeman L.C. (1977) A set of measures of centrality based upon betweenness. Sociometry 40(1): 35–41CrossRefGoogle Scholar
  7. 7.
    Girvan M., Newman M.E.J. (2002) Community structure in social and biological networks. Proceedings of National Academy of Science (PNAS) 99(12): 7821–7826zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Jennings, E., & Motyckova, L. (1992). A distributed algorithm for finding all maximal cliques in a network graph. In Proceedings of the first Latin American symposium on theoretical informatics (pp. 281–293). Springer.Google Scholar
  9. 9.
    Jünger, M., & Mutzel, P. (2003). Graph drawing software (mathematics and visualization). Springer.Google Scholar
  10. 10.
    Kernighan B.W., Lin S. (1970) An efficient heuristic procedure for partitioning graphs. Bell System Technical 49(1): 291–307Google Scholar
  11. 11.
    Kleinberg J.M. (1999) Authoritative sources in a hyperlinked environment. Journal of ACM 46(5): 604–632zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999). Trawling the web for emerging cyber-communities. In Proceedings of the eighth international conference on world wide web (pp. 1481–1493). ACM Press.Google Scholar
  13. 13.
    Liu, J. (2008). Autonomy-Oriented Computing (AOC): The nature and implications of a paradigm for self-organized computing. In Proceedings of the fourth international conference on natural computation (Keynote talk) (pp. 3–11). IEEE Computer Society.Google Scholar
  14. 14.
    Liu, J., Jin, X. L., & Tsui. K. C. (2004). Autonomy oriented computing. Springer/Kluwer Academic Publishers.Google Scholar
  15. 15.
    Liu J., Jin X.L., Tsui K.C. (2005) Autonomy oriented computing (AOC): Formulating computational systems with autonomous components. IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans 35(6): 879–902CrossRefGoogle Scholar
  16. 16.
    Lusseau D. (2003) The emergent properties of a dolphin social network. Proceedings of the Royal Society of London—Series B 270(Suppl. 2): S186–S188CrossRefGoogle Scholar
  17. 17.
    Meka, A., & Singh, A. K. (2006). Distributed spatial clustering in sensor networks. In Proceedings of the tenth international conference on extending database technology (pp. 980–1000). Springer.Google Scholar
  18. 18.
    Newman M.E.J. (2004) Detecting community structure in networks. European Physical Journal B 38(2): 321–330CrossRefGoogle Scholar
  19. 19.
    Newman M.E.J. (2004) Fast algorithm for detecting community structure in networks. Physical Review E 69(6): 066133CrossRefGoogle Scholar
  20. 20.
    Newman M.E.J., Girvan M. (2004) Finding and evaluating community structure in networks. Physical Review E 69(2): 026113CrossRefGoogle Scholar
  21. 21.
    Pirolli, P., Pitkow, J., & Rao, R. (1996). Silk from a sow’s ear: Extracting usable structures from the web. In Proceedings of the ACM conference on human factors in computing systems (pp. 118–125). ACM Press.Google Scholar
  22. 22.
    Pothen A., Simon H., Liou K.P. (1990) Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis and Application 11(3): 430–452zbMATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Radicchi F., Castellano C., Cecconi F., Loreto V., Parisi D. (2004) Defining and identifying communities in networks. Proceedings of National Academy of Science (PNAS) 101(9): 2658–2663CrossRefGoogle Scholar
  24. 24.
    Scott, J. (2000). Social network analysis: A handbook (2nd ed.). Sage Publications.Google Scholar
  25. 25.
    Shi J., Malik J. (2000) Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligent 22(8): 888–904CrossRefGoogle Scholar
  26. 26.
    Tyler, J. R., Wilkinson, D. M., & Huberman, B. A. (2003). Email as spectroscopy: Automated discovery of community structure within organizations. In Proceedings of the first conference on communities and technologies (pp. 81–96). Kluwer Academic Publishers.Google Scholar
  27. 27.
    Wilkinson D.M., Huberman B.A. (2004) A method for finding communities of related genes. Proceedings of National Academy of Science (PNAS) 101(1): 5241–5248CrossRefGoogle Scholar
  28. 28.
    Wokoma, I., Shum, L. L., Sacks, L., & Marshall, I. (2005). A biologically-inspired clustering algorithm dependent on spatial data in sensor networks. In Proceedings of the second European workshop on wireless sensor networks (pp. 386–390). IEEE Computer Society.Google Scholar
  29. 29.
    Wu F., Huberman B.A. (2004) Finding communities in linear time: A physics approach. European Physical Journal B 38(2): 331–338CrossRefGoogle Scholar
  30. 30.
    Yang B., Cheung W.K., Liu J. (2007) Community mining from signed social networks. IEEE Transactions on Knowledge and Data Engineering 19(10): 1333–1348CrossRefGoogle Scholar
  31. 31.
    Zachary W.W. (1977) An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33(4): 452–473Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.College of Computer Science and TechnologyJilin UniversityChangchunChina
  2. 2.Department of Computer ScienceHong Kong Baptist UniversityKowloonHong Kong

Personalised recommendations