Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
From MaRDI portal
Publication:425555
DOI10.1016/J.INS.2011.09.023zbMATH Open1239.68070OpenAlexW2047142510MaRDI QIDQ425555FDOQ425555
Authors: 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
Recommendations
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
- scientific article; zbMATH DE number 1543342
- Parallel algorithm for computing fixpoints of Galois connections
- A fixed point theorem for stronger association rules and its computational aspects
- Rules for computing fixpoints of a fuzzy closure operator
Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Cites Work
- Concept Lattices
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparing performance of algorithms for generating concept lattices
- Mathematical classification and clustering
- Lattices of Fixed Points of Fuzzy Galois Connections
- Title not available (Why is that?)
- On generating all maximal independent sets
- Efficient Algorithms for Listing Combinatorial Structures
- Top-down mining of frequent closed patterns from very high dimensional data
- Multi-adjoint t-concept lattices
- Parallel algorithm for computing fixpoints of Galois connections
- Random walk biclustering for microarray data
- Two basic algorithms in concept analysis
- Comparison of data structures for computing formal concepts
- Title not available (Why is that?)
- Title not available (Why is that?)
- On computing the size of a lattice and related decision problems
Cited In (26)
- A theoretical study on the object (property) oriented concept lattices based on three-way decisions
- Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis
- On pruning techniques in map-reduce style CbO algorithms
- Attribute reduction in intuitionistic fuzzy concept lattices
- A lattice-free concept lattice update algorithm
- Formal concept analysis: from knowledge discovery to knowledge processing
- On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient
- A reduction theorem to compute fixpoints of fuzzy closure operators
- Systematic categorization and evaluation of CbO-based algorithms in FCA
- A comprehensive survey on formal concept analysis, its research trends and applications
- LinCbO: fast algorithm for computation of the Duquenne-Guigues basis
- Improving the performance of Lindig-style algorithms with empty intersections
- Describing hierarchy of concept lattice by using matrix
- On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices
- Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts
- Using pattern structures for analyzing ontology-based annotations of biomedical data
- Parallel algorithm for computing fixpoints of Galois connections
- Scalable Visual Analytics in FCA
- Evolution of objects and concepts
- Impact of Boolean factorization as preprocessing methods for classification of Boolean data
- LCM from FCA point of view: a CbO-style algorithm with speed-up features
- Interface between logical analysis of data and formal concept analysis
- Rules acquisition of formal decision contexts based on three-way concept lattices
- Pruning techniques in lincbo for the computation of the duquenne-guigues basis
- Contribution to attributive and object subcontexts in inferring good maximally redundant tests
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
Uses Software
This page was built for publication: Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425555)
