PARA TODA NECESIDAD SIEMPRE HAY UN LIBRO

Imagen de Google Jackets

Bridging the gap between graph edit distance and kernel machines / Michel Neuhaus, Horst Bunke

Por: Colaborador(es): Tipo de material: TextoTextoSeries Detalles de publicación: Hackensack, NJ : World Scientific, c2007Descripción: xi, 232 p. : il., gráf. ; 23 cmISBN:
  • 9812708170
  • 9789812708175
Tema(s): Clasificación LoC:
  • TK 7882 .P3 N485
Contenidos:
Introduction - Graph Matching - Graph and Subgraph - Exact Graph Matching - Error-Tolerant Graph Matching - Graph Edit Distance - Definition - Edit Cost Functions - Exact Algorithm - Efficient Approximate Algorithm - Quadratic Programming Algorithm - Nearest-Neighbor Classification - An Application : Data-Level Fusion of Graphs - Kernel Machines - Learning Theory - Kernel Functions - Kernel Machines - Nearest-Neighbor Classification Revisited - Graph Kernels - Kernel Machines for Graph Matching - Related Work - Trivial Similarity Kernel from Edit Distance - Kernel from Maximum-Similarity Edith Path - Diffusion Kernel from Edit Distance - Zero Graph Kernel from Edit Distance - Convolution Edit Kernel - Local Matching Kernel - Random Walk Edit Kernel - Experimental Results - Line Drawing and Image Graph Data Sets - Fingerprint Graph Data Set - Molecule Graph Data Set - Experimental Setup - Evaluation of Graph Edit Distance - Evaluation of Graph Kernels - Summary and Discussion - Conclusions
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
Valoración
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Biblioteca de origen Colección Signatura topográfica Copia número Estado Notas Fecha de vencimiento Código de barras Reserva de ítems
Libros para consulta en sala Libros para consulta en sala Biblioteca Antonio Enriquez Savignac Biblioteca Antonio Enriquez Savignac COLECCIÓN RESERVA TK 7882 .P3 N485 (Navegar estantería(Abre debajo)) 1 No para préstamo Desarrollo Humano 023581
Total de reservas: 0

Incluye bibliografía: p. 221-230 e índice

Introduction - Graph Matching - Graph and Subgraph - Exact Graph Matching - Error-Tolerant Graph Matching - Graph Edit Distance - Definition - Edit Cost Functions - Exact Algorithm - Efficient Approximate Algorithm - Quadratic Programming Algorithm - Nearest-Neighbor Classification - An Application : Data-Level Fusion of Graphs - Kernel Machines - Learning Theory - Kernel Functions - Kernel Machines - Nearest-Neighbor Classification Revisited - Graph Kernels - Kernel Machines for Graph Matching - Related Work - Trivial Similarity Kernel from Edit Distance - Kernel from Maximum-Similarity Edith Path - Diffusion Kernel from Edit Distance - Zero Graph Kernel from Edit Distance - Convolution Edit Kernel - Local Matching Kernel - Random Walk Edit Kernel - Experimental Results - Line Drawing and Image Graph Data Sets - Fingerprint Graph Data Set - Molecule Graph Data Set - Experimental Setup - Evaluation of Graph Edit Distance - Evaluation of Graph Kernels - Summary and Discussion - Conclusions

Fondos PIFI Compra 100513 1039.50

  • Universidad del Caribe
  • Con tecnología Koha