7 citations · 7 across the 4 of their papers we have counts for
4 papers · 1 filter
Interactive Constrained Association Rule Mining
Bart Goethals, Jan Van den Bussche
We investigate ways to support interactive mining sessions, in the setting of association rule mining. In such sessions, users specify conditions (queries) on the associations to b…
A Tight Upper Bound on the Number of Candidate Patterns
Floris Geerts, Bart Goethals, Jan Van den Bussche
In the context of mining for frequent patterns using the standard levelwise algorithm, the following question arises: given the current level and the current set of frequent patter…
Polymorphic type inference for the relational algebra
Jan Van den Bussche, Emmanuel Waller
We give a polymorphic account of the relational algebra. We introduce a formalism of ``type formulas'' specifically tuned for relational algebra expressions, and present an algorit…
Solving equations in the relational algebra
Joachim Biskup, Jan Paredaens, Thomas Schwentick +1
Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yie…