%0 Book Section
%T Median Graph Computation by Means of Graph Embedding into Vector Spaces
%A Miquel Ferrer
%A I. Bardaji
%A Ernest Valveny
%A Dimosthenis Karatzas
%A Horst Bunke
%E Yun Fu
%E Yungian Ma
%B Graph Embedding for Pattern Analysis
%D 2013
%I Springer New York
%@ 978-1-4614-4456-5
%F Miquel Ferrer2013
%O DAG
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=2421), last updated on Mon, 09 Nov 2015 13:36:26 +0100
%X In pattern recognition [8, 14], a key issue to be addressed when designing a system is how to represent input patterns. Feature vectors is a common option. That is, a set of numerical features describing relevant properties of the pattern are computed and arranged in a vector form. The main advantages of this kind of representation are computational simplicity and a well sound mathematical foundation. Thus, a large number of operations are available to work with vectors and a large repository of algorithms for pattern analysis and classification exist. However, the simple structure of feature vectors might not be the best option for complex patterns where nonnumerical features or relations between different parts of the pattern become relevant.
%U http://dx.doi.org/10.1007/978-1-4614-4457-2_3
%P 45-72