This book is concerned with a fundamentally novel approach to
graph-based pattern recognition based on vector space embedding of
graphs. It aims at condensing the high representational power of
graphs into a computationally efficient and mathematically
convenient feature vector.
This volume utilizes the dissimilarity space representation
originally proposed by Duin and Pekalska to embed graphs in real
vector spaces. Such an embedding gives one access to all algorithms
developed in the past for feature vectors, which has been the
predominant representation formalism in pattern recognition and
related areas for a long time.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!