Formal Concept Analysis in Information Science (1996)

Cached

Download Links

by Uta Priss
Venue:ANNUAL REVIEW OF INFORMATION SCIENCE AND TECHNOLOGY
Citations:41 - 5 self

Documents Related by Co-Citation

809 R.: Formal Concept Analysis, Mathematical Foundations – B Ganter, Wille - 1999
269 Formal Concept Analysis – B Ganter, R Wille
23 Formal concept analysis as mathematical theory of concepts and concept hierarchies – R Wille - 2005
409 Restructuring lattice theory: an approach based on hierarchies of concepts, Ordered Sets – R Wille - 1982
92 Two basic algorithms in concept analysis – B Ganter - 1984
91 Comparing Performance of Algorithms for Generating Concept Lattices – Sergei O. Kuznetsov, Sergei Obiedkov - 2002
21 Lattice-based Information Retrieval – Uta Priss - 2000
4 A local approach to concept generation – A Berry, J-P Bordat, A Sigayret - 2007
7 Actionability and Formal Concepts: A Data Mining Perspective – Jean-françois Boulicaut, Jérémy Besson
10 Sigayret A.: Performances of Galois sub-hierarchybuilding algorithms – Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret
18 Learning of Simple Conceptual Graphs from Positive and Negative Examples. PKDD – S Kuznetsov - 1999
12 V.: Parallel Recursive Algorithm for FCA – Petr Krajca, Jan Outrata, Vilem Vychodil - 2008
53 G.: Concept Data Analysis. Theory and Applications – C Carpineto, Romano - 2004
21 Order-Theoretical Ranking – Claudio Carpineto, Giovanni Romano - 2000
13 G.: Using concept lattices for text retrieval and mining – C Carpineto, Romano - 2005
3 Optimal decompositions of matrices with grades – R Belohlavek
3 Vychodil V. Fast algorithm for computing maximal rectangles from object-attribute relational data (submitted – J Outrata
3 A new algorithm for computing formal concepts – Vilem Vychodil
9 Towards fault-tolerant formal concept analysis – Ruggero G. Pensa, Jean-françois Boulicaut - 2005