We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
While much attention is paid to defining and examining interactions with links, little is paid to the front end: the anchor. We examine what an anchor is, describe six anchor prop...