We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
In this paper, we evaluate and investigate two main types of relevance feedback algorithms; the Euclidean and the correlation?based approaches. In the first case, we examine heuri...
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
ConQueSt is a constraint-based querying system devised with the aim of supporting the intrinsically exploratory nature of pattern discovery. It provides users with an expressive c...
Francesco Bonchi, Fosca Giannotti, Claudio Lucches...
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...