Software Components Capture Using Graph Clustering

Authors:
Yves Chiricota;Fabien Jourdan;Guy Melançon
Affiliations:
-;-;-
Venue:
IWPC '03 Proceedings of the 11th IEEE International Workshop on Program Comprehension
Year:
2003

Citing 0
Cited 11

Build-Level Components

IEEE Transactions on Software Engineering
Revisiting the ΔIC approach to component recovery

Science of Computer Programming - Software analysis, evolution and re-engineering
A Lightweight Approach to Partially Reuse Existing Component-Based System in Service-Oriented Environment

ICSR '08 Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems
Architecture Reconstruction

Software Engineering
A biting-down approach to hierarchical decomposition of object-oriented systems based on structure analysis

Journal of Software Maintenance and Evolution: Research and Practice
Multiscale visualization of small world networks

INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Software packaging approaches: a comparison framework

ECSA'11 Proceedings of the 5th European conference on Software architecture
Functional unit maps for data-driven visualization of high-density EEG coherence

EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
Rank-directed layout of UML class diagrams

Proceedings of the First International Workshop on Software Mining
Alternate views of graph clusterings based on thresholds: a case study for a student forum

Proceedings of the sixth workshop on Ph.D. students in information and knowledge management
Clustering Software Components for Component Reuse and Program Restructuring

Proceedings of the Second International Conference on Innovative Computing and Cloud Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a simple fast computing and easy to implement method for finding relatively good clusterings of software systems. Our method relies on the ability to compute the strength of an edge in a graph by applying a straight-forward metric defined in terms of the neighborhoods of its end vertices. The metric is used to identify the weak edges of the graph, which are momentarily deleted to break it into several components. We study the quality metric MQ introduced in [5 ] and exhibit mathematical properties that make it a good measure for clustering quality. Letting the threshold weakness of edges vary defines a path, i.e. a sequence of clusterings in the solution space (of all possible clustering of the graph). This path is described in terms of a curve linking MQ to the weakness of the edges in the graph.