본문 바로가기
  • Home

A Structural Complexity Metric for Web Application based on Similarity

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2010, 15(8), pp.117-126
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Woosung Jung 1 LEE, EUN JOO 2

1서울대학교
2경북대학교

Accredited

ABSTRACT

Software complexity is used to evaluate a target system's maintainability. The existing complexity metrics on web applications are count-based, so it is hard to incorporate the understandability of developers or maintainers. To make up for this shortcomings, entropy-theory can be applied to define complexity, however, it is assumed that information quantity of each paper is identical. In this paper, structural complexity of a web application is defined based on information theory and similarity. In detail, the proposed complexity is defined using entropy as the previous approach, but the information quantity of individual pages is defined using similarity. That is, a page which are similar with many pages has smaller information quantity than a page which are dissimilar to others. Furthermore, various similarity measures can be used for various views, which results in many-sided complexity measures. Finally, several complexity properties are applied to verify the proposed metric and case studies shows the applicability of the metric.

Citation status

* References for papers published after 2022 are currently being built.

This paper was written with support from the National Research Foundation of Korea.