A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
On the Use of the Chi-Squared Distance for the Structured Learning of Graph Embeddings
2011
2011 International Conference on Digital Image Computing: Techniques and Applications
In this paper, we describe the use of concepts from the areas of structural and statistical pattern recognition for the purposes of recovering a mapping which can be viewed as an operator on the graph attribute-set. This mapping can be used to embed graphs into spaces where tasks such as classification and retrieval can be effected. To do this, we depart from concepts in graph theory so as to introduce mappings as operators over graph spaces. This treatment leads to the recovery of a mapping
doi:10.1109/dicta.2011.78
dblp:conf/dicta/ZhaoRZ11
fatcat:2ll5dyou4zcc5iwn3ut2jqxr7e