A Regularization Framework for Learning from Graph Data

Zhou, D; Schölkopf, B

アイテム詳細

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

一時保存へ追加

このアイテムの新しいバージョンが利用可能です:
https://pure.mpg.de/pubman/item/item_1792131_3

詳細要約

公開

会議論文

A Regularization Framework for Learning from Graph Data

MPS-Authors

/persons/resource/persons84330

Zhou, D
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;

/persons/resource/persons84193

Schölkopf, B
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

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

付随資料 (公開)

There is no public supplementary material available

引用

Zhou, D., & Schölkopf, B. (2004). A Regularization Framework for Learning from Graph Data. In ICML Workshop on Statistical Relational Learning and Its Connections to Other Fields (pp. 132-137).

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

要旨

The data in many real-world problems can be thought of as a graph, such as the web, co-author networks, and biological networks. We propose a general regularization framework on graphs, which is applicable to the classification, ranking, and link prediction problems. We also show that the method can be explained as lazy random walks. We evaluate the method on a number of experiments.