Retrieval of Experiments by Efficient Estimation of Marginal Likelihood

02/19/2014
by   Sohan Seth, et al.
0

We study the task of retrieving relevant experiments given a query experiment. By experiment, we mean a collection of measurements from a set of `covariates' and the associated `outcomes'. While similar experiments can be retrieved by comparing available `annotations', this approach ignores the valuable information available in the measurements themselves. To incorporate this information in the retrieval task, we suggest employing a retrieval metric that utilizes probabilistic models learned from the measurements. We argue that such a metric is a sensible measure of similarity between two experiments since it permits inclusion of experiment-specific prior knowledge. However, accurate models are often not analytical, and one must resort to storing posterior samples which demands considerable resources. Therefore, we study strategies to select informative posterior samples to reduce the computational load while maintaining the retrieval performance. We demonstrate the efficacy of our approach on simulated data with simple linear regression as the models, and real world datasets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/08/2013

Retrieval of Experiments with Sequential Dirichlet Process Mixtures in Model Space

We address the problem of retrieving relevant experiments given a query ...
research
05/19/2015

Modelling-based experiment retrieval: A case study with gene expression clustering

Motivation: Public and private repositories of experimental data are gro...
research
02/03/2017

Query Efficient Posterior Estimation in Scientific Experiments via Bayesian Active Learning

A common problem in disciplines of applied Statistics research such as A...
research
04/02/2023

An Intrinsic Framework of Information Retrieval Evaluation Measures

Information retrieval (IR) evaluation measures are cornerstones for dete...
research
11/08/2021

Solving Marginal MAP Exactly by Probabilistic Circuit Transformations

Probabilistic circuits (PCs) are a class of tractable probabilistic mode...
research
08/22/2019

Revisit Semantic Representation and Tree Search for Similar Question Retrieval

In this paper, we study the problem of short sentence ranking for questi...
research
07/26/2022

Active Learning of Ordinal Embeddings: A User Study on Football Data

Humans innately measure distance between instances in an unlabeled datas...

Please sign up or login with your details

Forgot password? Click here to reset