Learning kernels from biological networks by maximizing entropy

Tsuda, K; Noble, WS

doi:10.1093/bioinformatics/bth906

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Learning kernels from biological networks by maximizing entropy

MPS-Authors

/persons/resource/persons84265

Tsuda, K
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

https://academic.oup.com/bioinformatics/article-pdf/20/suppl_1/i326/575679/bth906.pdf
(出版社版)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Tsuda, K., & Noble, W. (2004). Learning kernels from biological networks by maximizing entropy. Bioinformatics, 20(Supplement 1), i326-i333.

引用: https://hdl.handle.net/11858/00-001M-0000-0013-D80F-4

要旨

Motivation: The diffusion kernel is a general method for computing pairwise distances among all nodes in a graph, based on the sum of weighted paths between each pair of nodes. This technique has been used successfully, in conjunction with kernel-based learning methods, to draw inferences from several types of biological networks.

Results: We show that computing the diffusion kernel is equivalent to maximizing the von Neumann entropy, subject to a global constraint on the sum of the Euclidean distances between nodes. This global constraint allows for high variance in the pairwise distances. Accordingly, we propose an alternative, locally constrained diffusion kernel, and we demonstrate that the resulting kernel allows for more accurate support vector machine prediction of protein functional classifications from metabolic and proteinprotein interaction networks.