The Resource Bridging the gap between graph edit distance and kernel machines, Michel Neuhaus, Horst Bunke
Bridging the gap between graph edit distance and kernel machines, Michel Neuhaus, Horst Bunke
Resource Information
The item Bridging the gap between graph edit distance and kernel machines, Michel Neuhaus, Horst Bunke represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Massey University Library, University of New Zealand.This item is available to borrow from 1 library branch.
Resource Information
The item Bridging the gap between graph edit distance and kernel machines, Michel Neuhaus, Horst Bunke represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Massey University Library, University of New Zealand.
This item is available to borrow from 1 library branch.
 Summary
 In graphbased structural pattern recognition, the idea is to transform patterns into graphs and perform the analysis and recognition of patterns in the graph domain  commonly referred to as graph matching. A large number of methods for graph matching have been proposed. Graph edit distance, for instance, defines the dissimilarity of two graphs by the amount of distortion that is needed to transform one graph into the other and is considered one of the most flexible methods for errortolerant graph matching. This book focuses on graph kernel functions that are highly tolerant towards structura
 Language
 eng
 Extent
 1 online resource (xi, 232 pages)
 Contents

 1. Introduction
 2. Graph matching
 3. Graph edit distance
 4. Kernel machines
 5. Graph kernels
 6. Experimental results
 7. Conclusions
 Isbn
 9789812770202
 Label
 Bridging the gap between graph edit distance and kernel machines
 Title
 Bridging the gap between graph edit distance and kernel machines
 Statement of responsibility
 Michel Neuhaus, Horst Bunke
 Language
 eng
 Summary
 In graphbased structural pattern recognition, the idea is to transform patterns into graphs and perform the analysis and recognition of patterns in the graph domain  commonly referred to as graph matching. A large number of methods for graph matching have been proposed. Graph edit distance, for instance, defines the dissimilarity of two graphs by the amount of distortion that is needed to transform one graph into the other and is considered one of the most flexible methods for errortolerant graph matching. This book focuses on graph kernel functions that are highly tolerant towards structura
 http://library.link/vocab/creatorName
 Neuhaus, Michel
 Dewey number
 006.6
 Illustrations
 illustrations
 Index
 index present
 Literary form
 non fiction
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorName
 Bunke, Horst
 Series statement
 Series in machine perception and artificial intelligence
 Series volume
 v. 68
 http://library.link/vocab/subjectName

 Pattern recognition systems
 Kernel functions
 Matching theory
 Machine learning
 Graph theory
 Label
 Bridging the gap between graph edit distance and kernel machines, Michel Neuhaus, Horst Bunke
 Bibliography note
 Includes bibliographical references (pages 221230) and index
 Color
 multicolored
 Contents
 1. Introduction  2. Graph matching  3. Graph edit distance  4. Kernel machines  5. Graph kernels  6. Experimental results  7. Conclusions
 Control code
 ocn666956663
 Dimensions
 unknown
 Extent
 1 online resource (xi, 232 pages)
 Form of item
 online
 Isbn
 9789812770202
 Note
 World Scientific Publishing
 Other physical details
 illustrations
 Specific material designation
 remote
 System control number
 (OCoLC)666956663
 Label
 Bridging the gap between graph edit distance and kernel machines, Michel Neuhaus, Horst Bunke
 Bibliography note
 Includes bibliographical references (pages 221230) and index
 Color
 multicolored
 Contents
 1. Introduction  2. Graph matching  3. Graph edit distance  4. Kernel machines  5. Graph kernels  6. Experimental results  7. Conclusions
 Control code
 ocn666956663
 Dimensions
 unknown
 Extent
 1 online resource (xi, 232 pages)
 Form of item
 online
 Isbn
 9789812770202
 Note
 World Scientific Publishing
 Other physical details
 illustrations
 Specific material designation
 remote
 System control number
 (OCoLC)666956663
Library Links
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.massey.ac.nz/portal/Bridgingthegapbetweengrapheditdistanceand/5O95IXEu62g/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.massey.ac.nz/portal/Bridgingthegapbetweengrapheditdistanceand/5O95IXEu62g/">Bridging the gap between graph edit distance and kernel machines, Michel Neuhaus, Horst Bunke</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.massey.ac.nz/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.massey.ac.nz/">Massey University Library, University of New Zealand</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Bridging the gap between graph edit distance and kernel machines, Michel Neuhaus, Horst Bunke
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.massey.ac.nz/portal/Bridgingthegapbetweengrapheditdistanceand/5O95IXEu62g/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.massey.ac.nz/portal/Bridgingthegapbetweengrapheditdistanceand/5O95IXEu62g/">Bridging the gap between graph edit distance and kernel machines, Michel Neuhaus, Horst Bunke</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.massey.ac.nz/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.massey.ac.nz/">Massey University Library, University of New Zealand</a></span></span></span></span></div>