English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Learning kernels from biological networks by maximizing entropy

Tsuda, K., & Noble, W. (2004). Learning kernels from biological networks by maximizing entropy. Poster presented at Eighth Annual International Conference on Computational Molecular Biology (RECOMB 2004), San Diego, CA, USA.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Tsuda, K1, 2, Author              
Noble, WS, Author
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Content

show
hide
Free keywords: -
 Abstract: When predicting the functions of unannoted proteins based on a protein network, one relies on some notions of “closeness” or “distance” among the nodes. However, inferring closeness among the nodes is an extremely ill-posed problem, because the proximity information provided by the edges is only local. Moreover, it is preferable that the resulting similarity matrix be a valid kernel matrix so that function prediction can be done by support vector machines (SVMs) or other high-performance kernel classifiers [2]. Maximum entropy methods have been proven to be effective for solving general ill-posed problems. However, these methods are concerned with the estimation of a probability distribution, not a kernel matrix. In this work, we generalize the maximum entropy framework to estimate a positive definite kernel matrix. We found that the diffusion kernel [1], which has been used successfully for making predictions from biological networks (e.g. [3]), can be derived from this framework. However, one drawback inherent in the diffusion kernel is that, in the feature space, the distances between connected samples have high variance. As a result, some of the samples are outliers, which should be avoided for reliable statistical inference. Our new kernel based on local constraints resolves this problem and thereby shows better accuracy in yeast function prediction.

Details

show
hide
Language(s):
 Dates: 2004-03
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: -
 Degree: -

Event

show
hide
Title: Eighth Annual International Conference on Computational Molecular Biology (RECOMB 2004)
Place of Event: San Diego, CA, USA
Start-/End Date: 2004-03-27 - 2004-03-31

Legal Case

show

Project information

show

Source 1

show
hide
Title: Currents in Computational Molecular Biology 2004
Source Genre: Proceedings
 Creator(s):
Gramada, A, Editor
Bourne, PE, Editor
Affiliations:
-
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: E24 Start / End Page: 130 - 131 Identifier: -