Two basic algorithms in concept analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5986 LNAI, Issue , 2010, Pages 312-340

  Ganter, Bernhard ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; BIPARTITE SUBGRAPHS; CLOSED SET; CLOSURE OPERATORS; CLOSURE SYSTEMS; CONCEPT ANALYSIS;

ALGORITHMS; FORMAL LOGIC; GRAPH THEORY; INFORMATION ANALYSIS;

MATHEMATICAL OPERATORS;

EID: 78650367081     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11928-6_22     Document Type: Conference Paper

References (4)

1. G.FAY, An algorithm for finite Galois connections. Technical report, Institute for Industrial Economy, Budapest(1973).
2. J.-L. GUIGOES and V. DUQUENNE, Informative implications derived from a table of binary data. Preprint, Groupe Mathématiques et Psychologie, Université René Descartes, Paris (1984).
3. E.M.NORRIS, An algorithm for computing the maximal rectangles in a binary relation. Rev. Roum. Math. Pures et Appl., Tome XXIII, No 2, pp 243-250, Bucarest (1978).
4. R.WILLE, Restructuring lattice theory: an approach based on hierarchies of concepts. In: I. RIVAL (ed.), Ordered sets. Reidel Publ, Comp., Dordrecht-Boston (1982), pp 445-470.