Wrappers for feature subset selection
Artificial Intelligence - Special issue on relevance
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
Mining Graph Data
Pattern Vectors from Algebraic Graph Theory
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph-Theoretic Techniques for Web Content Mining
Graph-Theoretic Techniques for Web Content Mining
The Dissimilarity Representation for Pattern Recognition: Foundations And Applications (Machine Perception and Artificial Intelligence)
A Riemannian approach to graph embedding
Pattern Recognition
Finding Prototypes For Nearest Neighbor Classifiers
IEEE Transactions on Computers
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
Bridging the Gap Between Graph Edit Distance and Kernel Machines
Bridging the Gap Between Graph Edit Distance and Kernel Machines
Graph embedding in vector spaces by means of prototype selection
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Kernels For Structured Data
Fast suboptimal algorithms for the computation of graph edit distance
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Transforming strings to vector spaces using prototype selection
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Towards the unification of structural and statistical pattern recognition
Pattern Recognition Letters
Hi-index | 0.00 |
Graphs provide us with a powerful and flexible representation formalism for object classification. The vast majority of classification algorithms, however, rely on vectorial data descriptions and cannot directly be applied to graphs. In the present paper a dissimilarity representation for graphs is used in order to explicitly transform graphs into n -dimensional vectors. This embedding aims at bridging the gap between the high representational power of graphs and the large amount of classification algorithms available for feature vectors. The basic idea is to regard the dissimilarities to n predefined prototype graphs as features. In contrast to previous works, the prototypes and in particular their number are defined by prototype reduction schemes originally developed for nearest neighbor classifiers. These reduction schemes enable us to omit the cumbersome validation of the embedding space dimensionality. With several experimental results we prove the robustness and flexibility of our new method and show the advantages of graph embedding based on prototypes gained by these reduction strategies.