Skip to main content

Classifying Class and Finding Community in UML Metamodel Network

  • Conference paper

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

Abstract

Composed of many classes or modules, big software can be represented with network model. By extracting the topology of UML metamodel from the UML metamodel specification, the scale-free, small-world networks properties are revealed. Based on this observation, we come up with our algorithms that can classify all classes in UML metamodel into three kinds: core, general and leaf. Our algorithm can categorize all classes into several subgroups by three factors, i.e., degree, betweenness and weak link. It is illustrated through case study that this algorithm is effective at mining community structure in large software systems.

This research project was supported by the National Natural Science Foundation of China under Grant No. 60373086, Wuhan Science & Technique Key Project under Grant No. 20021002043, Open Foundation of SKLSE under Grant No. 03-03, the Provincial Natural Science Foundation of Hubei under Grant No. 2002ABB037, Hubei Province Key Project under Grant No. 902130819.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Strogatz, S.H.: Exploring complex networks. Nature 410, 268–276 (2001)

    Article  Google Scholar 

  2. Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002)

    Article  MATH  Google Scholar 

  3. Myers, C.R.: Software systems as complex networks: Structure, function, and evolvability of software collaboration graphs. Rev. Mod. Phys. 68, 68–83 (2003)

    Google Scholar 

  4. Heaton, L.: Meta Object Facility (MOF) Specification Version 1.4 [EB/OL], http://www.omg.org/cgi-bin/doc?formal/2002-04-03,02-04-03/05-03-15

  5. Heaton, L.: Unified Modeling Language Specification Version 1.5 [EB/OL], http://www.omg.org/cgi-bin/doc?formal/03-03-01,03-03-01/05-03-15

  6. Selic, B.: Unified Modeling Language Specification Version 2.0 [EB/OL], http://www.omg.org/cgi-bin/doc?ptc/2004-10-02,04-10-02/05-03-15

  7. Newman, M.E.J.: Detecting Community Structure in Networks. Eur. Phys. J. B 38, 321–330 (2004)

    Article  Google Scholar 

  8. Csermely, P.: The strength of weak links: from stress proteins to social networks. Hungarian Science 111, 1318–1324 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, B., Li, D., Liu, J., He, F. (2005). Classifying Class and Finding Community in UML Metamodel Network. In: Li, X., Wang, S., Dong, Z.Y. (eds) Advanced Data Mining and Applications. ADMA 2005. Lecture Notes in Computer Science(), vol 3584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527503_81

Download citation

  • DOI: https://doi.org/10.1007/11527503_81

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27894-8

  • Online ISBN: 978-3-540-31877-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics