An approximate algorithm for median graph computation using graph embedding
Tipus de documentText en actes de congrés
EditorInstitute of Electrical and Electronics Engineers (IEEE)
Condicions d'accésAccés restringit per política de l'editorial
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for instance, how to obtain a representative of a set of graphs. The median graph has been defined for that purpose, but existing algorithms are computationally complex and have a very limited applicability. In this paper we propose a new approach for the computation of the median graph based on graph embedding in vector spaces. Experiments on a real database containing large graphs show that we succeed to compute good approximations of the median graph. We have also applied the median graph to perform some basic classification tasks achieving reasonable good results.
CitacióFerrer, M. [et al.]. An approximate algorithm for median graph computation using graph embedding. A: International Conference on Pattern Recognition. "19th International Conference on Pattern Recognition, 2008: ICPR 2008: 8-11 Dec. 2008, Tampa, Florida, USA". Tampa, Florida: Institute of Electrical and Electronics Engineers (IEEE), 2008, p. 1-4.
|An approximate ... using graph embedding.pdf||An approximate algorithm for median graph computation using graph embedding||301.7Kb||Accés restringit|