Discriminative prototype selection methods for graph embedding

Publisher:
Elsevier
Publication Type:
Journal Article
Citation:
Pattern Recognition, 2013, 46 (6), pp. 1648 - 1657
Issue Date:
2013-01
Full metadata record
Files in This Item:
Filename Description Size
Manuscript.pdf368.52 kB
Adobe PDF
Graphs possess a strong representational power for many types of patterns. However, a main limitation in their use for pattern analysis derives from their difficult mathematical treatment. One way of circumventing this problem is that of transforming the graphs into a vector space by means of graph embedding. Such an embedding can be conveniently obtained by using a set of prototype graphs and a dissimilarity measure. However, when we apply this approach to a set of class-labelled graphs, it is challenging to select prototypes capturing both the salient structure within each class and inter-class separation. In this paper, we introduce a novel framework for selecting a set of prototypes from a labelled graph set taking their discriminative power into account. Experimental results showed that such a discriminative prototype selection framework can achieve superior results in classification compared to other well-established prototype selection approaches
Please use this identifier to cite or link to this item: