References
- Carpineto , C. and Romano , G. 2004 . Concept Data Analysis: Theory and Applications , New York : John Wiley and Sons .
- Dekel, U., 2003, Revealing java class structure with concept lattices. Master's thesis, Technion -Israel Institute of Technology
- Ganter , B. and Wille , R. 1999 . Formal Concept Analysis: Mathematical Foundations , Berlin : Springer-Verlag .
- Hamilton , A.G. 1978 . Logic for Mathematicians , London : Cambridge University Press .
- Pawlak , Z. 1991 . Rough Sets-Theoretical Aspects of Reasoning about Data , Dordecht : Kluwer Academic Publishers .
- Qu , K.S. , Liang , J.Y. Wang , J.H. 2004 . The algebraic properties of concept lattice . Journal of Systems Science and Information , 2 ( 2 ) : 271 – 277 . Research Information Ltd UK,
- Stumme , G. , Taouil , R. Bastide , Y. 2000 . “ Fast computation of concept lattices using data mining techniques ” . In Proceeding of 7th International Workshop on Knowledge Representation Meets Databases (KRDB 2000) 129 – 139 .
- Tonella , P. 2003 . Using a concept lattice of decomposition slices for program understanding and impact analysis . IEEE Transactions on Software Engineering , 29 ( 6 ) : 495 – 509 .
- Wille , R. 1982 . “ Restructuring lattice theory: an approach based on hierarchies of concepts ” . In Ordered Sets , Edited by: Rival , I. 445 – 470 . Dordrecht : Reidel .
- Zupa , B. and Bohance , M. 1999 . Learning by discovering concept hierarchies . Artificial Intelligence , 109 : 211 – 242 .