Sciweavers

385 search results - page 15 / 77
» Probabilistic ranking over relations
Sort
View
P2P
2007
IEEE
117views Communications» more  P2P 2007»
14 years 1 months ago
Peer-to-Peer Rating
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...
Danny Bickson, Dahlia Malkhi, Lidong Zhou
SIGMOD
2012
ACM
240views Database» more  SIGMOD 2012»
11 years 10 months ago
Finding related tables
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...
CVPR
2009
IEEE
15 years 2 months ago
Rank Priors for Continuous Non-Linear Dimensionality Reduction
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)...
ICDE
2009
IEEE
190views Database» more  ICDE 2009»
14 years 9 months ago
Progressive Keyword Search in Relational Databases
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...
Guoliang Li, Xiaofang Zhou, Jianhua Feng, Jianyong...
ISBI
2004
IEEE
14 years 8 months ago
Pareto Depth Sampling Distributions for Gene Ranking
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...