2514 search results - page 341 / 503 » On the Computation of Approximations of Database Queries |
188
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
187
Voted
WAW
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
207
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
172
click to vote
ICPR
2004
IEEE
16 years 8 months ago
2004
IEEE
The likelihood for patterns of continuous attributes for the naive Bayesian classifier (NBC) may be approximated by kernel density estimation (KDE), letting every pattern influenc...
214
click to vote
SISAP
2008
IEEE
16 years 1 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...