Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 DetailsÜbersicht
  A Bayesian Approach to Graph Regression with Relevant Subgraph Selection

Chiappa, S., Saigo, H., & Tsuda, K. (2009). A Bayesian Approach to Graph Regression with Relevant Subgraph Selection. Proceedings of the 2009 SIAM International Conference on Data Mining (SDM 2009), 295-304.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-C4E3-9 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-C4E4-7
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Chiappa, S1, Autor           
Saigo, H1, Autor           
Tsuda, K1, Autor           
Park, Herausgeber
H., Herausgeber
Parthasarathy, S., Herausgeber
Liu, H., Herausgeber
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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.

Details

einblenden:
ausblenden:
Sprache(n):
 Datum: 2009-05
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: URI: http://www.siam.org/meetings/sdm09/
BibTex Citekey: 5653
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 2009 SIAM International Conference on Data Mining
Veranstaltungsort: Sparks, NV, USA
Start-/Enddatum: -

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 2009 SIAM International Conference on Data Mining (SDM 2009)
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Philadelphia, PA, USA : Society for Industrial and Applied Mathematics
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 295 - 304 Identifikator: -