مقاله

A partition-based algorithm for clustering large-scale software systems

دانلود متن کاملرایگان، با حساب کاربری؛ ثبت نام با گوگل چند ثانیه است

چکیده(به انگلیسی؛ چکیده‌ی فارسی در دسترس نیست)

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawbacks such as finiteness criterion and arbitrary decisions occurred in the process. Because of the NP-hardness of clustering software systems, evolutionary and search-based algorithms are more commonly used algorithm than hierarchical ones. In evolutionary algorithms, the clustering of software systems is considered as a problem of searching over some possible clustering candidates. Although these algorithms are often able to achieve an appropriate structure of the software, they are not applicable in clustering large-scale software. Furthermore, these algorithms are unable to consider the knowledge in the artifact dependency graph, which extracted from the source code of the software. In software systems, an artifact can be everything such as a class, a function, or a file. In this paper, a new partition-based clustering algorithm is presented. This algorithm attempts to partition the artifact dependency graph considering the knowledge therein. Moreover, a new distance criterion is presented to measure the similarity and dissimilarity of the artifacts. The proposed algorithm starts with the artifact dependency graph and creates the similarity matrices of the artifacts. So, it attempts to refine the partition candidate until a fixed point is reached. We expect that the proposed method compared to other methods could lead to achieve the clustering with high quality and similar to the expertchr('39')s clustering based on MoJo-FM measure. To demonstrate the applicability and validity of the proposed algorithm, a large-scale case study, Mozilla Firefox, is employed. The results demonstrate that the proposed algorithm outperforms the commonly used evolutionary methods in the literature.

نویسندگان و وابستگی سازمانی
  1. Izadkhah, Habib
  2. Sh. Lotfi — Computer Science, University of Tabriz, Tabriz, Iran.
  3. Pourasghar, Babak
  4. Salehi, Khayyam

اسناد مشابه

  • A partition-based algorithm for clustering large-scale software systems

    مقاله‌ی دسترسی آزاد۲۰۲۲?????? ????? ? ??????['Babak Pourasghar', 'Habib Izadkhah', 'Shahriar Lotfi', 'Khayyam Salehi', '']

    ‫و‬ 3 ‫ایران‬ ‫تبریز،‬ ‫تبریز،‬ ‫دانشگاه‬ ‫ریاضی،‬ ‫علوم‬ ‫دانشکده‬ ‫کامپیوتر،‬ ‫علوم‬ ‫گروه‬ 4 ‫کامپ‬ ‫علوم‬ ‫گروه‬ ‫ی‬ ‫وتر،‬ ‫عل‬ ‫دانشکده‬ ‫ر‬ ‫وم‬ ‫ی‬ ‫اض‬ ‫ی‬ ، ‫ا‬ ‫شهرکرد،‬ ‫شهرکرد،‬ ‫دانشگاه‬ ‫ی‬ ‫ران‬ ‫چکیده‬ ‫روش‬ ‫از‬ ‫ها‬ ‫ی‬ ‫خوشه‬ ‫بندی‬ ‫برا‬ ‫ی‬ ‫باز‬ ‫یابی‬ ‫نرم

  • The Evolution of a Hierarchical Partitioning Algorithm for Large-Scale Scientific Data: Three Steps of Increasing Complexity

    سند علمی۲۰۰۳SSDBMChuck Baldwin, Tina Eliassi-Rad, Ghaleb Abdulla, Terence Critchlow

    As scientific data sets grow exponentially in size, the need for scalable algorithms that heuristically partition the data increases. In this paper, we describe the threestep evolution of a hierarchical partitioning algorithm for large-scale spatio-temporal scientific data sets g

  • The lean gap: A review of lean approaches to large-scale software systems development

    سند علمی۲۰۱۳Journal of Systems and SoftwareJoakim Pernstål, Robert Feldt, Tony Gorschek

    Lean approaches to product development (LPD) have had a strong influence on many industries and in recent years there have been many proponents for lean in software development as it can support the increasing industry need of scaling agile software development. With it's roots i

  • Complexity Measurement of Large-Scale Software System Based on Complex Network

    سند علمی۲۰۱۴JNWDali Li

    With the increase of software system complexity, the traditional measurements can not meet the requirements, for the reason that the developers need control the software quality effectively and guarantee the normal operation of software system. Hence how to measure the complexity

  • Adapting Behavior Driven Development (BDD) for large-scale software systems

    مقاله‌ی دسترسی آزاد۲۰۲۱Journal of Systems and Software['Mohsin Irshad', 'Ricardo Britto', 'Kai Petersen', '']

    Large-scale software projects require interaction between many stakeholders. Behavior-driven development (BDD) facilitates collaboration between stakeholders, and an adapted BDD process can help improve cooperation in a large-scale project. The objective of this study is to propo

  • Project Management Method for Distributed Development Environment of Large-Scale Software Systems Based on Software Structure

    مقاله‌ی دسترسی آزاد۱۹۹۳IEEJ Transactions on Electronics, Information and SystemsYukitokiTsukamoto, KeinosukeMatsumoto

    Systems are becoming more complicated, and large-scale software systems are required to control them these days. This paper presents a new approach for productivity improvement in case of developing such large-scale software systems. Due to advancement of network technologies and