Ranking Relations Using Analogies in Biological and Information Networks

DSpace/Manakin Repository

Ranking Relations Using Analogies in Biological and Information Networks

Citable link to this page


Title: Ranking Relations Using Analogies in Biological and Information Networks
Author: Airoldi, Edoardo Maria; Silva, Ricardo; Ghahramani, Zoubin; Katherine Heller

Note: Order does not necessarily reflect citation order of authors.

Citation: Silva, Ricardo, Katherine Heller, Zoubin Ghahramani, and Edoardo M. Airoldi. 2010. Ranking relations using analogies in biological information networks. Annals of Applied Statistics 4(2): 615-644.
Full Text & Related Files:
Abstract: Analogical reasoning depends fundamentally on the ability to learn and generalize about relations between objects. We develop an approach to rela- tional learning which, given a set of pairs of objects S = {A[super](1) : B[super](1) , A[super](2) : B[super](2),...,A[super](N) :B[super](N)}, measures how well other pairs A:B fit in with the set S. Our work addresses the following question: is the relation between objects A and B analogous to those relations found in S? Such questions are particularly relevant in information retrieval, where an investigator might want to search for analogous pairs of objects that match the query set of interest. There are many ways in which objects can be related, making the task of measuring analogies very challenging. Our approach combines a similarity measure on function spaces with Bayesian analysis to produce a ranking. It requires data containing features of the objects of interest and a link matrix specifying which relationships exist; no further attributes of such relationships are necessary. We illustrate the potential of our method on text analysis and information networks. An application on discovering functional interactions between pairs of proteins is discussed in detail, where we show that our approach can work in practice even if a small set of protein pairs is provided.
Published Version: doi:10.1214/09-AOAS321
Other Sources: http://arxiv.org/abs/0912.5193/
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4636007
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search