ABSTRACT
Concept analysis transforms any relation between "objects" and "attributes" into a complete lattice. This concept lattice can be studied by algebraic means and offers remarkable insight into properties and structure of the original relation. As relations between "objects" and "attributes" occur all the time in software technology, concept analysis is an attractive foundation for a new class of program analysis tools. The article presents a short overview of the underlying theory, as well as applications for software component retrieval, analysis of configuration spaces, and modularization of legacy code.
- 1.G. Birkhoff: Lattice Theory. American Mathematical Society, Providence, R.I., 1st edition, 1940.Google Scholar
- 2.B. Davey, H. Pricstley: Introduction to lattices and order. Cambridge University Press 1990.Google Scholar
- 3.P. Funk, A. Lewien, G. Snelting: Algorithms for concept lattice decomposition and their application. Report 95-09, Computer Science Department, Technische Universitait Braunschweig, 1995.Google Scholar
- 4.R. Godin, R. Missaoui: An incremental concept formation approach for learning from databases. Theoretical Computer Science 133 (1994), pp. 387 - 419. Google ScholarDigital Library
- 5.M. Krone, G. Snelting: On the inference of configuration structures from source code. Proc. 16th International Conference on Software Engineering, Mai 1994, IEEE Comp. Sot. Press, pp. 49-57. Google ScholarDigital Library
- 6.C. Lindig: Concept-Based Component Retrieval. Proc. IJCAI-95 Workshop on Formal Approaches to the Reuse of Plans, Proofs, and Programs, Montreal, August 1995.Google Scholar
- 7.C. Lindig: Komponentensuche mit Begriffen. Proc. Softwaretechnik '95, Braunschweig, Oktober 1995, S. 67-75.Google Scholar
- 8.C. Lindig, G. Snelting: Assessing Modular Structure of Legacy Code Based on Mathematical Concept Analysis. Proc. International Conference on Software Engineering (ICSE'97), Boston 1997, pp. 349 - 359. Google ScholarDigital Library
- 9.C. Lindig: Analyse von Softwarevarianten. Report 98-03, Computer Science Department, Technische Universitat Braunschweig, 1998.Google Scholar
- 10.D. Parnas: Software Aging. Proc. International Conference on Software Engineering (ICSE'97)) Boston 1997, pp. 279-290. Google ScholarDigital Library
- 11.s. PoIland: Fuzzy Brgriffe formale Begriffsanalysr unscharfer Dat,en. Springer Verlag 1997.Google Scholar
- 12.R,. Pritto-Diaz: Implementing faceted classification for software reuse. .Journal of the ACM 34 (5), 1991, pp. 89 97. Google ScholarDigital Library
- 13.M. Sitf. T. Reps: identigying Modules via Concept Analysis. Proc. International Conferences on Soft,- ware Maintenance, Bari 1997, pp. 170 - 179. Google ScholarDigital Library
- 14.G. Snelting: R.eenginecring of configurations based on mathematical concept analysis. ACM Transactions on software Engineering and Methodology 5,2 (April 19!)6), pp. 146-189. Google ScholarDigital Library
- 15.R. Will<>: Restructuring lattice theory: an approach ba.sed OII hierarchies of conccpt,s. In: I. Rival, (Ed.), Ordered Sets. pp. 445-470, Reidel 1982.Google Scholar
- 16.R. Wille: Subdirect decomposition of concept lattices. Algebra Cnivcrdis 17 (1993), pp. 275-287.Google ScholarCross Ref
- 17.R. Wille: Tonsorial decomposition of concept lattices. Order 2 (19851, pp. 81-95.Google ScholarCross Ref
- 18.R. Wille: Brdeutungen von Begriffsverbsnden. In B. Ganter, R. Wille, K. Wolff (Ed.): Beitrgge zur Begriffsanalyse. BI Wissenschaftsverlag 1996, pp. 161 212.Google Scholar
- 19.B. Ganter, R. Wille: Forrnale Begriffsanalyse -- Ma.thernatischc Grundlagen. Springer Verlag 1996.Google Scholar
Index Terms
- Concept analysis—a new framework for program understanding
Recommendations
Concept analysis—a new framework for program understanding
Concept analysis transforms any relation between "objects" and "attributes" into a complete lattice. This concept lattice can be studied by algebraic means and offers remarkable insight into properties and structure of the original relation. As ...
Rough-set concept analysis
Based on ideas from formal concept analysis, this paper interprets the notions of RS-definable concepts (i.e., rough-set definable concepts) and the Boolean algebra of RS-definable concepts. We explicitly represent a RS-definable concept as a pair of an ...
A new algebraic structure for formal concept analysis
Formal concept analysis (FCA) originally proposed by Wille 39, is an important theory for data analysis and knowledge discovery. Concept lattice is the core of the mathematical theory of formal concept analysis. To address the requirements of real word ...
Comments