Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/2001858.2001996 | GECCO (Companion) |
Keywords | Field | DocType |
model software,clustering approach,procedural code,software system form,better result,high-level abstraction,past clustering case,object identification,concrete illustration,graph partitioning,software systems,software engineering | Data mining,Software design description,Computer science,Theoretical computer science,Component-based software engineering,Software metric,Graph partition,Software construction,Cluster analysis,Software sizing,Software framework | Conference |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Faunes | 1 | 29 | 1.83 |
| Marouane Kessentini | 2 | 1023 | 57.65 |
| Houari Sahraoui | 3 | 801 | 42.47 |