Search Results

14 articles with title/keywords/abstract containing Graph edit distance

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Display per page 

Novel kernels for error-tolerant graph classification

Authors: Neuhaus, Michel; Riesen, Kaspar; Bunke, Horst

Source: Spatial Vision, Volume 22, Number 5, 2009 , pp. 425-441(17)

Publisher: VSP, an imprint of Brill

Semantic web services discovery based on structural ontology matching

Author: Martino, Beniamino Di

Source: International Journal of Web and Grid Services, Volume 5, Number 1, 17 March 2009 , pp. 46-65(20)

Publisher: Inderscience Publishers

Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering

Authors: Torsello, Andrea; Robles-Kelly, Antonio; Hancock, Edwin

Source: International Journal of Computer Vision, Volume 72, Number 3, May 2007 , pp. 259-285(27)

Publisher: Springer

Web mining with relational clustering

Authors: Runkler T.A.; Bezdek J.C.

Source: International Journal of Approximate Reasoning, Volume 32, Number 2, February 2003 , pp. 217-236(20)

Publisher: Elsevier

Self-organizing map for clustering in the graph domain

Authors: Gunter S.; Bunke H.

Source: Pattern Recognition Letters, Volume 23, Number 4, February 2002 , pp. 405-417(13)

Publisher: Elsevier

A graph distance metric combining maximum common subgraph and minimum common supergraph

Authors: Fernandez M.-L.; Valiente G.

Source: Pattern Recognition Letters, Volume 22, Number 6, May 2001 , pp. 753-758(6)

Publisher: Elsevier

Pattern Matching in Hypertext

Authors: Amir A.; Lewenstein M.; Lewenstein N.

Source: Journal of Algorithms, Volume 35, Number 1, April 2000 , pp. 82-99(18)

Publisher: Elsevier

Mean and maximum common subgraph of two graphs

Authors: Bunke H.; Kandel A.

Source: Pattern Recognition Letters, Volume 21, Number 2, February 2000 , pp. 163-168(6)

Publisher: Elsevier

Pattern Matching in Hypertext

Authors: Amir A.; Lewenstein M.; Lewenstein N.

Source: Journal of Algorithms, Volume 35, Number 1, April 2000 , pp. 82-99(18)

Publisher: Academic Press

Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem

Authors: Bunke H.; Munger A.; Jiang X.

Source: Pattern Recognition Letters, Volume 20, Number 11, November 1999 , pp. 1271-1277(7)

Publisher: Elsevier

A graph distance metric based on the maximal common subgraph

Authors: Bunke H.; Shearer K.

Source: Pattern Recognition Letters, Volume 19, Number 3, March 1998 , pp. 255-259(5)

Publisher: Elsevier

Cortical activity of good and poor spatial test performers during spatial and verbal processing studied with Slow Potential Topography

Authors: Bunke H.; Vitouch O.; Bauer H.; Gittler G.; Leodolter M.; Leodolter U.

Source: International Journal of Psychophysiology, Volume 27, Number 3, December 1997 , pp. 183-199(17)

Publisher: Elsevier

On a relation between graph edit distance and maximum common subgraph

Author: Bunke H.

Source: Pattern Recognition Letters, Volume 18, Number 8, August 1997 , pp. 689-694(6)

Publisher: Elsevier

Algorithms for Approximate Graph Matching

Authors: Wang J.T.L.; Zhang K.; Chirn G.-W.

Source: Information Sciences, Volume 82, Number 1, January 1995 , pp. 45-74(30)

Publisher: Elsevier

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A