Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data

DOI10.1016/j.ins.2011.09.023zbMath1239.68070MaRDI QIDQ425555

Jan Outrata, Vilem Vychodil

Publication date: 8 June 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.09.023

zbMATH Keywords

Galois connection; formal concept analysis; frequent itemset mining; object-attribute data

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68T30: Knowledge representation

06A15: Galois correspondences, closure operators (in relation to ordered sets)

Related Items

Using Pattern Structures for Analyzing Ontology-Based Annotations of Biomedical Data, Scalable Visual Analytics in FCA, Systematic categorization and evaluation of CbO-based algorithms in FCA, LinCbO: fast algorithm for computation of the Duquenne-Guigues basis, Pruning techniques in lincbo for the computation of the duquenne-guigues basis, A comprehensive survey on formal concept analysis, its research trends and applications, A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections, On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices, Attribute reduction in intuitionistic fuzzy concept lattices, Describing hierarchy of concept lattice by using matrix, LCM from FCA point of view: a CbO-style algorithm with speed-up features, On pruning techniques in map-reduce style CbO algorithms, Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis, Interface between logical analysis of data and formal concept analysis, On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient, Impact of Boolean factorization as preprocessing methods for classification of Boolean data, 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, Evolution of objects and concepts, A theoretical study on the object (property) oriented concept lattices based on three-way decisions, A reduction theorem to compute fixpoints of fuzzy closure operators, Rules acquisition of formal decision contexts based on three-way concept lattices, Improving the performance of Lindig-style algorithms with empty intersections, A lattice-free concept lattice update algorithm

Uses Software

• AddIntent
• UCI-ml
• FCALGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Top-down mining of frequent closed patterns from very high dimensional data
• On generating all maximal independent sets
• Multi-adjoint t-concept lattices
• Parallel algorithm for computing fixpoints of Galois connections
• Random walk biclustering for microarray data
• Mathematical classification and clustering
• Lattices of Fixed Points of Fuzzy Galois Connections
• Two Basic Algorithms in Concept Analysis
• Comparison of Data Structures for Computing Formal Concepts
• Efficient Algorithms for Listing Combinatorial Structures
• Comparing performance of algorithms for generating concept lattices
• Concept Lattices
• On computing the size of a lattice and related decision problems