scientific article
From MaRDI portal
Publication:3029054
zbMath0626.06007MaRDI QIDQ3029054
Publication date: 1986
Full work available at URL: http://www.numdam.org/item?id=MSH_1986__96__31_0
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityalgorithmstransitive closuretripartite graphordered graphsGalois latticealgorithmic solutions
Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items
Complexity of learning in concept lattices from positive and negative examples, Reconstructing concept lattices usingnth-order context kernels, Representing a concept lattice by a graph, An incremental concept formation approach for learning from databases, Computing on-line the lattice of maximal antichains of posets, Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates, A local approach to concept generation, Lattices, closures systems and implication bases: a survey of structural aspects and algorithms, Improving the performance of Lindig-style algorithms with empty intersections, Dichotomic lattices and local discretization for Galois lattices, Weak-order extensions of an order., Formal concept analysis for the generation of plural referring expressions, \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data, Associative models for storing and retrieving concept lattices, Mathematical aspects of concept analysis, Recursive decomposition tree of a Moore co-family and closure algorithm., A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections, Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation, Generalized domination in closure systems, Pattern Detection in Object-Oriented Source Code, FCA for software product line representation: mixing configuration and feature relationships in a unique canonical representation, Contribution to attributive and object subcontexts in inferring good maximally redundant tests, Towards an Iterative Classification Based on Concept Lattice, Algorithms for computing the Shapley value of cooperative games on lattices, Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs, Enumeration aspects of maximal cliques and bicliques, Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis, Handling high dimensionality contexts in formal concept analysis via binary decision diagrams, A fast algorithm for building lattices
