The following pages link to AddIntent (Q14568):
Displayed 14 items.
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555) (← links)
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections (Q527183) (← links)
- An incremental algorithm to construct a lattice of set intersections (Q1001808) (← links)
- Probabilistic generalization of formal concepts (Q1758720) (← links)
- A semantic approach to concept lattice-based information retrieval (Q2254623) (← links)
- Approximating concept stability using variance reduction techniques (Q2286394) (← links)
- Contribution to attributive and object subcontexts in inferring good maximally redundant tests (Q2286403) (← links)
- \textsc{RCA-seq}: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns (Q2286407) (← links)
- Comparison of reduction in formal decision contexts (Q2374515) (← links)
- Attribute-incremental construction of the canonical implication basis (Q2385433) (← links)
- Dichotomic lattices and local discretization for Galois lattices (Q2418288) (← links)
- Improving the performance of Lindig-style algorithms with empty intersections (Q2670896) (← links)
- Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis (Q2831029) (← links)
- Dealing with Large Volumes of Complex Relational Data Using RCA (Q5054979) (← links)