A comparison of graphs of concept for reverse engineering
- 7 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 231-240
- https://doi.org/10.1109/wpc.2000.852497
Abstract
To group related things together (for example to form subsystems), researchers in reverse engineering are looking for algorithms that create meaningful groups. One such algorithm, concept analysis, received a lot of interest recently. It creates a lattice of concepts which have some advantages over the more traditional tree of clusters from clustering algorithms. We argue that the main interest of concept analysis lies in the concepts themselves and can be disconnected from the particular structure (the lattice of concepts) in which the concepts are usually arranged. We compare concept analysis to various other algorithms trying to select the most important concepts contained in a set of entities. Our main conclusion is that although it has advantages, the lattice of concepts suffers from a major drawback that other constructs do not have: it returns much more information (concepts) than it was given as input (a set of entities describing some software system).Keywords
This publication has 8 references indexed in Scilit:
- Structuring knowledge bases using automatic learningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Extracting concepts from file names; a new file clustering criterionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Using clustering algorithms in legacy systems remodularizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Identifying modules via concept analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Identifying objects using cluster and concept analysisPublished by Association for Computing Machinery (ACM) ,1999
- Recovering software architecture from the names of source filesJournal of Software Maintenance: Research and Practice, 1999
- Building and maintaining analysis-level class hierarchies using Galois LatticesPublished by Association for Computing Machinery (ACM) ,1993
- Concept lattices and conceptual knowledge systemsComputers & Mathematics with Applications, 1992