default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Neuhaus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[p1]Horst Bunke, Peter J. Dickinson, Miro Kraetzl, Michel Neuhaus, Marc Stettler:
Matching of Hypergraphs - Algorithms, Applications, and Experiments. Applied Pattern Recognition 2008: 131-154- 2007
- [b1]Michel Neuhaus, Horst Bunke:
Bridging the Gap between Graph Edit Distance and Kernel Machines. Series in Machine Perception and Artificial Intelligence 68, WorldScientific 2007, ISBN 978-981-270-817-5, pp. 1-244 - [j4]Michel Neuhaus, Horst Bunke:
Automatic learning of cost functions for graph edit distance. Inf. Sci. 177(1): 239-247 (2007) - [c15]Kaspar Riesen
, Michel Neuhaus, Horst Bunke:
Bipartite Graph Matching for Computing the Edit Distance of Graphs. GbRPR 2007: 1-12 - [c14]Michel Neuhaus, Horst Bunke:
A Quadratic Programming Approach to the Graph Edit Distance Problem. GbRPR 2007: 92-102 - [c13]Kaspar Riesen, Michel Neuhaus, Horst Bunke:
Graph Embedding in Vector Spaces by Means of Prototype Selection. GbRPR 2007: 383-393 - 2006
- [j3]Michel Neuhaus, Horst Bunke:
Edit distance-based kernel functions for structural pattern classification. Pattern Recognit. 39(10): 1852-1863 (2006) - [c12]Barbara Spillmann, Michel Neuhaus, Horst Bunke:
Multiple Classifier Systems for Embedded String Patterns. ANNPR 2006: 177-187 - [c11]Michel Neuhaus, Horst Bunke:
A Convolution Edit Kernel for Error-tolerant Graph Matching. ICPR (4) 2006: 220-223 - [c10]Michel Neuhaus, Kaspar Riesen, Horst Bunke:
Fast Suboptimal Algorithms for the Computation of Graph Edit Distance. SSPR/SPR 2006: 163-172 - [c9]Michel Neuhaus, Horst Bunke:
A Random Walk Kernel Derived from Graph Edit Distance. SSPR/SPR 2006: 191-199 - [c8]Barbara Spillmann, Michel Neuhaus, Horst Bunke, Elzbieta Pekalska, Robert P. W. Duin:
Transforming Strings to Vector Spaces Using Prototype Selection. SSPR/SPR 2006: 287-296 - 2005
- [j2]Michel Neuhaus, Horst Bunke:
Self-organizing maps for learning the edit costs in graph matching. IEEE Trans. Syst. Man Cybern. Part B 35(3): 503-514 (2005) - [c7]Michel Neuhaus, Horst Bunke:
A Graph Matching Based Approach to Fingerprint Classification Using Directional Variance. AVBPA 2005: 191-200 - [c6]Michel Neuhaus, Horst Bunke:
Edit Distance Based Kernel Functions for Attributed Graph Matching. GbRPR 2005: 352-361 - [c5]Horst Bunke, Christophe Irniger, Michel Neuhaus:
Graph Matching - Challenges and Potential Solutions. ICIAP 2005: 1-10 - [c4]Michel Neuhaus, Horst Bunke:
Graph-Based Multiple Classifier Systems A Data Level Fusion Approach. ICIAP 2005: 479-486 - 2004
- [j1]Peter J. Dickinson, Miro Kraetzl, Horst Bunke, Michel Neuhaus, Arek Dadej:
Similarity Measures For Hierarchical Representations Of Graphs With Unique Node Labels. Int. J. Pattern Recognit. Artif. Intell. 18(3): 425-442 (2004) - [c3]Michel Neuhaus, Horst Bunke:
A Probabilistic Approach to Learning Costs for Graph Edit Distance. ICPR (3) 2004: 389-393 - [c2]Michel Neuhaus, Horst Bunke:
An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification. SSPR/SPR 2004: 180-189 - 2003
- [c1]Michel Neuhaus, Horst Bunke:
Self-Organizing Graph Graph Edit Distance. GbRPR 2003: 83-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
