Showing 2001Show all
2 papers · 1 filter
cs.DB2001
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…
cs.DB2001
Expressing the cone radius in the relational calculus with real polynomial constraints
Floris Geerts
We show that there is a query expressible in first-order logic over the reals that returns, on any given semi-algebraic set A, for every point a radius around which A is conical. W…