Logistic Regression for Graph Classification

Shervashidze, N; Tsuda, K

アイテム詳細

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

一時保存へ追加

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

公開

会議抄録

Logistic Regression for Graph Classification

MPS-Authors

/persons/resource/persons84919

Shervashidze, N
Max Planck Institute for Biological Cybernetics, Max Planck Society;
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;

/persons/resource/persons84265

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

External Resource

http://media.nips.cc/Conferences/2008/NIPSWorkshopsProgram2008.pdf
(要旨)

Fulltext (restricted access)

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

フルテキスト (公開)

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

付随資料 (公開)

There is no public supplementary material available

引用

Shervashidze, N., & Tsuda, K. (2008). Logistic Regression for Graph Classification. In NIPS 2008: Mini Symposia & Workshops (pp. 75).

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

要旨

In this paper we deal with graph classification. We propose a new algorithm for performing sparse logistic regression for graphs, which is comparable in accuracy with other methods of graph classification and produces probabilistic output in addition. Sparsity is required for the reason of interpretability, which is often necessary in domains such as bioinformatics or chemoinformatics.