Comparing performance of algorithms for generating concept lattices

DOI10.1080/09528130210164170zbMath1024.68020OpenAlexW2065253760WikidataQ62046343 ScholiaQ62046343MaRDI QIDQ4409026

Sergei O. Kuznetsov, Sergei Obiedkov

Publication date: 29 June 2003

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09528130210164170

zbMATH Keywords

concept latticesintelligent data analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Data structures (68P05) Lattices (06B99)

Related Items (84)

Complexity of learning in concept lattices from positive and negative examples ⋮ Optimal factorization of three-way binary data using triadic concepts ⋮ A comprehensive survey on formal concept analysis, its research trends and applications ⋮ Relational concept discovery in structured datasets ⋮ Attribute-incremental construction of the canonical implication basis ⋮ A local approach to concept generation ⋮ Logical analysis of data -- the vision of Peter L. Hammer ⋮ Representing lattices using many-valued relations ⋮ On Problem of Finding all Maximal Induced Bicliques of Hypergraph ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ Relational concept analysis: mining concept lattices from multi-relational data ⋮ Knowledge representation using interval-valued fuzzy formal concept lattice ⋮ Rules acquisition of formal decision contexts based on three-way concept lattices ⋮ Interface between logical analysis of data and formal concept analysis ⋮ Improving the performance of Lindig-style algorithms with empty intersections ⋮ Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset ⋮ Triadic formal concept analysis and triclustering: searching for optimal patterns ⋮ On the number of maximal antichains in Boolean lattices for \(n\) up to 7 ⋮ Systematic categorization and evaluation of CbO-based algorithms in FCA ⋮ LinCbO: fast algorithm for computation of the Duquenne-Guigues basis ⋮ Constructing three-way concept lattice based on the composite of classical lattices ⋮ A general theory of concept lattice with tractable implication exploration ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ An efficient conflict analysis method based on splitting and merging of formal contexts ⋮ Close contact detection in social networks via possible attribute analysis ⋮ Constructing L-fuzzy concept lattices without fuzzy Galois closure operation ⋮ Granularity of attributes in formal concept analysis ⋮ Formal concept analysis for the generation of plural referring expressions ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ Parallel algorithm for computing fixpoints of Galois connections ⋮ On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient ⋮ A machine learning method to reveal closed sets of common features of objects using constraint programming ⋮ CHARACTERIZING TREES IN CONCEPT LATTICES ⋮ A PARAMETERIZED ALGORITHM TO EXPLORE FORMAL CONTEXTS WITH A TAXONOMY ⋮ ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS ⋮ Formal concept analysis based on the topology for attributes of a formal context ⋮ Closure-based constraints in formal concept analysis ⋮ Three-way concept analysis for incomplete formal contexts ⋮ Connections between covering-based rough sets and concept lattices ⋮ Closures in Binary Partial Algebras ⋮ Biclustering Numerical Data in Formal Concept Analysis ⋮ From-below approximations in Boolean matrix factorization: geometry and new algorithm ⋮ DECOMPOSITIONAL APPROACH TO RESEARCH OF FORMAL CONTEXTS ⋮ Some decision and counting problems of the Duquenne-Guigues basis of implications ⋮ Enumeration of 2-level polytopes ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Three-way concept learning based on cognitive operators: an information fusion viewpoint ⋮ Optimizations in computing the Duquenne-Guigues basis of implications ⋮ Biclustering meets triadic concept analysis ⋮ Fuzzy and rough formal concept analysis: a survey ⋮ Vague concept lattice reduction using granular computing and vague entropy ⋮ A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections ⋮ Comprehensive vs. comprehensible classifiers in logical analysis of data ⋮ Relations of reduction between covering generalized rough sets and concept lattices ⋮ Probabilistic generalization of formal concepts ⋮ Characterizing functional dependencies in formal concept analysis with pattern structures ⋮ A semantic approach to concept lattice-based information retrieval ⋮ Size of random Galois lattices and number of closed frequent itemsets ⋮ Reducing one class of machine learning algorithms to logical operations of plausible reasoning ⋮ Actionability and Formal Concepts: A Data Mining Perspective ⋮ On the Complexity of Computing Generators of Closed Sets ⋮ On biconcepts in formal fuzzy concept analysis ⋮ Link key candidate extraction with relational concept analysis ⋮ Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts ⋮ Contribution to attributive and object subcontexts in inferring good maximally redundant tests ⋮ Towards Concise Representation for Taxonomies of Epistemic Communities ⋮ Discovery of optimal factors in binary data via a novel method of matrix decomposition ⋮ An incremental algorithm to construct a lattice of set intersections ⋮ Characterizing approximate-matching dependencies in formal concept analysis with pattern structures ⋮ A new algorithm for Boolean matrix factorization which admits overcovering ⋮ Parallel algorithms for enumerating closed patterns from multi-relational data ⋮ Formal concept analysis-based service classification to dynamically build efficient software component directories ⋮ Three-way dual concept analysis ⋮ Enumeration aspects of maximal cliques and bicliques ⋮ Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis ⋮ Attribute reduction in formal contexts based on a new discernibility matrix ⋮ LCM from FCA point of view: a CbO-style algorithm with speed-up features ⋮ On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction ⋮ Handling high dimensionality contexts in formal concept analysis via binary decision diagrams ⋮ A reduction theorem to compute fixpoints of fuzzy closure operators ⋮ On Decomposition of a Binary Context Without Losing Formal Concepts ⋮ On the calculation of formal concept stability ⋮ Simple Undirected Graphs as Formal Contexts ⋮ Decision concept lattice vs. decision trees and random forests

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generating all maximal independent sets
• Finding all closed sets: A general approach
• A fast algorithm for building lattices
• On the irredundant generation of knowledge spaces
• Efficient Algorithms for Listing Combinatorial Structures
• On computing the size of a lattice and related decision problems

This page was built for publication: Comparing performance of algorithms for generating concept lattices