English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Report

Towards the Inference of Graphs on Ordered Vertexes

MPS-Authors
/persons/resource/persons84331

Zien,  A
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Friedrich Miescher Laboratory, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

/persons/resource/persons84153

Rätsch,  G
Friedrich Miescher Laboratory, Max Planck Society;

/persons/resource/persons84118

Ong,  CS
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Friedrich Miescher Laboratory, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

MPIK-TR-150.pdf
(Publisher version), 168KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Zien, A., Rätsch, G., & Ong, C.(2006). Towards the Inference of Graphs on Ordered Vertexes (150). Tübingen, Germany: Max Planck Institute for Biological Cybernetics.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-D09D-A
Abstract
We propose novel methods for machine learning of structured output
spaces. Specifically, we consider outputs which are graphs with
vertices that have a natural order.
We consider the usual adjacency matrix representation of
graphs, as well as two other representations for such a graph: (a)
decomposing the graph into a set of paths, (b) converting the graph
into a single sequence of nodes with labeled edges.
For each of the three representations, we propose an encoding and
decoding scheme. We also propose an evaluation measure for comparing
two graphs.