Suche
Anzeige der Einträge 1-10 von 43
Classification and Clustering of Vector Space Embedded Graphs
(2011)
Emerging Topics in Computer Vision and its Applications
04 - Beitrag Sammelband oder Konferenzschrift
Classification and Clustering of Vector Space Embedded Graphs. Series in Machine Perception and Artificial Intelligence
(World Scientific, 2010)
02 - Monographie
Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation
(Springer, 2014)
Artificial Neural Networks in Pattern Recognition - 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014, Proceedings
Graph edit distance (GED) is a powerful and flexible graph dissimilarity model. Yet, exact computation of GED is an instance of a quadratic assignment problem and can thus be solved in exponential time complexity only. A ...
04B - Beitrag Konferenzschrift
A Graph-Based Recommender for Enhancing the Assortment of Web Shops
(2015)
Proceedings of Workshop on Data Mining in Marketing DMM'2015
In this work, we consider a situation where multiple Providers (competitors) serve a common market, using a common infrastructure of sales channels. More speci cally, we focus on multiple web shops that are run by the same ...
04B - Beitrag Konferenzschrift
On the Relevance of Local Neighbourhoods for Greedy Graph Edit Distance
(2016)
S+SSPR
04 - Beitrag Sammelband oder Konferenzschrift
Approximation of Graph Edit Distance by Means of a Utility Matrix
(2016)
Artificial neural networks in pattern recognition : 7th IAPR TC3 Workshop, ANNPR 2016, Proceedings
04B - Beitrag Konferenzschrift
Improving Approximate Graph Edit Distance by Means of a Greedy Swap Strategy
(2014)
22nd International Conference on Pattern Recognition, ICPR 2014, Stockholm, Sweden, August 24-28, 2014
The authors of the present paper previously introduced a fast approximation framework for the graph edit distance problem. The basic idea of this approximation is to build a square cost matrix C = (c ij ), where each entry ...
04 - Beitrag Sammelband oder Konferenzschrift
Iterative Bipartite Graph Edit Distance Approximation
(2014-04-10)
06 - Präsentation
A Fast Matching Algorithm for Graph-Based Handwriting Recognition
(2013)
Graph-Based Representations in Pattern Recognition
04B - Beitrag Konferenzschrift
A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching
(Springer, 2015)
Graph-Based Representations in Pattern Recognition - 10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China, May 13-15, 2015.
In recent years, a powerful approximation framework for graph edit distance computation has been introduced. This particular approximation is based on an optimal assignment of local graph structures which can be established ...
04B - Beitrag Konferenzschrift