The following pages link to (Q4520819):
Displaying 6 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)
- Size of random Galois lattices and number of closed frequent itemsets (Q967342) (← links)
- Description of sup- and inf-preserving aggregation functions via families of clusters in data tables (Q2293170) (← links)
- A Fixed Point Theorem for Stronger Association Rules and Its Computational Aspects (Q3551107) (← links)
- (Q3805888) (← links)
