Reducing the Representation Complexity of Lattice-Based Taxonomies
Authors:
- 23 August 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 241-254
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Lattice-based dynamic and overlapping taxonomies: The case of epistemic communitiesScientometrics, 2006
- Computing iceberg concept lattices with TitanicData & Knowledge Engineering, 2002
- Comparing performance of algorithms for generating concept latticesJournal of Experimental & Theoretical Artificial Intelligence, 2002
- A File System Based on Concept AnalysisLecture Notes in Computer Science, 2000
- Formal Concept Analysis1999
- INCREMENTAL CONCEPT FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICESComputational Intelligence, 1995
- Using Galois Lattices to Represent Network DataSociological Methodology, 1993
- Concept lattices and conceptual knowledge systemsComputers & Mathematics with Applications, 1992
- Introduction: epistemic communities and international policy coordinationInternational Organization, 1992
- An algorithm for suffix strippingProgram: electronic library and information systems, 1980