scientific article; zbMATH DE number 1898282
From MaRDI portal
Publication:4802633
zbMATH Open1009.68678MaRDI QIDQ4802633FDOQ4802633
Authors: Sergei O. Kuznetsov, Sergei Obiedkov 
Publication date: 22 April 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2168/21680289.htm
Title of this publication is not available (Why is that?)
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99) Knowledge representation (68T30) Database theory (68P15)
Cited In (36)
- A partition-based approach towards constructing Galois (concept) lattices
- Reconstructing concept lattices usingnth-order context kernels
- Representing a concept lattice by neighborly ideas
- Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
- Doubly-lexical order supports standardisation and recursive partitioning of formal context
- Towards interactive transition from AOC poset to concept lattice
- \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
- A Linear Delay Algorithm for Building Concept Lattices
- From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit
- An algorithmic observation of directed graphs on lattices
- Title not available (Why is that?)
- Inductive properties of lattices
- An algorithm for navigation in a multi-context concept lattice
- Comparison of data structures for computing formal concepts
- Two basic algorithms in concept analysis
- Improving the performance of Lindig-style algorithms with empty intersections
- Title not available (Why is that?)
- Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts
- Comparing performance of algorithms for generating concept lattices
- Formal Concept Analysis
- Concept lattices as a search space for graph compression
- Algorithms for computing the Shapley value of cooperative games on lattices
- Border algorithms for computing Hasse diagrams of arbitrary lattices.
- Scalable Visual Analytics in FCA
- A novel framework for detecting maximally banded matrices in binary data
- Some complexity results about essential closed sets
- Title not available (Why is that?)
- An algorithm for generating fuzzy concepts using graph
- A new method of building a lattice based on join-irreducible elements
- Dichotomic lattices and local discretization for Galois lattices
- Breadth first search graph partitions and concept lattices
- Title not available (Why is that?)
- Hierarchic construction of concept lattices
- Formal Concept Analysis
- An incremental method for the construction of the box extents of a context
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4802633)
