Systematic categorization and evaluation of CbO-based algorithms in FCA
From MaRDI portal
Publication:6065995
DOI10.1016/j.ins.2021.06.024OpenAlexW3172307526MaRDI QIDQ6065995
Publication date: 11 December 2023
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2021.06.024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
- Consensus algorithms for the generation of all maximal bicliques
- Characterizing reducts in multi-adjoint concept lattices
- Formal concept analysis via multi-adjoint concept lattices
- On generating all maximal independent sets
- Construction of the \(L\)-fuzzy concept lattice
- Interface between logical analysis of data and formal concept analysis
- L-concept lattices with positive and negative attributes: modeling uncertainty and reduction of size
- L-concept analysis with positive and negative attributes
- Object-oriented interval-set concept lattices
- Three-way dual concept analysis
- Three-way granular computing, rough sets, and formal concept analysis
- Attribute implications in \textbf{L}-concept analysis with positive and negative attributes: validity and properties of models
- Logical analysis of data -- the vision of Peter L. Hammer
- Making use of empty intersections to improve the performance of CbO-type algorithms
- Parallel algorithm for computing fixpoints of Galois connections
- Spanned patterns for the logical analysis of data
- A knowledge reduction approach for linguistic concept formal context
- Comparing performance of algorithms for generating concept lattices
This page was built for publication: Systematic categorization and evaluation of CbO-based algorithms in FCA
