# Item

ITEM ACTIONSEXPORT

Released

Report

#### Towards the Inference of Graphs on Ordered Vertexes

##### MPS-Authors

##### Locator

There are no locators available

##### Fulltext (public)

There are no public fulltexts available

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Zien, A., Raetsch, G., & Ong, C.(2006). *Towards the Inference
of Graphs on Ordered Vertexes* (150).

Cite as: http://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.