IEEE Transactions on Pattern Analysis and Machine Intelligence
A graph distance metric combining maximum common subgraph and minimum common supergraph
Pattern Recognition Letters
Handbook of Fingerprint Recognition
Handbook of Fingerprint Recognition
Fusion of statistical and structural fingerprint classifiers
AVBPA'03 Proceedings of the 4th international conference on Audio- and video-based biometric person authentication
Classifier ensembles for vector space embedding of graphs
MCS'07 Proceedings of the 7th international conference on Multiple classifier systems
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Multiple classifier systems for embedded string patterns
ANNPR'06 Proceedings of the Second international conference on Artificial Neural Networks in Pattern Recognition
Hi-index | 0.00 |
The combination of multiple classifiers has been successful in improving classification accuracy in many pattern recognition problems. For graph matching, the fusion of classifiers is normally restricted to the decision level. In this paper we propose a novel fusion method for graph patterns. Our method detects common parts in graphs in an error-tolerant way using graph edit distance and constructs graphs representing the common parts only. In experiments, we demonstrate on two datasets that the method is able to improve the classification of graphs.