Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für biologische Kybernetik     Collection: Biologische Kybernetik     Display Documents



ID: 461752.0, MPI für biologische Kybernetik / Biologische Kybernetik
A Bayesian Approach to Graph Regression with Relevant Subgraph Selection
Authors:Chiappa, S.; Saigo, H.; Tsuda, K.
Editors:Park, H.; Parthasarathy, S.; Liu, H.
Date of Publication (YYYY-MM-DD):2009-05
Title of Proceedings:Proceedings of the 2009 SIAM International Conference on Data Mining (SDM 2009)
Start Page:295
End Page:304
Physical Description:10
Audience:Not Specified
Intended Educational Use:No
Abstract / Description:Many real-world applications with graph data require
the efficient solution of a given regression task as well as the
identification of the subgraphs which are relevant for the task. In these cases graphs
are commonly represented as binary vectors of indicators of subgraphs, giving rise to an intractable input dimensionality.
An efficient solution to this problem was recently proposed by a Lasso-type
method where the objective function optimization over an intractable
number of variables is reformulated as a dual mathematical programming problem
over a small number of variables but a large number of constraints. The
dual problem is then solved by column generation where the subgraphs corresponding
to the most violated constraints are found by weighted subgraph mining.
This paper proposes an extension of this method to a fully Bayesian approach which
defines a prior distribution on the parameters and integrate them out from the model, thus providing a posterior distribution on the target variable as
opposed to a single estimate. The advantage of this approach is that
the extra information given by the target posterior distribution can be used for improving
the model in several ways. In this paper, we use the target posterior variance as a measure of uncertainty in the
prediction and show that, by rejecting unconfident predictions, we can improve state-of-the-art
performance on several molecular graph datasets.
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Holger Fischer
Affiliations:MPI für biologische Kybernetik/Empirical Inference (Dept. Schölkopf)
Identifiers:LOCALID:5653
URL:http://www.siam.org/meetings/sdm09/
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.