The median graph is a useful tool to cluster a set of graphs and obtain a prototype of them. The spectral graph theory is another approach to represent graphs and find "good" approximate solutions for the graph-matching problem. Recently, both approaches have been put together and a new representation has emerged, which is called Spectral-Median Graphs. In this paper, we summarize and compare two techniques to synthesize a Spectral-Median Graph: one is based on the correlation of the modal matrices and the other one is based on the averaging of the spectral modes. Results show that, although both approaches obtain good prototypes of the clusters, the first one is slightly more robust against the noise than the second one. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Ferrer, M., Serratosa, F., & Valveny, E. (2007). Evaluation of spectral-based methods for median graph computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4478 LNCS, pp. 580–587). Springer Verlag. https://doi.org/10.1007/978-3-540-72849-8_73
Mendeley helps you to discover research relevant for your work.