Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Efficient algorithms on distributive lattices
Discrete Applied Mathematics
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Closed patterns meet n-ary relations
ACM Transactions on Knowledge Discovery from Data (TKDD)
Enumeration aspects of maximal cliques and bicliques
Discrete Applied Mathematics
Non-redundant Subgroup Discovery Using a Closure System
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Note: Listing closed sets of strongly accessible set systems with applications to data mining
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we propose a “divide and conquer” based generating algorithm for closed sets of a binary relation. We show that some existing algorithms are particular instances of our algorithm. This allows us to compare those algorithms and exhibit that the practical efficiency relies on the number of invalid closed sets generated. This number strongly depends on a choice function and the structure of the lattice. We exhibit a class of lattices for which no invalid closed sets are generated and thus reduce time complexity for such lattices. We made several tests which illustrate the impact of the choice function in practical efficiency.