In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
We consider the problem of finding related tables in a large corpus of heterogenous tables. Detecting related tables provides users a powerful tool for enhancing their tables wit...
Anish Das Sarma, Lujun Fang, Nitin Gupta 0003, Alo...
The location-aware keyword query returns ranked objects that are near a query location and that have textual descriptions that match query keywords. This query occurs inherently i...
— Previous studies on supporting keyword queries in RDBMSs provide users with a ranked list of relevant linked structures (e.g. joined tuples) or individual tuples. In this paper...
Bolin Ding, Bo Zhao, Cindy Xide Lin, Jiawei Han, C...
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...