Bibliography

Query:
case sensitive

Sort by: Display: Hide controls:

  1. Nicolas Anquetil. A Comparison of Graphs of Concept for Reverse Engineering. In Proceedings of the 8th International Workshop on Program Comprehension, IWPC '00 p. 231—, IEEE Computer Society, Washington, DC, USA, 2000. PDF 
    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 will 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 will 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 have advantages, the lattice of concepts suffer from a major drawback that other constructs do not have: it returns much more information (concepts) than what it was given in input (a set of entities describing some software system).