Exploratory analysis of co-change graphs for code refactoring

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Version Control Systems (VCS) have always played an essential role for developing reliable software. Recently, many new ways of utilizing the information hidden in VCS have been discovered. Clustering layouts of software systems using VCS is one of them. It reveals groups of related artifacts of the software system, which can be visualized for easier exploration. In this paper we use an Expectation Maximization (EM) based probabilistic clustering algorithm and visualize the clustered modules using a compound node layout algorithm. Our experiments with repositories of two medium size software tools give promising results indicating improvements over many previous approaches. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Khosravi, H., & Colak, R. (2009). Exploratory analysis of co-change graphs for code refactoring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5549 LNAI, pp. 219–223). https://doi.org/10.1007/978-3-642-01818-3_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free