Software clustering by example

Authors:
Martin Faunes;Marouane Kessentini;Houari Sahraoui
Affiliations:
Université de Montréal, Montreal, PQ, Canada;Université de Montréal, Montreal, PQ, Canada;Université de Montréal, Montreal, PQ, Canada
Venue:
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Year:
2011

Citing 4
Cited 0

A Concept Formation Based Approach to Object Identification in Procedural Code

Automated Software Engineering
A New Representation And Crossover Operator For Search-based Optimization Of Software Modularization

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A heuristic search approach to solving the software clustering problem

A heuristic search approach to solving the software clustering problem
Automatic Package Coupling and Cycle Minimization

WCRE '09 Proceedings of the 2009 16th Working Conference on Reverse Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We model software clustering problems in a setting, where elements of a software system form a graph to be partitioned in order to derive high-level abstractions. We extend this formulation in a way that the graph partitioning solutions are evaluated by the degree of their conformance with past clustering cases given as examples. We provide a concrete illustration of this formulation with the problem of object identification in procedural code, for which we obtained better results than a clustering approach.