Skip to main content
Log in

Irregular community discovery for cloud service improvement

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Utility services provided by cloud computing rely on virtual customer communities forming spontaneously and evolving continuously. Clarifying the explicit boundaries of these communities is thus essential to the quality of utility services in cloud computing. Communities with overlapping features or prominent peripheral vertexes are usually typical irregular communities. Traditional community identification algorithms are limited in discovering irregular topological structures from CR networks, whereas these irregular shapes typically play an important role in finding prominent customers which are ignored in social CRM otherwise. We present a novel method of discovering irregular communities. It firstly finds and merges primitive maximal cliques and the irregular features of overlapping and prominent sparse vertices are further considered. An empirical case and a methodology comparison confirm the feasibility and efficiency of our approach.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Avlonitis GJ, Panagopoulos NG (2005) Antecedents and consequences of CRM technology acceptance in the sales force. Ind Mark Manag 34:355–368

    Article  Google Scholar 

  2. Capocci A, Servedio V, Colaiori F, Caldarelli G (2004) Detecting communities in large networks. Condens Matter, 0402499

  3. Capocci VD, Servedio P, Caldarelli G (2005) Detecting communities in large networks. Physica A 352:669–676

    Article  Google Scholar 

  4. Cazals F, Karande C (2005) An algorithm for reporting maximal c-cliques. Theor Comput Sci 349(3):484–490

    Article  MathSciNet  MATH  Google Scholar 

  5. Cazals F, Karande C (2007) Reporting maximal cliques: new insights. Rapport de recherché. 5615, INRIA

  6. China’s white book of cloud computing, CIE (2010) http://www.cie-info.org.cn/

  7. Chua HN, Wong L (2008) Increasing the reliability of protein interactomes. Drug Discov Today 13(1516):652–658

    Article  Google Scholar 

  8. Clauset A, Newman MEJ (2004) Finding community structure in very large networks. Phys Rev E 70:066111

    Article  Google Scholar 

  9. Cloud computing, Wikipedia (2009) http://en.wikipedia.org/wiki/Cloud_Computing

  10. Crowd computing, Wikipedia (2009) http://en.wikipedia.org/wiki/Crowd_computing, Dec 7

  11. Danon L, Duch J, Diaz-Guilera A, Arenas A (2005) Comparing community structure identification. J Stat Mech P09008

  12. Donetti L, Mũnoz MA (2004) Detecting network communities, a new systematic and efficient algorithm. J Stat Mech Theory Exp P10012

  13. Fortunato S, Latora V, Marchiori M (2004) A method to find community structures based on information centrality. Condens Matter 0402522

  14. Golumbic M (2004) Algorithmic graph theory and perfect graphs, 2nd edn. Elsevier, Amsterdam

    MATH  Google Scholar 

  15. Koch I, Wanke E, Lengauer T (1996) An algorithm for finding maximal common subtopologies in a set of protein structures. J Comput Biol 3(2):289–306

    Article  Google Scholar 

  16. Newman MEJ (2003) Mixing patterns in networks. Phys Rev E 67:026126

    Article  MathSciNet  Google Scholar 

  17. Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:066111

    Article  Google Scholar 

  18. Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113

    Article  Google Scholar 

  19. Pujol JM, Béjar J, Delgado J (2006) Clustering algorithm for determining community structure in large networks. Phys Rev E 74:016107

    Article  Google Scholar 

  20. Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proc Natl Acad Sci USA 101:2658–2663

    Article  Google Scholar 

  21. Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proc Natl Acad Sci USA 101(9):2658–2663

    Article  Google Scholar 

  22. reCAPTCHA, Wikipedia (2009) http://en.wikipedia.org/wiki/ReCAPTCHA, Dec 7

  23. Rosvall M, Bergstrom CT (2007) An information-theoretic framework for resolving community structure in complex networks. Proc Nat Acad Sci USA 18(2007):7327–7331

    Article  Google Scholar 

  24. Social CRM Wikipedia (2009) http://en.wikipedia.org/wiki/Oracle_CRM#Social_CRM

  25. Wang J, Zhou H, Zhou M, Li L (2006) A general model for long-tailed network traffic approximation. J Supercomput 38(2):155–172

    Article  MathSciNet  Google Scholar 

  26. Wu F, Huberman BA, (2004) Eur Phys J B 38:331–338

    Article  Google Scholar 

  27. Xu J, Jin H (2009) A structured P2P network based on the small world phenomenon. J Supercomput 48(3):264–285

    Article  Google Scholar 

  28. Zhang SH, Wang RS, Zhang XS (2007) Identification of overlapping community structure in complex networks. Physical A 374:483–490

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jin Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, J., Zhou, J., Wang, J. et al. Irregular community discovery for cloud service improvement. J Supercomput 61, 317–336 (2012). https://doi.org/10.1007/s11227-010-0446-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-010-0446-7

Keywords

Navigation