Cited in
(23)- Improving the performance of Lindig-style algorithms with empty intersections
- An incremental algorithm to construct a lattice of set intersections
- A semantic approach to concept lattice-based information retrieval
- Probabilistic generalization of formal concepts
- Comparison of reduction in formal decision contexts
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- CreChainDo
- FooCA
- SearchSleuth
- Hermes
- FcaBedrock
- FCbO
- FCALGS
- In-Close
- IGLUE
- Dichotomic lattices and local discretization for Galois lattices
- Attribute-incremental construction of the canonical implication 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
- Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis
- Dealing with Large Volumes of Complex Relational Data Using RCA
- \textsc{RCA-seq}: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns
- Approximating concept stability using variance reduction techniques
This page was built for software: AddIntent
