Graph classification and clustering based on vector space embedding

Graph Classification And Clustering Based On Vector Space Embedding

Volumn , Issue , 2010, Pages 1-331

  Riesen, Kaspar ^a   Bunke, Horst ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85111457099     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/7731     Document Type: Book

References (321)

1. R. Duda, P. Hart, and D. Stork. Pattern Classification. Wiley-Interscience, 2nd edition, 2000.
2. L. Kuncheva. Combining Pattern Classifiers: Methods and Algorithms. John Wiley, 2004.
3. M. Nadler and E.P. Smith. Pattern Recognition Engineering. John Wiley & Sons, 1992.
4. E. Pekalska and R. Duin. The Dissimilarity Representation for Pattern Recognition: Foundations and Applications. World Scientific, 2005.
5. J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
6. J.J. Hull, G. Krishnan, P. Palumbo, and S.N. Srihari. Optical character recognition techniques in mail sorting: A review of algorithms. Technical report, Department of Computer Science University at Buffalo, State University of New York, 1984.
7. Y. Lu and C.L. Tan. Combination of multiple classifiers using probabilistic dictionary and its application to postcode recognition. Pattern Recognition, 35(12):2823-2832, 2000.
8. L. Zhang, J. Zhu, and T. Yao. An evaluation of statistical spam filtering techniques. ACM Transactions on Asian Language Information Processing, 3(4):243-269, 2004.
9. A. Kolcz and J. Alspector. SVM-based filtering of e-mail spam with content-specific misclassification costs. In Proc. Workshop on Text Mining TextDM, 2001.
10. F. Sebastiani. Machine learning in automated text categorization. ACM Computing Surveys, 34(1):1-47, 2002.
11. A. Vinciarelli. Noisy text categorization. In Proc. of the 17th Int. Conference on Pattern Recognition, volume 2, pages 554-557, 2004.
12. A. Juan and E. Vidal. On the use of Bernoulli mixture models for text classification. Pattern Recognition, 35(12):2705-2710, 2002.
13. R. Bertolami, S. Uchida, M. Zimmermann, and H. Bunke. Non-uniform slant correction for handwritten text line recognition. In Proc. of the 9th Int. Conference on Document Analysis and Recognition, volume 1, pages 18-22, 2007.
14. M. Liwicki and H. Bunke. Recognition of Whiteboard Notes - Online, Offline and Combination. World Scientific, 2008.
15. M. Zimmermann, J.-C. Chappelier, and H. Bunke. Offline grammar-based recognition of handwritten sentences. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(5):818-821, 2006.
16. R. Kosala and B. Blockeel. Web mining research: a survey. SIGKDD Explorations, 2:1-15, 2000.
17. N. Zhong, J. Liu, and Y. Yao. In search of the wisdom web. Computer, 35(11):27-31, 2002.
18. A. Schlapbach and H. Bunke. A writer identification and verification system using HMM based recognizers. Pattern Analysis and Applications, 10(1):33-43, 2007.
19. A. Schlapbach and H. Bunke. Off-line writer identification and verification using Gaussian mixture models. In S. Marinai and H. Fujisawa, editors, Machine Learning in Document Analysis and Recognition, volume 90. Springer, 2008.
20. A.K. Jain, S. Prabhakar, and L. Hong. A multichannel approach to fingerprint classification. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(4):348-359, 1999.
21. M. Neuhaus and H. Bunke. A graph matching based approach to fingerprint classification using directional variance. In T. Kanade, A. Jain, and N.K. Ratha, editors, Proc. 5th Int. Conference on Audio- and Video-Based Biometric Person Authentication, LNCS 3546, pages 191-200. Springer, 2005.
22. A. Serrau, G.L. Marcialis, H. Bunke, and F. Roli. An experimental comparison of fingerprint classification methods using graphs. In Proc. 5th Int. Workshop on Graph-based Representations in Pattern Recognition, LNCS 3434, pages 281-290. Springer, 2005.
23. N. Yager and A. Amin. Fingerprint classification: A review. Pattern Analysis and Applications, 7(1):77-93, 2004.
24. Y. Xu and E.C. Uberbacher. Gene prediction by pattern recognition and homology search. In Proc. Of the Fourth Int. Conference on Intelligent Systems for Molecular Biology, pages 241-251, 1996.
25. E. Dougherty. The fundamental role of pattern recognition for gene-expression/microarray data in bioinformatics. Pattern Recognition, 38(12):2226-2228, 2005.
26. R.D. Brown and Y.C. Martin. Use of structure-activity data to compare structure-based clustering methods and descriptors for use in compound selection. Journal of Chemical Information and Computer Sciences, 36(3):572-584, 1996.
27. P. Mahe, N. Ueda, and T. Akutsu. Graph kernels for molecular structures - activity relationship analysis with support vector machines. Journal of Chemical Information and Modeling, 45(4):939-951, 2005.
28. M. Neuhaus and H. Bunke. Bridging the Gap Between Graph Edit Distance and Kernel Machines. World Scientific, 2007.
29. N.A. Fox, R. Gross, J.F. Cohn, and R.B. Reilly. Robust biometric person identification using automatic classifier fusion of speech, mouth, and face expert. IEEE Transactions on Multimedia, 9(4):701-714, 2007.
30. N. Arica and F.T. Yarman-Vural. Optical character recognition for cursive handwriting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(6):801-813, 2002.
31. J.G. Wolff. Medical diagnosis as pattern recognition in a framework of information compression by multiple alignment, unification and search. Decision Support Systems, 42(2):608-625, 2006.
32. A.K. Jain, M.N. Murty, and P.J. Flynn. Data clustering: A review. ACM Computing Surveys, 31(3):264-323, 1999.
33. R. Xu and D. Wunsch. Survey of graph clustering algorithms. IEEE Transactions on Neural Networks, 16(3):645-678, 2005.
34. A.K. Jain and R.C. Dubes. Algorithms For Clustering Data. Prentice-Hall, Englewood Cliffs, NJ, 1988.
35. O. Chapelle, B. Scholkopf, and A. Zien, editors. Semi-Supervised Learning. MIT Press, 2006.
36. K.S. Fu. Syntactic Pattern Recognition and Applications. Prentice-Hall, 1982.
37. C. Bishop. Pattern Recognition and Machine Learning. Springer, 2008.
38. H. Bunke. Structural and Syntactic pattern recognition. In C.H. Chen, Pau L.F., and P.S.P. Wang, editors, Handbook of Pattern Recognition and, Computer Vision, pages 163-210. World Scientific, 1992.
39. K. Borgwardt. Graph Kernels. PhD thesis, Ludwig-Maximilians-University Munich, 2007.
40. D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. Int. Journal of Pattern Recognition and Artificial Intelligence, 18(3):265-298, 2004.
41. A. Kandel, H. Bunke, and M. Last, editors. Applied Graph Theory in Computer Vision and Pattern Recognition, volume 52 of Studies in Computational Intelligence. Springer, 2007.
42. H. Bunke, P.J. Dickinson, M. Kraetzl, and W.D. Wallis. A Graph-Theoretic Approach to Enterprise Network Dynamics, volume 24 of Progress in Computer Science and Applied Logic (PCS). Birkhauser, 2007.
43. D. Cook and L. Holder, editors. Mining Graph Data. Wiley-Interscience, 2007.
44. K. Borgwardt, C. Ong, S. Schonauer, S. Vishwanathan, A. Smola, and H.-P. Kriegel. Protein function prediction via graph kernels. Bioinformatics, 21(1):47-56, 2005.
45. K. Borgwardt and H.-P. Kriegel. Shortest-path kernels on graphs. In Proc. 5th Int. Conference on Data Mining, pages 74-81, 2005.
46. L. Ralaivola, S.J. Swamidass, H Saigo, and P. Baldi. Graph kernels for chemical informatics. Neural Networks, 18(8):1093-1110, 2005.
47. A. Schenker, H. Bunke, M. Last, and A. Kandel. Graph-Theoretic Techniques for Web Content Mining. World Scientific, 2005.
48. A. Schenker, M. Last, H. Bunke, and A. Kandel. Classification of web documents using graph matching. Int. Journal of Pattern Recognition and Artificial Intelligence, 18(3):475-496, 2004.
49. B. Le Saux and H. Bunke. Feature selection for graph-based image classifiers. In J. Marques, N. Perez de Blanca, and P. Pina, editors, Proc. 2nd Iberian Conference on Pattern Recognition and Image Analysis, Part II, LNCS 3523, pages 147-154. Springer, 2005.
50. Z. Harchaoui and F. Bach. Image classification with segmentation graph kernels. In IEEE Conference on Computer Vision and Pattern Recognition, pages 1-8, 2007.
51. B. Luo, R. Wilson, and E. Hancock. Spectral embedding of graphs. Pattern Recognition, 36(10):2213-2223, 2003.
52. M. Neuhaus and H. Bunke. An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification. In A. Fred, T. Caelli, R. Duin, A. Campilho, and D. de Rid-der, editors, Proc. 10th Int. Workshop on Structural and Syntactic Pattern Recognition, LNCS 3138, pages 180-189. Springer, 2004.
53. R. Ambauen, S. Fischer, and H. Bunke. Graph edit distance with node splitting and merging and its application to diatom identification. In E. Hancock and M. Vento, editors, Proc. 4th Int. Workshop on Graph Based Representations in Pattern Recognition, LNCS 2726, pages 95-106. Springer, 2003.
54. S. Fischer. Automatic Identification of Diatoms. PhD thesis, University of Bern, 2002.
55. D. Maio and D. Maltoni. A structural approach to fingerprint classification. In Proc. 13th Int. Conference on Pattern Recognition, pages 578-585, 1996.
56. J. Llados and G. Sanchez. Graph matching versus graph parsing in graphics recognition. Int. Journal of Pattern Recognition and Artificial Intelligence, 18(3):455-475, 2004.
57. L.P. Cordella, P. Foggia, C. Sansone, and M. Vento. Fast graph matching for detecting CAD image components. In Proc. 15th Int. Conference on Pattern Recognition, volume 2, pages 1038-1041, 2000.
58. J. Rocha and T. Pavlidis. A shape analysis model with applications to a character recognition system. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(4):393-404, 1994.
59. P.N. Suganthan and H. Yan. Recognition of handprinted Chinese characters by constrained graph matching. Image and Vision Computing, 16(3):191-201, 1998.
60. P. Dickinson, H. Bunke, A. Dadej, and M. Kraetzl. On graphs with unique node labels. In E. Hancock and M. Vento, editors, Proc. 4th Int. Workshop on Graph Based Representations in Pattern Recognition, LNCS 2726, pages 13-23. Springer, 2003.
61. P.J. Dickinson, H. Bunke, A. Dadej, and M. Kraetzl. Matching graphs with unique node labels. Pattern Analysis and Applications, 7(3):243-254, 2004.
62. P.J. Dickinson, M. Kraetzl, H. Bunke, M. Neuhaus, and A. Dadej. Similarity measures for hierarchical representations of graphs with unique node labels. Int. Journal of Pattern Recognition and Artificial Intelligence, 18(3):425-442, 2004.
63. E. Pekalska and R. Duin. Classifiers for dissimilarity-based pattern recognition. In 15th Int. Conference on Pattern Recognition, volume 2, pages 12-16, 2000.
64. E. Pekalska and R. Duin. Automatic pattern recognition by similarity representations. Electronic Letters, 37(3):159-160, 2001.
65. E. Pekalska and R. Duin. Dissimilarity representations allow for building good classifiers. Pattern Recognition Letters, 23(8):943-956, 2002.
66. E. Pekalska, R. Duin, and P. Paclik. Prototype selection for dissimilarity-based classifiers. Pattern Recognition, 39(2):189-208, 2006.
67. R. Duin and E. Pekalska. Possibilities of zero-error recognition by dissimilarity representations. In J.M. Inesta and L. Mico, editors, Pattern Recognition in Information Systems, 2002.
68. R. Duin, E. Pekalska, P. Paclik, and D. Tax. The dissimilarity representation, a basis for domain based pattern recognition? In L. Goldfarb, editor, Pattern Representation and the Future of Pattern Recognition, ICPR Workshop Proceedings, pages 43-56, 2004.
69. S. Edelman and S. Duvdevani-Bar. Similarity, connectionism, and the problem of representation in vision. Neural Computation, 9:701-720, 1997.
70. S. Edelman, S. Cutzu, and S. Duvdevani-Bar. Representation is representation of similarities. Behavioral and Brain Sciences, 21:449-498, 1998.
71. S. Edelman. Representation and Recognition in Vision. MIT Press, 1999.
72. V. Mottl, S. Dvoenko, O. Seredin, C. Kulikowski, and I. Muchnik. Featureless regularized recognition of protein fold classes in a hilbert space of pairwise alignment scores as inner products of amino acid sequences. Pattern Recognition and Image Analysis, Advances in Mathematical Theory and Applications, 11(3):597-615, 2001.
73. A. Guerin-Dugue, P. Teissier, G. Delso Gafaro, and J. Herault. Curvilinear component analysis for high-dimensional data representation: II. examples of additional mapping constraints in specific applications. In Proc. Conference on Artificial and Natural Neural Networks, LNCS 1607, pages 635-644. Springer, 1999.
74. R. Duin, D. de Ridder, and D. Tax. Featureless pattern classification. Ky-bernetika, 34(4):399-404, 1998.
75. H. Bunke. Graph-based tools for data mining and machine learning. In P. Perner and A. Rosenfeld, editors, Proc. 3rd Int. Conference on Machine Learning and Data Mining in Pattern Recognition, LNAI 2734, pages 7-19. Springer, 2003.
76. Ch. Irniger. Graph Matching - Filtering Databases of Graphs Using Machine Learning Techniques. PhD thesis, University of Bern, 2005.
77. H. Bunke. Recent developments in graph matching. In Proc. 15th Int. Conference on Pattern Recognition, volume 2, pages 117-124, 2000.
78. E.M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and Systems Sciences, 25:42-65, 1982.
79. P. Foggia, C. Sansone, and M. Vento. A database of graphs for isomorphism and subgraph isomorphism benchmarking. In Proc. 3rd Int. Workshop on Graph Based Representations in Pattern Recognition, pages 176-187, 2001.
80. J.E. Hopcroft and J. Wong. Linear time algorithm for isomorphism of planar graphs. In Proc. 6th Annual ACM Symposium on Theory of Computing, pages 172-184, 1974.
81. K. Zhang, R. Statman, and D. Shasha. On the editing distance between unordered labelled trees. Information Processing Letters, 42(3):133-139, 1992.
82. M. Pelillo, K. Siddiqi, and S. Zucker. Matching hierarchical structures using association graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(11):1105-1120, 1999.
83. M. Pelillo. Matching free trees, maximal cliques and monotone game dynamics. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(11):1535-1541, 2002.
84. A. Torsello and E. Hancock. Computing approximate tree edit distance using relaxation labeling. Pattern Recognition Letters, 24(8):1089-1097, 2003.
85. A. Torsello, D. Hidovic-Rowe, and M. Pelillo. Polynomial-time metrics for attributed trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(7):1087-1099, 2005.
86. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., 1979.
87. B. Aspvall and R.E. Stone. Khachiyan’s linear programming algorithm. Journal of Algorithms, 1(1):1-13, 1980.
88. M Agrawal, N. Kayal, and N. Saxena. PRIMES is in P. Annals of Mathematics, 160(2):781-793, 2004.
89. I. Wegener. Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer, 2005.
90. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.
91. X. Jiang and H. Bunke. Optimal quadratic-time isomorphism of ordered graphs. Pattern Recognition, 32(17):1273-1283, 1999.
92. J.R. Ullmann. An algorithm for subgraph isomorphism. Journal of the Association for Computing Machinery, 23(1):31-42, 1976.
93. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. An improved algorithm for matching large graphs. In Proc. 3rd Int. Workshop on Graph Based Representations in Pattern Recognition, 2001.
94. L.P. Cordella, P. Foggia, C. Sansone, and M. Vento. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(20):1367-1372, 2004.
95. J. Larrosa and G. Valiente. Constraint satisfaction algorithms for graph pattern matching. Mathematical Structures in Computer Science, 12(4):403-422, 2002.
96. B.D. McKay. Practical graph isomorphism. Congressus Numerantium, 30:45-87, 1981.
97. H. Bunke and B. Messmer. Recent advances in graph matching. Int. Journal of Pattern Recognition and Artificial Intelligence, 11:169-203, 1997.
98. B. Messmer and H. Bunke. A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition, 32(12):1979-1998, 1999.
99. G. Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9:341-354, 1972.
100. C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM, 16(9):575-577, 1973.
101. E. Balas and C.S. Yu. Finding a maximum clique in an arbitrary graph. SIAM Journal on Computing, 15(4):1054-1068, 1986.
102. H. Bunke, P. Foggia, C. Guidobaldi, C. Sansone, and M. Vento. A comparison of algorithms for maximum common subgraph on randomly connected graphs. In T. Caelli, A. Amin, R. Duin, M. Kamel, and D. de Ridder, editors, Proc. Of the Int. Workshops on Structural, Syntactic, and Statistical Pattern Recognition, pages 85-106. Springer, 2002. LNCS 2396.
103. J.J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Software Practice and Experience, 12:23-34, 1982.
104. H. Bunke and K. Shearer. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19(3):255-259, 1998.
105. W.D. Wallis, P. Shoubridge, M. Kraetzl, and D. Ray. Graph distances using graph union. Pattern Recognition Letters, 22(6):701-704, 2001.
106. H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18:689-694, 1997.
107. M.-L. Fernandez and G. Valiente. A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters, 22(6-7):753-758, 2001.
108. H. Bunke, X. Jiang, and A. Kandel. On the minimum common supergraph of two graphs. Computing, 65(1):13-25, 2000.
109. W.H. Tsai and K.S. Fu. Error-correcting isomorphism of attributed relational graphs for pattern analysis. IEEE Transactions on Systems, Man, and Cybernetics (Part B), 9(12):757-768, 1979.
110. W.H. Tsai and K.S. Fu. Subgraph error-correcting isomorphisms for syntactic pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics (Pa.rt B), 13:48-61, 1983.
111. E.K. Wong. Three-dimensional object recognition by attributed graphs. In H. Bunke and A. Sanfeliu, editors, Syntactic and Structural Pattern Recognition: Theory and Applications, pages 381-414. World Scientific, 1990.
112. A. Sanfeliu and K.S. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics (Part B), 13(3):353-363, 1983.
113. H. Bunke and G. Allermann. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters, 1:245-253, 1983.
114. A.C.M. Dumay, R.J. van der Geest, J.J. Gerbrands, E. Jansen, and J.H.C Reiber. Consistent inexact graph matching applied to labelling coronary-segments in arteriograms. In Proc. 11th Int. Conference on Pattern Recognition, volume 3, pages 439-442, 1992.
115. L. Gregory and J. Kittler. Using graph search techniques for contextual colour retrieval. In T. Caelli, A. Amin, R.P.W. Duin, M. Kamel, and D. de Ridder, editors, Proc. Of the Int. Workshops on Structural, Syntactic, and Statistical Pattern Recognition, LNCS 2396, pages 186-194, 2002.
116. S. Berretti, A. Del Bimbo, and E. Vicario. Efficient matching and indexing of graph models in content-based retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10):1089-1105, 2001.
117. K. Riesen, S. Fankhauser, and H. Bunke. Speeding up graph edit distance computation with a bipartite heuristic. In P. Frasconi, K. Kersting, and K. Tsuda, editors, Proc. 5th. Int. Workshop on Mining and Learning with Graphs, pages 21-24, 2007.
118. P.E. Hart, N.J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science, and Cybernetics, 4(2):100-107, 1968.
119. M.C. Boeres, C.C. Ribeiro, and I. Bloch. A randomized heuristic for scene recognition by graph matching. In C.C. Ribeiro and S.L. Martins, editors, Proc. 3rd Workshop on Efficient and Experimental Algorithms, LNCS 3059, pages 100-113. Springer, 2004.
120. S. Sorlin and C. Solnon. Reactive tabu search for measuring graph similarity. In L. Brun and M. Vento, editors, Proc. 5th Int. Workshop on Graph-based Representations in Pattern Recognition, LNCS 3434, pages 172-182. Springer, 2005.
121. M. Neuhaus, K. Riesen, and H. Bunke. Fast suboptimal algorithms for the computation of graph edit distance. In Dit-Yan Yeung, J.T. Kwok, A. Fred, F. Roli, and D. de Ridder, editors, Proc. 11.th int. Workshop on Structural and Syntactic Pattern Recognition, LNCS 4109, pages 163-172. Springer, 2006.
122. D. Justice and A. Hero. A binary linear programming formulation of the graph edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(8):1200-1214, 2006.
123. M.A. Eshera and K.S. Fu. A graph distance measure for image analysis. IEEE Transactions on Systems, Man, and Cybernetics (PartB), 14(3):398-408, 1984.
124. M.A. Eshera and K.S. Fu. A similarity measure between attributed relational graphs for image analysis. In Proc. 7th Int. Conference on Pattern Recognition, pages 75-77, 1984.
125. K. Riesen, M. Neuhaus, and H. Bunke. Bipartite graph matching for computing the edit distance of graphs. In F. Escolano and M. Vento, editors, Proc. 6th Int. Workshop on Graph Based Representations in Pattern Recognition, LNCS 4538, pages 1-12, 2007.
126. K. Riesen and H. Bunke. Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing, 27(4):950-959, 2009.
127. A. Cross, R. Wilson, and E. Hancock. Inexact graph matching using genetic search. Pattern Recognition, 30(6):953-970, 1997.
128. I. Wang, K.-C. Fan, and J.-T. Horng. Genetic-based search for error-correcting graph isomorphism. IEEE Transactions on Systems, Man, and Cybernetics (Part B), 27(4):588-597, 1997.
129. M. Singh, A. Chatterjee, and S. Chaudhury. Matching structural shape de-scriptions using genetic algorithms. Pattern Recognition, 30(9):1451-1462, 1997.
130. P.N. Suganthan. Structural pattern recognition using genetic algorithms. Pattern Recognition, 35(9):1883-1893, 2002.
131. M.A. Fischler and R.A. Elschlager. The representation and matching of pictorial structures. IEEE Transactions on Computers, 22(1):67-92, 1973.
132. J. Kittler and E. Hancock. Combining evidence in probabilistic relaxation. Int. Journal of Pattern Recognition and Artificial Intelligence, 3(1):29-51, 1989.
133. E. Hancock and J. Kittler. Discrete relaxation. Pattern Recognition, 23(7):711-733, 1990.
134. W.J. Christmas, J. Kittler, and M. Petrou. Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysis and, Machine Intelligence, 17(8):749-764, 1995.
135. R.C. Wilson and E. Hancock. Structural matching by discrete relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(6):634-648, 1997.
136. B. Huet and E. Hancock. Shape recognition from large image libraries by inexact graph matching. Pattern Recognition Letters, 20(11-13):1259-1269, 1999.
137. R. Myers, R.C. Wilson, and E. Hancock. Bayesian graph edit distance. IEEE Transactions on Pattern Analysis and, Machine Intelligence, 22(6):628-635, 2000.
138. B. Schölkopf and A. Smola. Learning with Kernels. MIT Press, 2002.
139. T. Gartner. A survey of kernels for structured data. SIGKDD Explorations, 5(1):49-58, 2003.
140. T. Gartner, P. Flach, and S. Wrobel. On graph kernels: Hardness results and efficient alternatives. In B. Schölkopf and M. Warmuth, editors, Proc. 16th Annual Conference on Learning Theory, pages 129-143, 2003.
141. D. Haussler. Convolution kernels on discrete structures. Technical Report UCSC-CRL-99-10, University of California, Santa Cruz, 1999.
142. C. Watkins. Dynamic alignment kernels. In A. Smola, P.L. Bartlett, B. Scholkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 39-50. MIT Press, 2000.
143. C. Watkins. Kernels from matching operations. Technical Report CSD-TR-98-07, Royal Holloway College, 1999.
144. K. Borgwardt, T. Petri, H.-P. Kriegel, and S. Vishwanathan. An efficient sampling scheme for comparison of large graphs. In P. Frasconi, K. Kersting, and K. Tsuda, editors, Proc. 5th. Int. Workshop on Mining and Learning with Graphs, 2007.
145. T. Gartner. Exponential and geometric kernels for graphs. In NIPS Workshop on Unreal Data: Principles of Modeling Nonvectorial Data, 2002.
146. H. Kashima and A. Inokuchi. Kernels for graph classification. In Proc. ICDM Workshop on Active Mining, pages 31-36, 2002.
147. H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In Proc. 20th Int. Conference on Machine Learning, pages 321-328, 2003.
148. R. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete input spaces. In Proc. 19th Int. Conference on Machine Learning, pages 315-322, 2002.
149. J. Kandola, J. Shawe-Taylor, and N. Cristianini. Learning semantic similarity. Neural Information Processing Systems, 15(657-664), 2002.
150. A. Smola and R. Kondor. Kernels and regularization on graphs. In Proc. 16th. Int. Conference on Comptuational Learning Theory, pages 144-158, 2003.
151. J. Lafferty and G. Lebanon. Information diffusion kernels. In Advances in Neural Information Processing Systems, volume 15, pages 375-382. MIT Press, 2003.
152. J.-P. Vert and M. Kanehisa. Graph-driven features extraction from microarray data using diffusion kernels and kernel CCA. In Advances in Neural Information Processing Systems, volume 15, pages 1425-1432. MIT Press, 2003.
153. J. Lafferty and G. Lebanon. Diffusion kernels on statistical manifolds. Journal of Machine Learning Research, 6:129-163, 2005.
154. J. Ramon and T. Gartner. Expressivity versus efficiency of graph kernels. In Proc. First Int. Workshop on Mining Graphs, Trees and Sequences, pages 65-74, 2003.
155. T. Horvath, T. Gärtner, and S. Wrobel. Cyclic pattern kernels for predictive graph mining. In Proc. Int. Conference on Knowledge Discovery and Data Mining, pages 65-74. ACM Press, 2004.
156. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10(5):695-703, 1988.
157. T. Caelli and S. Kosinov. Inexact graph matching using eigen-subspace projection clustering. Int. Journal of Pattern Recognition and Artificial Intelligence, 18(3):329-355, 2004.
158. A. Shokoufandeh, D. Macrini, S. Dickinson, K. Siddiqi, and S.W. Zucker. Indexing hierarchical structures using graph spectra. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(7):1125-1140, 2005.
159. B. Luo, R. Wilson, and E. Hancock. Spectral feature vectors for graph clustering. In T. Caelli, A. Amin, R. Duin, M. Kamel, and D. de Ridder, editors, Proc. Of the Int. Workshops on Structural, Syntactic, and Statistical Pattern Recognition, pages 83-93. Springer, 2002. LNCS 2396.
160. S. Kosinov and T. Caelli. Inexact multisubgraph matching using graph eigenspace and clustering models. In T. Caelli, A. Amin, R. Duin, M. Kamel, and D. de Ridder, editors, Proc. Of the Int. Workshops on Structural, Syntactic, and Statistical Pattern Recognition, pages 133-142. Springer, 2002. LNCS 2396.
161. R.C. Wilson, E. Hancock, and B. Luo. Pattern vectors from algebraic graph theory. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(7):1112-1124, 2005.
162. A. Robles-Kelly and E. Hancock. A Riemannian approach to graph embedding. Pattern Recognition, 40:1024-1056, 2007.
163. P. Frasconi, M. Gori, and A. Sperduti. A general framework for adap-ive processing of data structures. IEEE Transactions on Neural Networks, 9(5):768-786, 1998.
164. A. Sperduti and A. Starita. Supervised neural networks for the classification of structures. IEEE Transactions on Neural Networks, 8(3):714-735, 1997.
165. P.N. Suganthan, E.K. Teoh, and D.P. Mital. Pattern recognition by homomorphic graph matching using Hopfield neural networks. Image and Vision Computing, 13(1):45-60, 1995.
166. P.N. Suganthan, E.K. Teoh, and D.P. Mital. Pattern recognition by graph matching using the potts MFT neural networks. Pattern Recognition, 28(7):997-1009, 1995.
167. P.N. Suganthan, E.K. Teoh, and D.P. Mital. Self-organizing Hopfield network for attributed relational graph matching. Image and Vision Computing, 13(1):61-73, 1995.
168. A. Micheli. Neural network for graphs: A contextual constructive approach. EEE Transactions on Neural Networks, 20(3):498-511, 2009.
169. F. Scarselli, M. Gori, A.C. Tsoi, M. Hagenbuchner, and G. Monfardini. The graph neural network model. IEEE Transactions on Neural Networks, 20(1):61-80, 2009.
170. Y. Yao, G.L. Marcialis, M. Pontil, P. Frasconi, and F. Roli. Combining flat and structured representations for fingerprint classification with recursive neural networks and support vector machines. Pattern Recognition, 36(2):397-406, 2003.
171. J. Feng, M. Laumy, and M. Dhome. Inexact matching using neural networks. In E.S. Gelsema and L.N. Kanal, editors, Pattern Recognition in Practice IV: Multiple Paradigms, Comparative Studies, and Hybrid Sys-ems, pages 177-184. North-Holland, 1994.
172. L. Xu and E. Oja. Improved simulated annealing: Boltzmann machine, and attributed graph matching. In L. Almeida, editor, Proc. Int. Workshop on Neural Networks, LNCS 412, pages 151-161. Springer, 1990.
173. K. Schaadler and F. Wysotzki. Comparing structures using a Hopfield-style neural network. Applied Intelligence, 11:15-30, 1999.
174. B. Jain and F. Wysotzki. Automorphism partitioning with neural networks. Neural Processing Letters, 17(2):205-215, 2003.
175. B. Jain and F. Wysotzki. Solving inexact graph isomorphism problems using neural networks. Neurocomputing, 63:45-67, 2005.
176. A.M. Finch, R.C. Wilson, and E. Hancock. Symbolic graph matching with the EM algorithm. Pattern Recognition, 31(11):1777-1790, 1998.
177. B. Luo and E. Hancock. Structural graph matching using the EM algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10):1120-1136, 2001.
178. M. Pelillo. Replicator equations, maximal cliques, and graph isomorphism. Neural Computation, 11(8):1933-1955, 1999.
179. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4):377-388, 1996.
180. A. Robles-Kelly and E. Hancock. String edit distance, random walks and graph matching. Int. Journal of Pattern Recognition and Artificial Intelligence, 18(3):315-327, 2004.
181. M. Gori, M. Maggini, and L. Sarti. Exact and approximate graph matching using random walks. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(7):1100-1111, 2005.
182. M.A. van Wyk, T.S. Durrani, and B.J. van Wyk. A RKHS interpolator-based graph matching algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(7):988-995, 2003.
183. M.A. van Wyk and J. Clark. An algorithm for approximate least-squares attributed graph matching. Problems in Applied Mathematics and Computational Intelligence, pages 67-72, 2001.
184. A.K.C. Wong and M. You. Entropy and distance of random graphs with application to structural pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(5):599-609, 1985.
185. A. Sanfeliu, F. Serratosa, and R. Alquezar. Second-order random graphs for modeling sets of attributed graphs and their application to object learning and recognition. Int. Journal of Pattern Recognition and Artificial Intelligence, 18(3):375-396, 2004.
186. V. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10(8):707-710, 1966.
187. R.A. Wagner and M.J. Fischer. The string-to-string correction problem. Journal of the Association for Computing Machinery, 21(1):168-173, 1974.
188. S.M. Selkow. The tree-to-tree editing problem. Information Processing Letters, 6(6):184-186, 1977.
189. A. Robles-Kelly and E. Hancock. Graph edit distance from spectral seri-ation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(3):365-378, 2005.
190. H. du Buf and M. Bayer, editors. Automatic Diatom Identification. World Scientific, 2002.
191. R. Cesar, E. Bengoetxea, and I. Bloch. Inexact graph matching using stochastic optimization techniques for facial feature recognition. In Proc. 16th Int. Conference on Pattern Recognition, volume 2, pages 465-468, 2002.
192. C. Gomila and F. Meyer. Tracking objects by graph matching of image partition sequences. In Proc. 3rd Int. Workshop on Graph Based Representations in Pattern Recognition, pages 1-11, 2001.
193. M. Neuhaus and H. Bunke. A quadratic programming approach to the graph edit distance problem. In F. Escolano and M. Vento, editors, Proc. 6th Int. Workshop on Graph Based Representations in Pattern Recognition, LNCS 4538, pages 92-102. Springer, 2007.
194. M. Neuhaus and H. Bunke. A probabilistic approach to learning costs for graph edit distance. In J. Kittler, M. Petrou, and M. Nixon, editors, Proc. 17th Int. Conference on Pattern Recognition, volume 3, pages 389-393, 2004.
195. M. Neuhaus and H. Bunke. Automatic learning of cost functions for graph edit distance. Information Sciences, 177(1):239-247, 2007.
196. M. Neuhaus and H. Bunke. Self-organizing graph edit distance. In E. Hancock and M. Vento, editors, Proc. 4th Int. Workshop on Graph Based Representations in Pattern Recognition, LNCS 2726, pages 83-94. Springer, 2003.
197. M. Neuhaus and H. Bunke. Self-organizing maps for learning the edit costs in graph matching. IEEE Transactions on Systems, Man, and Cybernetics (Part B), 35(3):503-514, 2005.
198. H. Bunke. Error correcting graph matching: On the influence of the underlying cost function. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(9):917-911, 1999.
199. J. Munkres. Algorithms for the assignment and transportation problems. In Journal of the Society for Industrial and Applied Mathematics, volume 5, pages 32-38, 1957.
200. H.W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistic Quarterly, 2:83-97, 1955.
201. F. Bourgeois and J.C. Lassalle. An extension of the Munkres algorithm for the assignment problem to rectangular matrices. Communications of the ACM, 14(12):802-804, 1971.
202. M. Neuhaus and H. Bunke. A random walk kernel derived from graph edit distance. In D.-Y. Yeung, J.T. Kwok, A. Fred, F. Roli, and D. de Rid-der, editors, Proc. 11th Int. Workshop on Structural and Syntactic Pattern Recognition, LNCS 4109, pages 191-199. Springer, 2006.
203. M. Neuhaus and H. Bunke. Edit distance based kernel functions for structural pattern classification. Pattern Recognition, 39(10):1852-1863, 2006.
204. A. Asuncion and D.J. Newman. UCI machine learning repository. University of California, Department of Information and Computer Science. http://www.ics.uci.edu/mlearn/MLRepository.html.
205. U. Marti and H. Bunke. The iam-database: an english sentence database for off-line handwriting recognition. Int. Journal on Document Analysis and Recognition, 5:39-46, 2002.
206. H. Bunke and M. Vento. Benchmarking of graph matching algorithms. In Proc. 2nd Int. Workshop on Graph Based Representations in Pattern Recognition, pages 109-113, 1999.
207. K. Xu. Bhoslib: Benchmarks with hidden optimum solutions for graph problems (maximum clique, maximum independent set, minimum vertex cover and vertex coloring).
208. H. Bunke and K. Riesen. A family of novel graph kernels for structural pattern recognition. In L. Rueda, D. Mery, and J. Kittler, editors, Proc. 12th Iberoamerican Congress on Pattern Recognition, LNCS 4756, pages 20-31, 2007.
209. E. Alpaydin and F. Alimoglu. Pen-Based Recognition of Handwritten Digits. Dept. of Computer Engineering, Bogazici University, 1998.
210. F. Shafait, D. Keysers, and T. Breuel. GREC 2007 arc segmentation contest: Evaluation of four participating algorithms. In L. Wenyin, J. Llados, and J.M. Ogier, editors, Graphics Recognition. Recent Advances and New Opportunities, LNCS 5046, pages 310-320, 2008.
211. Ph. Dosch and E. Valveny. Report on the second symbol recognition contest. In W. Liu and J. Llados, editors, Graphics Recognition. Ten years review and future perspectives. Proc. 6th Int. Workshop on Graphics Recognition, LNCS 3926, pages 381-397. Springer, 2005.
212. R.W. Zhou, C. Quek, and G.S. Ng. A novel single-pass thinning algorithm and an effective set of performance criteria. Pattern Recognition Letters, 16(12):1267-1275, 1995.
213. E. Henry. Classification and Uses of Finger Prints. Routledge, London, 1900.
214. M. Kawagoe and A. Tojo. Fingerprint pattern classification. Pattern Recognition, 17:295-303, 1984.
215. K. Karu and A.K. Jain. Fingerprint classification. Pattern Recognition, 29(3):389-404, 1996.
216. C.I. Watson and C.L. Wilson. NIST Special Database 4, Fingerprint Database. National Institute of Standards and Technology, 1992.
217. Development Therapeutics Program DTP. AIDS antiviral screen, 2004. http://dtp.nci.nih.gov/docs/aids/aids_data.html.
218. J. Kazius, R. McGuire, and R. Bursi. Derivation and validation of tox-icophores for mutagenicity prediction. Journal of Medicinal Chemistry, 48(1):312-320, 2005.
219. Chemical Carcinogenesis Research Information System. http://toxnet.nlm.nih.gov.
220. H. Berman, J. Westbrook, Z. Feng, G. Gilliland, T. Bhat, H. Weissig, I. Shidyalov, and P. Bourne. The protein data bank. Nucleic Acids Research, 28:235-242, 2000.
221. I. Schomburg, A. Chang, C. Ebeling, M. Gremse, C. Heldt, G. Huhn, and D. Schomburg. Brenda, the enzyme database: updates and major new developments. Nucleic Acids Research, 32: Database issue: D431-D433, 2004.
222. J.B. Kruskal. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika, 29:1-27, 1964.
223. J.B. Kruskal and M. Wish. Multidimensional scaling. Technical report, Sage University, 1978.
224. T. Cox and M. Cox. Multidimensional Scaling. Chapman and Hall, 1994.
225. J. Sammon Jr. A nonlinear mapping for data structure analysis. IEEE Transactions on Computers, C-18:401-409, 1969.
226. E. Pekalska, R. Duin, M. Kraaijveld, and D. de Ridder. An overview of multidimensional scaling techniques with applications to shell data. Technical report, Delft University of Technology, The Netherlands, 1998.
227. O. Chapelle, P. Haffner, and V. Vapnik. SVMs for histogram-based image classification. IEEE Transactions on Neural Networks, 10(5):1055-1064, 1999.
228. C. Leslie, E. Eskin, and W. Noble. The spectrum kernel: A string kernel for SVM protein classification. In Proc. Pacific Symposium on Biocomputing, pages 564-575. World Scientific, 2002.
229. C. Leslie, E. Eskin, A. Cohen, J. Weston, and W. Noble. Mismatch string kernels for discriminative protein classification. Bioinformatics, 20(4):467-476, 2004.
230. T. Joachims. Text categorization with support vector machines: Learning with many relevant features. In Proc. European Conference on Machine Learning, pages 137-142, 1998.
231. C. Bahlmann, B. Haasdonk, and H. Burkhardt. On-line handwriting recognition with support vector machines. In Proc. Int. Workshop on Frontiers in Handwriting Recognition, pages 49-54, 2002.
232. I. Guyon, J. Weston, S. Barnhill, and V. Vapnik. Gene selection for cancer classification using support vector machines. Machine Learning, 46(1-3):389-422, 2002.
233. G. Baudat and F. Anouar. Generalized discriminant analysis using a kernel approach. Neural Computations, 12(10):2385-2404, 2000.
234. B. Scholkopf, A. Smola, and K.-R. Muller. Kernel principal component analysis. In Advances in Kernel Methods - Support Vector Learning, pages 327-352. MIT Press, 1999.
235. A. Tefas, C. Kotropoulos, and I. Pitas. Using support vector machines to enhance the performance of elastic graph matching for frontal face authentification. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(7):735-746, 2001.
236. N. Aronszajn. Theory of reproducing kernels. Transactions of the American Mathematical Society, 68:337-404, 1950.
237. M. Aizerman, E. Braverman, and L. Rozonoer. Theoretical foundations of potential function method in pattern recognition learning. Automation and Remote Control, 25:821-837, 1964.
238. R. Duda and P. Hart. Pattern Classification and Scene Analysis. John Wiley & Sons, 1973.
239. B.E. Boser, I. Guyon, and V. Vapnik. A training algorithm for optimal margin classifiers. In Proc. Of the fifth annual workshop on Computational learning theory, pages 144-152, 1992.
240. B. Scholkopf, K. Tsuda, and J.-P. Vert, editors. Kernel Methods in Computational Biology. MIT Press, 2004.
241. A. Fischer, K. Riesen, and H. Bunke. An experimental study of graph classification using prototype selection. In Proc. 19th Int. Conference on Pattern Recognition, 2008.
242. K. Muller, S. Mika, G. Ratsch, K. Tsuda, and B. Scholkopf. An introduction to kernel-based learning algorithms. IEEE Transactions on Neural Networks, 12(2):181-202, 2001.
243. H. Byun and S. Lee. A survey on pattern recognition applications of support vector machines. Int. Journal of Pattern Recognition and Artificial Intelligence, 17(3):459-486, 2003.
244. Ch. Berg, J. Christensen, and P. Ressel. Harmonic Analysis on Semigroups. Springer, 1984.
245. H.-T. Lin and C.-J. Li. A study on sigmoid kernels for SVM and the training of non-PSD kernels by SMO-type methods. Technical report, Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, 2003.
246. H. Hotelling. Analysis of a complex of statistical variables into principal components. Journal of Educational Psychology, 24:417-441 and 498-520, 1933.
247. I. Jolliffe. Principal Component Analysis. Springer, 1986.
248. L. Breiman, J. Friedman, R.A. Olshen, and C.J Stone. Classification and, regression trees. Wadsworth, 1984.
249. T.M. Cover. Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition. IEEE Transactions on Electronic Computers, 14:326-334, 1965.
250. V. Vapnik and A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264-280, 1971.
251. V. Vapnik. Statistical Learning Theory. John Wiley, 1998.
252. J.J. More and G. Toraldo. On the solution of quadratic programming problems with bound constraints. SIAM Journal on Optimization, 1:93-113, 1991.
253. C. Burges and V. Vapnik. A new method for constructing artificial neural networks. Technical Report N00014-94-C-0186, AT&T Bell Laboratories, 1995.
254. E.D. Nering and A.W. Tucker. Linear Programming and Related Problems. Academic Press, 1993.
255. C. Cortes and V. Vapnik. Support vector networks. Machine Learning, 20:273-297, 1995.
256. B. Scholkopf, A. Smola, and K.-R. Muller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10:1299-1319, 1998.
257. J. MacQueen. Some methods for classification and analysis of multivariant observations. In Proc. 5th. Berkeley Symp University of California Press 1, pages 281-297, 1966.
258. X. Jiang, A. Munger, and H. Bunke. On median graphs: Properties, algorithms, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10):1144-1151, 2001.
259. L. Kaufman and P. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, 1990.
260. I.S. Dhillon, Y. Guan, and B. Kulis. Kernel k-means: spectral clustering and normalized cuts. In Proc. Of the 10th ACM SIGKDD Int. conference on Knowledge discovery and data mining, pages 551-556, 2004.
261. B. Haasdonk. Feature space interpretation of SVMs with indefinite kernels. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(4):482-492, 2005.
262. T. Goartner. Kernels for Structured Data. World Scientific, 2008.
263. T. Goartner, J. Lloyd, and P. Flach. Kernels and distances for structured data. Machine Learning, 57(3):205-232, 2004.
264. H. Wiener. Structural determination of paraffin boiling points. Journal of the American Chemical Society, 69(1):17-20, 1947.
265. J. Devillers and A.T. Balaban, editors. Topological Indices and Related Descriptors in QSAR and QSPAR. Gordon and Breach Science Publishers, 1999.
266. F. Chung-Graham. Spectral Graph Theory. AMS, 1997.
267. R. Wilson and E. Hancock. Levenshtein distance for graph spectral features. In J. Kittler, M. Petrou, and M. Nixon, editors, Proc. 17th Int. Conference on Pattern Recognition, volume 2, pages 489-492, 2004.
268. B. Xiao, A. Torsello, and E. Hancock. Isotree: Tree clustering via metric embedding. Neurocomputing, 71:2029-2036, 2008.
269. J.B. Tenenbaum, V. de Silva, and J.C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000.
270. D. Jacobs, D. Weinshall, and Y. Gdalyahu. Classification with non-metric distances: Image retrieval and class representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(6):583-600, 2000.
271. H. Bunke, S. Gunter, and X. Jiang. Towards bridging the gap between statistical and structural pattern recognition: Two new concepts in graph matching. In S. Singh, N.A. Murshed, and W. Kropatsch, editors, Proc. Of the Second Int. Conference on Advances in Pattern Recognition, LNCS 2013, pages 1-11. Springer, 2001.
272. L. Goldfarb and D. Gay. What is structural representation. Technical Report TR05-175, Faculty of Computer Science, University of New Bruin-swick, 2006.
273. B. Spillmann, M. Neuhaus, H. Bunke, E. Pekalska, and R. Duin. Transforming strings to vector spaces using prototype selection. In D.-Y. Yeung, J.T. Kwok, A. Fred, F. Roli, and D. de Ridder, editors, Proc. 11th int. Workshop on Structural and Syntactic Pattern Recognition, LNCS 4109, pages 287-296. Springer, 2006.
274. K. Tsuda. Support vector classification with asymmetric kernel function. In M. Verleysen, editor, Proc. 7th European Symposium on Artifical Neural Netweorks, pages 183-188, 1999.
275. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-245, 1995.
276. W. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into Hilbert space. Contemporary Mathematics, 26:189-206, 1984.
277. J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert spaces. Israel Journal of Mathematics, 52(1-2):46-52, 1985.
278. G. Hjaltason and H. Samet. Properties of embedding methods for similarity searching in metric spaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(5):530-549, 2003.
279. K. Riesen and H. Bunke. Graph classification by means of Lipschitz embedding. Accepted for publication in IEEE Transactions on Systems, Man, and Cybernetics (Part B).
280. G. Hristescu and M. Farach-Colton. Cluster-preserving embedding of proteins. Technical report, Rutgers University, 1999.
281. Y. Wang, I.V. Tetko, M.A. Hall, E. Frank, A. Facius, K.F.X. Mayer, and Mewes H.W. Gene selection from microarray data for cancer classification -a machine learning approach. Computational Biology and Chemistry, 29:3746, 2005.
282. K. Riesen and H. Bunke. Graph classification based on vector space embedding. Int. Journal of Pattern Recognition and Artificial Intelligence, 23(6):1053-1081, 2009.
283. R. Kohavi and G.H. John. Wrappers for feature subset selection. Artificial Intelligence, 97(1-2):273-324, 1997.
284. J.C. Bezdek and L. Kuncheva. Nearest prototype classifier designs: An experimental study. Int. Journal of Intelligent Systems, 16(12):1445-1473, 2001.
285. K. Kira and L.A. Rendell. A practical approach to feature selection. In 9th Int. Workshop on Machine Learning, pages 249-256. Morgan Kaufmann, 1992.
286. P. Pudil, J. Novovicova, and J. Kittler. Floating search methods in feature-selection. Pattern Recognition Letters, 15(11):1119-1125, 1994.
287. A. Jain and D. Zongker. Feature selection: Evaluation, application, and small sample performance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(2):153-158, 1997.
288. R.A. Fisher. The statistical utilization of multiple measurements. In Annals of Eugenics, volume 8, pages 376-386, 1938.
289. P. Langley. Selection of relevant features in machine learning. In AAAI Fall Symposium on Relevance, pages 140-144, 1994.
290. P.E. Hart. The condensed nearest neighbor rule. IEEE Transactions on Information Theory, 14(3):515-516, 1968.
291. J.S. Sanchez, F. Pla, and F.J. Ferri. Prototype selection for the nearest neighbour rule through proximity graphs. Pattern Recognition Letters, 18(6):507-513, 1997.
292. D.R. Wilson and T.R. Martinez. Reduction techniques for instance-based learning algorithms. Machine Learning, 38(3):257-286, 2000.
293. S.W. Kim and B.J. Oommen. A brief taxonomy and ranking of creative prototype reduction schemes. Pattern Analysis and Applications, 6:232-244, 2003.
294. V. Susheela Devi and M.N Murty. An incremental prototype set building technique. Pattern Recognition, 35(2):505-513, 2002.
295. P.A. Devijver and J. Kittler. On the edited nearest neighbor rule. In Proc. 5th Int. Conference on Pattern Recognition, pages 72-80, 1980.
296. G. W. Gates. The reduced nearest neighbor rule. IEEE Transactions on Information Theory, 18:431-433, 1972.
297. C.-L. Chang. Finding prototypes for nearest neighbor classifiers. IEEE Transactions on Computers, 23(11):1179-1184, 1974.
298. G. Ritter, H. Woodruff, S. Lowry, and T. Isenhour. An algorithm for a selective nearest neighbor decision rule. IEEE Transactions on Information Theory, 21(6):665-669, 1975.
299. U.M. Fayyad and K.B. Irani. Multi-interval discretization of continuousvalued attributes for classification learning. In Proc. 13th Int. Joint Conference on Articial Intelligence, volume 2, pages 1022-1027. Morgan Kaufmann, 1993.
300. L. Breiman. Bagging predictors. Machine Learning, 24:123-140, 1996.
301. T.K. Ho. The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8):832-844, 1998.
302. Y. Freund and R.E. Shapire. A decision theoretic generalization of online learning and application to boosting. Journal of Computer and Systems Sciences, 55:119-139, 1997.
303. H. Bunke, P. Dickinson, and M. Kraetzl. Theoretical and algorithmic framework for hypergraph matching. In F. Roli and S. Vitulano, editors, Proc. 13th Int. Conference on Image Analysis and Processing, LNCS 3617, pages 463-470. Springer, 2005.
304. K. Riesen, M. Neuhaus, and H. Bunke. Graph embedding in vector spaces by means of prototype selection. In F. Escolano and M. Vento, editors, Proc. 6th Int. Workshop on Graph Based Representations in Pattern Recognition, LNCS 4538, pages 383-393, 2007.
305. F. Roli, G. Giacinto, and G. Vernazza. Methods for designing multiple classifier systems. In Proc. Second Int. Workshop on Multiple Classifier Systems, LNCS 2096, pages 78-87. Springer, 2001.
306. J. Dunn. Well-separated clusters and optimal fuzzy partitions. Journal of Cybernetics, 4:95-104, 1974.
307. L. Hubert and J. Schultz. Quadratic assignment as a general data analysis strategy. British Journal of Mathematical and Statistical Psychology, 29:190-241, 1976.
308. W. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66(336):846-850, 1971.
309. K. Riesen and H. Bunke. Kernel fc-means clustering applied to vector space embeddings of graphs. In L. Prevost, S. Marinai, and F. Schwenker, editors, Proc. 3rd IAPR Workshop Artificial Neural Networks in Pattern Recognition, LNAI 5064, pages 24-35. Springer, 2008.
310. D.L. Davies and D.W. Bouldin. A cluster separation measure. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1(2):224-227, 1979.
311. T. Calinski and J. Harabasz. A dendrite method for cluster analysis. Communications in statistics, 3(1):1-27, 1974.
312. X.L. Xie and G. Beni. A validity measure for fuzzy clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13:841-847, 1991.
313. U. Malik and S. Bandyopadhyay. Performance evaluation of some clustering algorithms and validity indices. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(12):1650-1654, 2002.
314. L. Kuncheva and D. Vetrov. Evaluation of stability of k-means cluster ensembles with respect to random initialization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(11):1798-1808, 2006.
315. K. Riesen and H. Bunke. Cluster ensembles based on vector space embeddings of graphs. In J.A. Benediktsson, J. Kittler, and F. Roli, editors, Proc. 8th Int. Workshop on Multiple Classifier Systems, LNCS 5519, pages 211-221, 2009.
316. J. Franke and E. Mandler. A comparison of two approaches for combining the votes of cooperating classifiers. In Proc. 11th Int. Conference on Pattern Recognition, volume 2, pages 611-614, 1992.
317. M. van Erp and L. Schomaker. Variants of the Borda count method for combining ranked classifier hypotheses. In Proc. 7th Int. Workshop on Frontiers in Handwriting Recognition, pages 443-452, 2000.
318. S. Hashem and B. Schmeiser. Improving model accuracy using optimal linear combinations of trained neural networks. IEEE Transactions on Neural Networks, 6(3):792-794, 1995.
319. L. Xu, A. Krzyzak, and C.Y. Suen. Methods of combining multiple classifiers and their applications to handwriting recognition. IEEE Transactions on Systems, Man and Cybernetics, 22(3):418-435, 1992.
320. C.F.J. Wu, C.J. Lin, and R.C. Weng. Probability estimates for multi-class classification by pairwise coupling. Journal of Machine Learning Research, 5:975-1005, 2004.
321. J. Kittler, M. Hatef, R. Duin, and J. Matas. On combining classifiers. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(3):226-239, 1998