1756 search results - page 86 / 352 » Mining Query Logs |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
ACSD
2007
IEEE
14 years 4 months ago
2007
IEEE
Today there are many process mining techniques that allow for the automatic construction of process models based on event logs. Unlike synthesis techniques (e.g., based on regions...
COLT
2004
Springer
14 years 3 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
IS
2010
13 years 8 months ago
2010
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
ISAAC
2007
Springer
14 years 4 months ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...