Andere Kunden interessierten sich auch für
![Kernel Mean Embedding of Distributions]( "Kernel Mean Embedding of Distributions")
Kernel Mean Embedding of Distributions104,99 €![Embedding Knowledge. Fusing the Internet of Things with the Semantic Web]( "Embedding Knowledge. Fusing the Internet of Things with the Semantic Web")
Embedding Knowledge. Fusing the Internet of Things with the Semantic Web46,75 €![PLANAR GRAPH DRAWING]( "PLANAR GRAPH DRAWING")
PLANAR GRAPH DRAWING111,99 €![Introduction on Support Vector Regression]( "Introduction on Support Vector Regression")
Introduction on Support Vector Regression15,95 €![Graph Based Web Recommendation System to Improve Time Efficiency]( "Graph Based Web Recommendation System to Improve Time Efficiency")
Graph Based Web Recommendation System to Improve Time Efficiency26,99 €![Graph-Based Keyword Spotting]( "Graph-Based Keyword Spotting")
Graph-Based Keyword Spotting101,99 €![Graph-Based Natural Language Processing and Information Retrieval]( "Graph-Based Natural Language Processing and Information Retrieval")
Graph-Based Natural Language Processing and Information Retrieval66,99 €
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.