Abstract
Graphs provide us with a powerful and flexible representation formalism for pattern recognition. Yet, the vast majority of pattern recognition algorithms rely on vectorial data descriptions and cannot directly be applied to graphs. In order to overcome this severe limitation, an embedding of the underlying graphs in a vector space ℝn is employed. The basic idea is to regard the dissimilarities of a graph g to a number of prototype graphs as numerical features of g. In previous works, the prototypes are selected beforehand with selection strategies based on some heuristics. In the present paper we take a more fundamental approach and regard the problem of prototype selection as a feature selection problem, for which many methods are available. With several experimental results we show the feasibility of graph embedding based on prototypes obtained from feature selection algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. Journal of Pattern Recognition and Artificial Intelligence 18(3), 265–298 (2004)
Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1, 245–253 (1983)
Luo, B., Wilson, R., Hancock, E.: Spectral embedding of graphs. Pattern Recognition 36(10), 2213–2223 (2003)
Caelli, T., Kosinov, S.: Inexact graph matching using eigen-subspace projection clustering. Int. Journal of Pattern Recognition and Artificial Intelligence 18(3), 329–355 (2004)
Pekalska, E., Duin, R.: The Dissimilarity Representation for Pattern Recognition: Foundations and Applications. World Scientific, Singapore (2005)
Riesen, K., Bunke, H.: Graph classification based on vector space embedding. Int. Journal of Pattern Recognition and Artificial Intelligence (2008) (accepted for publication)
Langley, P.: Selection of relevant features in machine learning. In: AAAI Fall Symposium on Relevance, pp. 140–144 (1994)
Kohavi, R., John, G.: Wrappers for feature subset selection. Artificial Intelligence 97(1-2), 273–324 (1997)
Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing 27(4), 950–959 (2009)
Wang, Y., Tetko, I., Hall, M., Frank, E., Facius, A., Mayer, K., Mewes, H.W.: Gene selection from microarray data for cancer classification – a machine learning approach. Computational Biology and Chemistry 29, 37–46 (2005)
Pudil, P., Novovicova, J., Kittler, J.: Floating search methods in feature-selection. Pattern Recognition Letters 15(11), 1119–1125 (1994)
Peng, H., Long, F., Ding, C.: Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans. on Pattern Analysis and Machine Intelligence 27(8), 1226–1238 (2005)
Guyon, I., Weston, J., Barnhill, S., Vapnik, V.: Gene selection for cancer classification using support vector machines. Machine Learning 46(1-3), 389–422 (2002)
Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol. 5342, pp. 287–297. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Riesen, K., Bunke, H. (2009). Feature Ranking Algorithms for Improving Classification of Vector Space Embedded Graphs. In: Jiang, X., Petkov, N. (eds) Computer Analysis of Images and Patterns. CAIP 2009. Lecture Notes in Computer Science, vol 5702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03767-2_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-03767-2_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03766-5
Online ISBN: 978-3-642-03767-2
eBook Packages: Computer ScienceComputer Science (R0)