Cargando…

Bridging the gap between graph edit distance and kernel machines /

In graph-based 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 in...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Neuhaus, Michel
Otros Autores: Bunke, Horst
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Singapore ; Hackensack, NJ : World Scientific Pub., ©2007.
Colección:Series in machine perception and artificial intelligence ; v. 68.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000 a 4500
001 EBOOKCENTRAL_ocn666956663
003 OCoLC
005 20240329122006.0
006 m o d
007 cr cn|||||||||
008 100929s2007 si a ob 001 0 eng d
040 |a IDEBK  |b eng  |e pn  |c IDEBK  |d UBY  |d E7B  |d OCLCQ  |d STF  |d OCLCQ  |d OCLCF  |d OCLCO  |d OCLCQ  |d EBLCP  |d N$T  |d YDXCP  |d DEBSZ  |d OCLCQ  |d AZK  |d COCUF  |d MOR  |d CCO  |d PIFAG  |d ZCU  |d OTZ  |d MERUC  |d OCLCQ  |d U3W  |d WRM  |d OCLCQ  |d NRAMU  |d ICG  |d INT  |d VT2  |d UKMGB  |d WYU  |d OCLCO  |d OCLCQ  |d DKC  |d OCLCQ  |d UKAHL  |d OCLCA  |d OCLCQ  |d LEAUB  |d UKCRE  |d OCLCQ  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL 
015 |a GBA924036  |2 bnb 
016 7 |a 014920162  |2 Uk 
019 |a 505148194  |a 646768796  |a 764501643  |a 850162656  |a 961533962  |a 962630779  |a 988466655  |a 992080484  |a 995041051  |a 1037731056  |a 1038700017  |a 1045468723  |a 1055360116  |a 1063814083  |a 1063985080  |a 1081296373  |a 1086435644  |a 1153525696 
020 |a 9789812770202  |q (electronic bk.) 
020 |a 9812770208  |q (electronic bk.) 
020 |z 9789812708175 
020 |z 9812708170 
029 1 |a AU@  |b 000053267463 
029 1 |a DEBBG  |b BV044175559 
029 1 |a DEBSZ  |b 431423202 
029 1 |a DEBSZ  |b 456526587 
029 1 |a NZ1  |b 13858151 
029 1 |a UKMGB  |b 014920162 
029 1 |a AU@  |b 000074662278 
035 |a (OCoLC)666956663  |z (OCoLC)505148194  |z (OCoLC)646768796  |z (OCoLC)764501643  |z (OCoLC)850162656  |z (OCoLC)961533962  |z (OCoLC)962630779  |z (OCoLC)988466655  |z (OCoLC)992080484  |z (OCoLC)995041051  |z (OCoLC)1037731056  |z (OCoLC)1038700017  |z (OCoLC)1045468723  |z (OCoLC)1055360116  |z (OCoLC)1063814083  |z (OCoLC)1063985080  |z (OCoLC)1081296373  |z (OCoLC)1086435644  |z (OCoLC)1153525696 
050 4 |a TK7882.P3  |b N465 2007 
072 7 |a SCI  |x 064000  |2 bisacsh 
072 7 |a TEC  |x 029000  |2 bisacsh 
072 7 |a COM  |x 000000  |2 bisacsh 
082 0 4 |a 006.6  |2 22 
049 |a UAMI 
100 1 |a Neuhaus, Michel. 
245 1 0 |a Bridging the gap between graph edit distance and kernel machines /  |c Michel Neuhaus, Horst Bunke. 
260 |a Singapore ;  |a Hackensack, NJ :  |b World Scientific Pub.,  |c ©2007. 
300 |a 1 online resource (xi, 232 pages) :  |b illustrations 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a data file 
490 1 |a Series in machine perception and artificial intelligence ;  |v v. 68 
504 |a Includes bibliographical references (pages 221-230) and index. 
505 0 |a 1. Introduction -- 2. Graph matching -- 3. Graph edit distance -- 4. Kernel machines -- 5. Graph kernels -- 6. Experimental results -- 7. Conclusions. 
520 |a In graph-based 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 error-tolerant graph matching. This book focuses on graph kernel functions that are highly tolerant towards structura. 
540 |a Current Copyright Fee: GBP17.50  |c 0.  |5 Uk 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Pattern recognition systems. 
650 0 |a Kernel functions. 
650 0 |a Matching theory. 
650 0 |a Machine learning. 
650 0 |a Graph theory. 
650 2 |a Pattern Recognition, Automated 
650 2 |a Machine Learning 
650 6 |a Reconnaissance des formes (Informatique) 
650 6 |a Noyaux (Mathématiques) 
650 6 |a Théorie du couplage. 
650 6 |a Apprentissage automatique. 
650 7 |a SCIENCE  |x System Theory.  |2 bisacsh 
650 7 |a TECHNOLOGY & ENGINEERING  |x Operations Research.  |2 bisacsh 
650 7 |a COMPUTERS  |x General.  |2 bisacsh 
650 7 |a Graph theory  |2 fast 
650 7 |a Kernel functions  |2 fast 
650 7 |a Machine learning  |2 fast 
650 7 |a Matching theory  |2 fast 
650 7 |a Pattern recognition systems  |2 fast 
650 7 |a Kerndarstellung  |2 gnd 
650 7 |a Maschinelles Lernen  |2 gnd 
650 7 |a Künstliche Intelligenz  |2 gnd 
650 7 |a Musteranalyse  |2 gnd 
650 7 |a Mustererkennung  |2 gnd 
700 1 |a Bunke, Horst. 
758 |i has work:  |a Bridging the gap between graph edit distance and kernel machines (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCG3G4kbQWMTGDJxp4gFvVC  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |a Neuhaus, Michel.  |t Bridging the gap between graph edit distance and kernel machines.  |d Singapore ; Hackensack, NJ : World Scientific Pub., ©2007  |z 9789812708175  |w (OCoLC)166388136 
830 0 |a Series in machine perception and artificial intelligence ;  |v v. 68. 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1193191  |z Texto completo 
938 |a Askews and Holts Library Services  |b ASKH  |n AH24684235 
938 |a EBL - Ebook Library  |b EBLB  |n EBL1193191 
938 |a ebrary  |b EBRY  |n ebr10255827 
938 |a EBSCOhost  |b EBSC  |n 235951 
938 |a YBP Library Services  |b YANK  |n 2915160 
994 |a 92  |b IZTAP