Identifying objects using cluster and concept analysis
Proceedings of the 21st international conference on Software engineering
Identifying Modules via Concept Analysis
IEEE Transactions on Software Engineering
Object Identification in Legacy Code as a Grouping Problem
COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
A New Representation And Crossover Operator For Search-based Optimization Of Software Modularization
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Applying concept formation methods to object identification in procedural code
ASE '97 Proceedings of the 12th international conference on Automated software engineering (formerly: KBSE)
Bunch: A Clustering Tool for the Recovery and Maintenance of Software System Structures
ICSM '99 Proceedings of the IEEE International Conference on Software Maintenance
Using Automatic Clustering to Produce High-Level System Organizations of Source Code
IWPC '98 Proceedings of the 6th International Workshop on Program Comprehension
A heuristic search approach to solving the software clustering problem
A heuristic search approach to solving the software clustering problem
Software Clustering based on Information Loss Minimization
WCRE '03 Proceedings of the 10th Working Conference on Reverse Engineering
Search-based improvement of subsystem decompositions
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A technique for automatic component extraction from object-oriented programs by refactoring
Science of Computer Programming - Special issue on new software composition concepts
Towards Model Transformation Generation By-Example
HICSS '07 Proceedings of the 40th Annual Hawaii International Conference on System Sciences
Pareto optimal search based refactoring at the design level
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A hybrid optimization technique coupling an evolutionary and a local search algorithm
Journal of Computational and Applied Mathematics
Automated Design Improvement by Example
Proceedings of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07
Automatic Package Coupling and Cycle Minimization
WCRE '09 Proceedings of the 2009 16th Working Conference on Reverse Engineering
CBSE'10 Proceedings of the 13th international conference on Component-Based Software Engineering
Hi-index | 0.00 |
Much research in the past two decades has focused on automatic generation of abstractions from low-level software elements using clustering algorithms. This research is generally motivated by comprehension improvement through more abstract constructs, re-architecture of existing systems to improve their maintenance, or migration to new paradigms. In this paper, we start from a formulation of 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 then propose a novel formulation where the graph partitioning solution is evaluated by the degree of its 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.