This paper proposes to utilize algorithms from the probabilistic graphical models domain for Peer-to-Peer rating of data items and for computing “social influence” of nodes i...
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...
Non-linear dimensionality reductionmethods are powerful techniques to deal with
high-dimensional datasets. However, they often are susceptible to local minima
and perform poorly ...
Andreas Geiger (Karlsruhe Institute of Technology)...
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
In this paper we propose a method for gene ranking from microarray experiments using multiple discriminants. The novelty of our approach is that a gene's relative rank is det...
Alfred O. Hero, Sepidarseh Zareparsi, Anand Swaroo...