메뉴 건너뛰기




Volumn 33, Issue 7, 2012, Pages 811-825

Towards the unification of structural and statistical pattern recognition

Author keywords

Graph classification; Graph clustering; Graph embedding; Graph kernel; Statistical pattern recognition; Structural pattern recognition

Indexed keywords

GRAPH CLASSIFICATION; GRAPH CLUSTERING; GRAPH EMBEDDINGS; GRAPH KERNELS; STATISTICAL PATTERN RECOGNITION; STRUCTURAL PATTERN RECOGNITION;

EID: 84858443817     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2011.04.017     Document Type: Conference Paper
Times cited : (67)

References (117)
  • 4
    • 24644511871 scopus 로고    scopus 로고
    • A randomized heuristic for scene recognition by graph matching
    • C. Ribeiro, S. Martins, LNCS Springer
    • M. Boeres, C. Ribeiro, and I. Bloch A randomized heuristic for scene recognition by graph matching C. Ribeiro, S. Martins, Proc. 3rd Workshop on Efficient and Experimental Algorithms LNCS vol. 3059 2004 Springer 100 113
    • (2004) Proc. 3rd Workshop on Efficient and Experimental Algorithms , vol.3059 , pp. 100-113
    • Boeres, M.1    Ribeiro, C.2    Bloch, I.3
  • 7
    • 0033188822 scopus 로고    scopus 로고
    • Error correcting graph matching: On the influence of the underlying cost function
    • H. Bunke Error correcting graph matching: On the influence of the underlying cost function IEEE Trans. Pattern Anal. Machine Intell. 21 9 1999 911 917
    • (1999) IEEE Trans. Pattern Anal. Machine Intell. , vol.21 , Issue.9 , pp. 911-917
    • Bunke, H.1
  • 8
    • 0021022807 scopus 로고
    • Inexact graph matching for structural pattern recognition
    • H. Bunke, and G. Allermann Inexact graph matching for structural pattern recognition Pattern Recognition Lett. 1 1983 245 253
    • (1983) Pattern Recognition Lett. , vol.1 , pp. 245-253
    • Bunke, H.1    Allermann, G.2
  • 10
    • 3142718161 scopus 로고    scopus 로고
    • Inexact graph matching using eigen-subspace projection clustering
    • T. Caelli, and S. Kosinov Inexact graph matching using eigen-subspace projection clustering Internat. J. Pattern Recognition Artif. Intell. 18 3 2004 329 355
    • (2004) Internat. J. Pattern Recognition Artif. Intell. , vol.18 , Issue.3 , pp. 329-355
    • Caelli, T.1    Kosinov, S.2
  • 12
    • 0003365565 scopus 로고    scopus 로고
    • Spectral Graph Theory
    • F. Chung-Graham Spectral Graph Theory AMS 1997
    • (1997) AMS
    • Chung-Graham, F.1
  • 14
    • 0031170384 scopus 로고    scopus 로고
    • Inexact graph matching using genetic search
    • PII S0031320396001239
    • A. Cross, R. Wilson, and E. Hancock Inexact graph matching using genetic search Pattern Recognition 30 6 1997 953 970 (Pubitemid 127417881)
    • (1997) Pattern Recognition , vol.30 , Issue.6 , pp. 953-970
    • Cross, A.D.J.1    Wilson, R.C.2    Hancock, E.R.3
  • 20
    • 74449085626 scopus 로고    scopus 로고
    • Generalized median graph computation by means of graph embedding in vector spaces
    • M. Ferrer, E. Valveny, F. Serratosa, K. Riesen, and H. Bunke Generalized median graph computation by means of graph embedding in vector spaces Pattern Recognition 43 2010 1642 1655
    • (2010) Pattern Recognition , vol.43 , pp. 1642-1655
    • Ferrer, M.1    Valveny, E.2    Serratosa, F.3    Riesen, K.4    Bunke, H.5
  • 21
    • 0032210116 scopus 로고    scopus 로고
    • Symbolic graph matching with the em algorithm
    • A. Finch, R. Wilson, and E. Hancock Symbolic graph matching with the EM algorithm Pattern Recognition 31 11 1998 1777 1790
    • (1998) Pattern Recognition , vol.31 , Issue.11 , pp. 1777-1790
    • Finch, A.1    Wilson, R.2    Hancock, E.3
  • 22
    • 0015567825 scopus 로고
    • The representation and matching of pictorial structures
    • M. Fischler, and R. Elschlager The representation and matching of pictorial structures IEEE Trans. Comput. 22 1 1973 67 92
    • (1973) IEEE Trans. Comput. , vol.22 , Issue.1 , pp. 67-92
    • Fischler, M.1    Elschlager, R.2
  • 23
    • 0032165969 scopus 로고    scopus 로고
    • A general framework for adaptive processing of data structures
    • PII S1045922798061906
    • P. Frasconi, M. Gori, and A. Sperduti A general framework for adaptive processing of data structures IEEE Trans. Neural Networks 9 5 1998 768 786 (Pubitemid 128743645)
    • (1998) IEEE Transactions on Neural Networks , vol.9 , Issue.5 , pp. 768-786
    • Frasconi, P.1    Gori, M.2    Sperduti, A.3
  • 25
    • 0022723438 scopus 로고
    • A step towards unification of syntactic and statistical pattern recognition
    • K. Fu A step towards unification of syntactic and statistical pattern recognition IEEE Trans. Pattern Anal. Machine Intell. 8 3 1986 398 404 (Pubitemid 16595860)
    • (1986) IEEE Transactions on Pattern Analysis and Machine Intelligence , Issue.3 , pp. 398-404
    • Fu, K.1
  • 26
    • 4444231365 scopus 로고    scopus 로고
    • A survey of kernels for structured data
    • T. Gärtner A survey of kernels for structured data SIGKDD Explorations 5 1 2003 49 58
    • (2003) SIGKDD Explorations , vol.5 , Issue.1 , pp. 49-58
    • Gärtner, T.1
  • 28
    • 9444266406 scopus 로고    scopus 로고
    • On Graph Kernels: Hardness Results and Efficient Alternatives
    • Learning Theory and Kernel Machines
    • Gärtner, T.; Flach, P.; Wrobel, S.; 2003. On graph kernels: Hardness results and efficient alternatives. In: Schölkopf, B.; Warmuth, M. (Eds.), Proc. 16th Ann. Conf. Learning Theory, pp. 129-143. (Pubitemid 37053200)
    • (2003) LNCS , Issue.2777 , pp. 129-143
    • Gartner, T.1    Flach, P.2    Wrobel, S.3
  • 31
    • 84951867818 scopus 로고    scopus 로고
    • Using graph search techniques for contextual colour retrieval
    • Caelli, T.; Amin, A.; Duin, R.; Kamel, M.; de Ridder, D. (Eds.) LNCS
    • Gregory, L.; Kittler, J.; 2002. Using graph search techniques for contextual colour retrieval. In: Caelli, T.; Amin, A.; Duin, R.; Kamel, M.; de Ridder, D. (Eds.), Proc. Internat. Workshops on Structural, Syntactic, and Statistical Pattern Recognition. LNCS, vol 2396, pp. 186-194.
    • (2002) Proc. Internat. Workshops on Structural, Syntactic, and Statistical Pattern Recognition , vol.2396 , pp. 186-194
    • Gregory, L.1    Kittler, J.2
  • 32
    • 0035197949 scopus 로고    scopus 로고
    • Weighted mean of a pair of graphs
    • DOI 10.1007/s006070170006
    • S. Günter, and H. Bunke Weighted mean of a pair of graphs Computing 67 2001 209 224 (Pubitemid 33112698)
    • (2001) Computing (Vienna/New York) , vol.67 , Issue.3 , pp. 209-224
    • Bunke, H.1    Gunter, S.2
  • 33
    • 0036191654 scopus 로고    scopus 로고
    • Self-organizing map for clustering in the graph domain
    • DOI 10.1016/S0167-8655(01)00173-8, PII S0167865501001738
    • S. Günter, and H. Bunke Self-organizing map for clustering in the graph domain Pattern Recognition Lett. 23 2002 405 417 (Pubitemid 34197120)
    • (2002) Pattern Recognition Letters , vol.23 , Issue.4 , pp. 405-417
    • Gunter, S.1    Bunke, H.2
  • 34
    • 0037406313 scopus 로고    scopus 로고
    • Validation indices for graph clustering
    • DOI 10.1016/S0167-8655(02)00257-X, PII S016786550200257X
    • S. Günter, and H. Bunke Validation indices for graph clustering Pattern Recognition Lett. 24 8 2003 1107 1113 (Pubitemid 36189564)
    • (2003) Pattern Recognition Letters , vol.24 , Issue.8 , pp. 1107-1113
    • Gunter, S.1    Bunke, H.2
  • 37
    • 84899829959 scopus 로고
    • A formal basis for the heuristic determination of minimum cost paths
    • P. Hart, N. Nilsson, and B. Raphael A formal basis for the heuristic determination of minimum cost paths IEEE Trans. Systems Sci. Cybernet. 4 2 1968 100 107
    • (1968) IEEE Trans. Systems Sci. Cybernet. , vol.4 , Issue.2 , pp. 100-107
    • Hart, P.1    Nilsson, N.2    Raphael, B.3
  • 38
    • 0004019973 scopus 로고    scopus 로고
    • Technical Report UCSC-CRL-99-10, University of California, Santa Cruz
    • Haussler, D.; 1999. Convolution kernels on discrete structures. Technical Report UCSC-CRL-99-10, University of California, Santa Cruz.
    • (1999) Convolution Kernels on Discrete Structures
    • Haussler, D.1
  • 39
    • 27744512266 scopus 로고    scopus 로고
    • Median graph computation for graph clustering
    • DOI 10.1007/s00500-005-0464-1
    • A. Hlaoui, and S. Wang Median graph computation for graph clustering Soft Comput. 10 1 2006 47 53 (Pubitemid 41631145)
    • (2006) Soft Computing , vol.10 , Issue.1 , pp. 47-53
    • Hlaoui, A.1    Wang, S.2
  • 40
    • 0033220774 scopus 로고    scopus 로고
    • Shape recognition from large image libraries by inexact graph matching
    • DOI 10.1016/S0167-8655(99)00093-8
    • B. Huet, and E. Hancock Shape recognition from large image libraries by inexact graph matching Pattern Recognition Lett. 20 11-13 1999 1259 1269 (Pubitemid 32261904)
    • (1999) Pattern Recognition Letters , vol.20 , Issue.11-13 , pp. 1259-1269
    • Huet, B.1    Hancock, E.R.2
  • 41
    • 77950369345 scopus 로고    scopus 로고
    • Data clustering: 50 years beyond k-means
    • A. Jain Data clustering: 50 years beyond k-means Pattern Recognition Lett. 31 2010 651 666
    • (2010) Pattern Recognition Lett. , vol.31 , pp. 651-666
    • Jain, A.1
  • 42
    • 0037834901 scopus 로고    scopus 로고
    • Automorphism partitioning with neural networks
    • B. Jain, and F. Wysotzki Automorphism partitioning with neural networks Neural Process. Lett. 17 2 2003 205 215
    • (2003) Neural Process. Lett. , vol.17 , Issue.2 , pp. 205-215
    • Jain, B.1    Wysotzki, F.2
  • 43
    • 12144281717 scopus 로고    scopus 로고
    • Solving inexact graph isomorphism problems using neural networks
    • DOI 10.1016/j.neucom.2004.01.189, PII S0925231204003169
    • B. Jain, and F. Wysotzki Solving inexact graph isomorphism problems using neural networks Neurocomputing 63 2005 45 67 (Pubitemid 40103856)
    • (2005) Neurocomputing , vol.63 , pp. 45-67
    • Jain, B.J.1    Wysotzki, F.2
  • 51
    • 12144257810 scopus 로고    scopus 로고
    • Derivation and validation of toxicophores for mutagenicity prediction
    • DOI 10.1021/jm040835a
    • J. Kazius, R. McGuire, and R. Bursi Derivation and validation of toxicophores for mutagenicity prediction J. Med. Chem. 48 1 2005 312 320 (Pubitemid 40105270)
    • (2005) Journal of Medicinal Chemistry , vol.48 , Issue.1 , pp. 312-320
    • Kazius, J.1    McGuire, R.2    Bursi, R.3
  • 56
    • 21844459752 scopus 로고    scopus 로고
    • Diffusion kernels on statistical manifolds
    • J. Lafferty, and G. Lebanon Diffusion kernels on statistical manifolds J. Machine Learn. Res. 6 2005 129 163
    • (2005) J. Machine Learn. Res. , vol.6 , pp. 129-163
    • Lafferty, J.1    Lebanon, G.2
  • 57
    • 70349316573 scopus 로고    scopus 로고
    • A labelled graph based multiple classifier system
    • Benediktsson, J.; Kittler, J.; Roli, F. (Eds.) LNCS
    • Lee, W.; Duin, R.; 2009. A labelled graph based multiple classifier system. In: Benediktsson, J.; Kittler, J.; Roli, F. (Eds.), Proc. 8th Internat. Workshop on Multiple Classifier Systems. LNCS, vol. 5519, pp. 201-210.
    • (2009) Proc. 8th Internat. Workshop on Multiple Classifier Systems , vol.5519 , pp. 201-210
    • Lee, W.1    Duin, R.2
  • 58
    • 0035481405 scopus 로고    scopus 로고
    • Structural graph matching using the EM algorithm and singular value decomposition
    • DOI 10.1109/34.954602
    • B. Luo, and E. Hancock Structural graph matching using the EM algorithm and singular value decomposition IEEE Trans. Pattern Anal. Machine Intell. 23 10 2001 1120 1136 (Pubitemid 33047950)
    • (2001) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.23 , Issue.10 , pp. 1120-1136
    • Luo, B.1    Hancock, E.R.2
  • 59
  • 60
    • 0001457509 scopus 로고
    • Some methods for classification and analysis of multivariant observations
    • University of California Press
    • J. MacQueen Some methods for classification and analysis of multivariant observations Proc. 5th. Berkeley Symp. vol. 1 1966 University of California Press 281 297
    • (1966) Proc. 5th. Berkeley Symp. , vol.1 , pp. 281-297
    • MacQueen, J.1
  • 61
  • 62
    • 63049119992 scopus 로고    scopus 로고
    • Neural network for graphs: A contextual constructive approach
    • A. Micheli Neural network for graphs: A contextual constructive approach IEEE Trans. Neural Networks 20 3 2009 498 511
    • (2009) IEEE Trans. Neural Networks , vol.20 , Issue.3 , pp. 498-511
    • Micheli, A.1
  • 65
    • 20444400788 scopus 로고    scopus 로고
    • Self-organizing maps for learning the edit costs in graph matching
    • DOI 10.1109/TSMCB.2005.846635, Learning in Computer Vision and Pattern Recognition
    • M. Neuhaus, and H. Bunke Self-organizing maps for learning the edit costs in graph matching IEEE Trans. Systems Man Cybernet. (Part B) 35 3 2005 503 514 (Pubitemid 40794861)
    • (2005) IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics , vol.35 , Issue.3 , pp. 503-514
    • Neuhaus, M.1    Bunke, H.2
  • 66
    • 33749655363 scopus 로고    scopus 로고
    • Automatic learning of cost functions for graph edit distance
    • DOI 10.1016/j.ins.2006.02.013, PII S0020025506000569
    • M. Neuhaus, and H. Bunke Automatic learning of cost functions for graph edit distance Information Sciences 177 1 2007 239 247 (Pubitemid 44556685)
    • (2007) Information Sciences , vol.177 , Issue.1 , pp. 239-247
    • Neuhaus, M.1    Bunke, H.2
  • 70
    • 0033570815 scopus 로고    scopus 로고
    • Replicator equations, maximal cliques, and graph isomorphism
    • M. Pelillo Replicator equations, maximal cliques, and graph isomorphism Neural Comput. 11 8 1999 1933 1955
    • (1999) Neural Comput. , vol.11 , Issue.8 , pp. 1933-1955
    • Pelillo, M.1
  • 71
    • 23844480138 scopus 로고    scopus 로고
    • Graph kernels for chemical informatics
    • DOI 10.1016/j.neunet.2005.07.009, PII S0893608005001693, Neural Networks and Kernal Methods for Structured Domains
    • L. Ralaivola, S. Swamidass, H. Saigo, and P. Baldi Graph kernels for chemical informatics Neural Networks 18 8 2005 1093 1110 (Pubitemid 41476343)
    • (2005) Neural Networks , vol.18 , Issue.8 , pp. 1093-1110
    • Ralaivola, L.1    Swamidass, S.J.2    Saigo, H.3    Baldi, P.4
  • 72
    • 58249086559 scopus 로고    scopus 로고
    • Reducing the dimensionality of dissimilarity space embedding graph kernels
    • K. Riesen, and H. Bunke Reducing the dimensionality of dissimilarity space embedding graph kernels Eng. Appl. Artif. Intell. 22 1 2008 48 56
    • (2008) Eng. Appl. Artif. Intell. , vol.22 , Issue.1 , pp. 48-56
    • Riesen, K.1    Bunke, H.2
  • 73
    • 58049183712 scopus 로고    scopus 로고
    • Non-linear transformations of vector space embedded graphs
    • A. Juan-Ciscar, G. Sanchez-Albaladejo
    • K. Riesen, and H. Bunke Non-linear transformations of vector space embedded graphs A. Juan-Ciscar, G. Sanchez-Albaladejo, Pattern Recognition in Information Systems 2008 173 186
    • (2008) Pattern Recognition in Information Systems , pp. 173-186
    • Riesen, K.1    Bunke, H.2
  • 74
    • 58349097731 scopus 로고    scopus 로고
    • IAM graph database repository for graph based pattern recognition and machine learning
    • da Vitoria Lobo, N. et al. (Ed.) LNCS
    • Riesen, K.; Bunke, H.; 2008. IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N. et al. (Ed.), Proc. Internat. Workshops on Structural, Syntactic, and Statistical Pattern Recognition. LNCS, vol. 5342, pp. 287-297.
    • (2008) Proc. Internat. Workshops on Structural, Syntactic, and Statistical Pattern Recognition , vol.5342 , pp. 287-297
    • Riesen, K.1    Bunke, H.2
  • 76
    • 70350224099 scopus 로고    scopus 로고
    • Dissimilarity based vector space embedding of graphs using prototype reduction schemes
    • Perner, P. (Ed.) LNCS
    • Riesen, K.; Bunke, H.; 2009. Dissimilarity based vector space embedding of graphs using prototype reduction schemes. In: Perner, P. (Ed.), Proc. 6th Internat. Conference on Machine Learning and Data Mining in Pattern. LNCS, vol. 5632, pp. 617-631.
    • (2009) Proc. 6th Internat. Conference on Machine Learning and Data Mining in Pattern , vol.5632 , pp. 617-631
    • Riesen, K.1    Bunke, H.2
  • 77
    • 64849091214 scopus 로고    scopus 로고
    • Approximate graph edit distance computation by means of bipartite graph matching
    • K. Riesen, and H. Bunke Approximate graph edit distance computation by means of bipartite graph matching Image Vision Comput. 27 4 2009 950 959
    • (2009) Image Vision Comput. , vol.27 , Issue.4 , pp. 950-959
    • Riesen, K.1    Bunke, H.2
  • 79
    • 84858443119 scopus 로고    scopus 로고
    • Speeding up graph edit distance computation with a bipartite heuristic
    • Frasconi, P.; Kersting, K.; Tsuda, K. (Eds.)
    • Riesen, K.; Fankhauser, S.; Bunke, H.; 2007. Speeding up graph edit distance computation with a bipartite heuristic. In: Frasconi, P.; Kersting, K.; Tsuda, K. (Eds.), Proc. 5th Internat. Workshop on Mining and Learning with Graphs, pp. 21-24.
    • (2007) Proc. 5th Internat. Workshop on Mining and Learning with Graphs , pp. 21-24
    • Riesen, K.1    Fankhauser, S.2    Bunke, H.3
  • 80
    • 33751031562 scopus 로고    scopus 로고
    • A Riemannian approach to graph embedding
    • A. Robles-Kelly, and E. Hancock A Riemannian approach to graph embedding Pattern Recognition 40 2007 1024 1056
    • (2007) Pattern Recognition , vol.40 , pp. 1024-1056
    • Robles-Kelly, A.1    Hancock, E.2
  • 82
    • 0020752197 scopus 로고
    • A distance measure between attributed relational graphs for pattern recognition
    • A. Sanfeliu, and K. Fu A distance measure between attributed relational graphs for pattern recognition IEEE Trans. Systems Man Cybernet. (Part B) 13 3 1983 353 363
    • (1983) IEEE Trans. Systems Man Cybernet. (Part B) , vol.13 , Issue.3 , pp. 353-363
    • Sanfeliu, A.1    Fu, K.2
  • 83
    • 3142671241 scopus 로고    scopus 로고
    • Second-order random graphs for modeling sets of attributed graphs and their application to object learning and recognition
    • A. Sanfeliu, F. Serratosa, and R. Alquézar Second-order random graphs for modeling sets of attributed graphs and their application to object learning and recognition Internat. J. Pattern Recognition Artif. Intell. 18 3 2004 375 396
    • (2004) Internat. J. Pattern Recognition Artif. Intell. , vol.18 , Issue.3 , pp. 375-396
    • Sanfeliu, A.1    Serratosa, F.2    Alquézar, R.3
  • 84
    • 0032121920 scopus 로고    scopus 로고
    • Quantitative Measures of Change Based on Feature Organization: Eigenvalues and Eigenvectors
    • S. Sarkar, and K. Boyer Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors Comput. Vision Image Understand. 71 1 1998 110 136 (Pubitemid 128420524)
    • (1998) Computer Vision and Image Understanding , vol.71 , Issue.1 , pp. 110-136
    • Sarkar, S.1    Boyer, K.L.2
  • 86
    • 0344240183 scopus 로고    scopus 로고
    • Comparing structures using a Hopfield-style neural network
    • K. Schädler, and F. Wysotzki Comparing structures using a Hopfield-style neural network Appl. Intell. 11 1999 15 30
    • (1999) Appl. Intell. , vol.11 , pp. 15-30
    • Schädler, K.1    Wysotzki, F.2
  • 89
    • 0347243182 scopus 로고    scopus 로고
    • Nonlinear Component Analysis as a Kernel Eigenvalue Problem
    • B. Schölkopf, A. Smola, and K.-R. Müller Nonlinear component analysis as a kernel eigenvalue problem Neural Comput. 10 1998 1299 1319 (Pubitemid 128463674)
    • (1998) Neural Computation , vol.10 , Issue.5 , pp. 1299-1319
    • Scholkopf, B.1    Smola, A.2    Muller, K.-R.3
  • 91
    • 0031232782 scopus 로고    scopus 로고
    • Matching structural shape descriptions using genetic algorithms
    • PII S0031320396001811
    • M. Singh, A. Chatterjee, and S. Chaudhury Matching structural shape descriptions using genetic algorithms Pattern Recognition 30 9 1997 1451 1462 (Pubitemid 127406535)
    • (1997) Pattern Recognition , vol.30 , Issue.9 , pp. 1451-1462
    • Singh, M.1    Chatterjee, A.2    Chaudhury, S.3
  • 92
    • 9444285502 scopus 로고    scopus 로고
    • Kernels and Regularization on Graphs
    • Learning Theory and Kernel Machines
    • Smola, A.; Kondor, R.; 2003. Kernels and regularization on graphs. In: Proc. 16th. Internat. Conference on Computational Learning Theory, pp. 144-158. (Pubitemid 37053201)
    • (2003) Lecture Notes in Computer Science , Issue.2777 , pp. 144-158
    • Smola, A.J.1    Kondor, R.2
  • 93
    • 24644441813 scopus 로고    scopus 로고
    • Reactive Tabu search for measuring graph similarity
    • Graph-Based Representations in Pattern Recognition - 5th IAPR International Workshop, GbRPR 2005, Proceedings
    • S. Sorlin, and C. Solnon Reactive tabu search for measuring graph similarity L. Brun, M. Vento, Proc. 5th Internat. Workshop on Graph-based Representations in Pattern Recognition LNCS vol. 3434 2005 Springer 172 182 (Pubitemid 41273841)
    • (2005) Lecture Notes in Computer Science , vol.3434 , pp. 172-182
    • Sorlin, S.1    Solnon, C.2
  • 94
    • 0031145983 scopus 로고    scopus 로고
    • Supervised neural networks for the classification of structures
    • PII S1045922797027495
    • A. Sperduti, and A. Starita Supervised neural networks for the classification of structures IEEE Trans. Neural Networks 8 3 1997 714 735 (Pubitemid 127767813)
    • (1997) IEEE Transactions on Neural Networks , vol.8 , Issue.3 , pp. 714-735
    • Sperduti, A.1    Starita, A.2
  • 96
    • 0036721663 scopus 로고    scopus 로고
    • Structural pattern recognition using genetic algorithms
    • DOI 10.1016/S0031-3203(01)00136-4, PII S0031320301001364
    • P. Suganthan Structural pattern recognition using genetic algorithms Pattern Recognition 35 9 2002 1883 1893 (Pubitemid 34776304)
    • (2002) Pattern Recognition , vol.35 , Issue.9 , pp. 1883-1893
    • Suganthan, P.N.1
  • 97
    • 0029254352 scopus 로고
    • Pattern recognition by homomorphic graph matching using Hopfield neural networks
    • P. Suganthan, E. Teoh, and D. Mital Pattern recognition by homomorphic graph matching using Hopfield neural networks Image Vision Comput. 13 1 1995 45 60
    • (1995) Image Vision Comput. , vol.13 , Issue.1 , pp. 45-60
    • Suganthan, P.1    Teoh, E.2    Mital, D.3
  • 98
    • 0029344678 scopus 로고
    • Pattern recognition by graph matching using the potts MFT neural networks
    • P. Suganthan, E. Teoh, and D. Mital Pattern recognition by graph matching using the potts MFT neural networks Pattern Recognition 28 7 1995 997 1009
    • (1995) Pattern Recognition , vol.28 , Issue.7 , pp. 997-1009
    • Suganthan, P.1    Teoh, E.2    Mital, D.3
  • 99
    • 0029255728 scopus 로고
    • Self-organizing Hopfield network for attributed relational graph matching
    • P. Suganthan, E. Teoh, and D. Mital Self-organizing Hopfield network for attributed relational graph matching Image Vision Comput. 13 1 1995 61 73
    • (1995) Image Vision Comput. , vol.13 , Issue.1 , pp. 61-73
    • Suganthan, P.1    Teoh, E.2    Mital, D.3
  • 100
    • 0037408246 scopus 로고    scopus 로고
    • Computing approximate tree edit distance using relaxation labeling
    • DOI 10.1016/S0167-8655(02)00255-6, PII S0167865502002556
    • A. Torsello, and E. Hancock Computing approximate tree edit distance using relaxation labeling Pattern Recognition Lett. 24 8 2003 1089 1097 (Pubitemid 36189562)
    • (2003) Pattern Recognition Letters , vol.24 , Issue.8 , pp. 1089-1097
    • Torsello, A.1    Hancock, E.R.2
  • 101
    • 0018732476 scopus 로고
    • Error-correcting isomorphisms of attributed relational graphs for pattern analysis
    • W. Tsai, and K. Fu Error-correcting isomorphism of attributed relational graphs for pattern analysis IEEE Trans. Systems Man Cybernet. (Part B) 9 12 1979 757 768 (Pubitemid 10441704)
    • (1979) IEEE Transactions on Systems, Man and Cybernetics , Issue.12 , pp. 757-768
    • Tsai, W.1    Fu, K.2
  • 102
    • 0020497981 scopus 로고
    • Subgraph error-correcting isomorphisms for syntactic pattern recognition
    • W. Tsai, and K. Fu Subgraph error-correcting isomorphisms for syntactic pattern recognition IEEE Trans. Systems Man Cybernet. (Part B) 13 1983 48 61
    • (1983) IEEE Trans. Systems Man Cybernet. (Part B) , vol.13 , pp. 48-61
    • Tsai, W.1    Fu, K.2
  • 103
    • 0142032204 scopus 로고    scopus 로고
    • Support vector classification with asymmetric kernel function
    • Verleysen, M. (Ed.)
    • Tsuda, K.; 1999. Support vector classification with asymmetric kernel function. In: Verleysen, M. (Ed.), Proc. 7th European Symposium on Artificial Neural Networks, pp. 183-188.
    • (1999) Proc. 7th European Symposium on Artificial Neural Networks , pp. 183-188
    • Tsuda, K.1
  • 104
    • 0003386794 scopus 로고    scopus 로고
    • An algorithm for approximate least-squares attributed graph matching
    • M. van Wyk, and J. Clark An algorithm for approximate least-squares attributed graph matching Problems Appl. Math. Comput. Intell. 2001 67 72
    • (2001) Problems Appl. Math. Comput. Intell. , pp. 67-72
    • Van Wyk, M.1    Clark, J.2
  • 109
    • 0002531715 scopus 로고    scopus 로고
    • Dynamic alignment kernels
    • A. Smola, P. Bartlett, B. Schölkopf, D. Schuurmans, MIT Press
    • C. Watkins Dynamic alignment kernels A. Smola, P. Bartlett, B. Schölkopf, D. Schuurmans, Advances in Large Margin Classifiers 2000 MIT Press 39 50
    • (2000) Advances in Large Margin Classifiers , pp. 39-50
    • Watkins, C.1
  • 113
    • 0001456636 scopus 로고
    • Three-dimensional object recognition by attributed graphs
    • H. Bunke, A. Sanfeliu, World Scientific
    • E. Wong Three-dimensional object recognition by attributed graphs H. Bunke, A. Sanfeliu, Syntactic and Structural Pattern Recognition: Theory and Applications 1990 World Scientific 381 414
    • (1990) Syntactic and Structural Pattern Recognition: Theory and Applications , pp. 381-414
    • Wong, E.1
  • 114
    • 0021491949 scopus 로고
    • Entropy and distance of random graphs with application to structural pattern recognition
    • A. Wong, and M. You Entropy and distance of random graphs with application to structural pattern recognition IEEE Trans. Pattern Anal. Machine Intell. 7 5 1985 599 609 (Pubitemid 16574250)
    • (1984) IEEE Transactions on Pattern Analysis and Machine Intelligence , Issue.5 , pp. 599-609
    • Wong, A.1    You, M.2
  • 116
    • 84887495232 scopus 로고
    • Improved simulated annealing: Boltzmann machine, and attributed graph matching
    • L. Almeida, LNCS Springer
    • L. Xu, and E. Oja Improved simulated annealing: Boltzmann machine, and attributed graph matching L. Almeida, Proc. Internat. Workshop on Neural Networks LNCS vol. 412 1990 Springer 151 161
    • (1990) Proc. Internat. Workshop on Neural Networks , vol.412 , pp. 151-161
    • Xu, L.1    Oja, E.2
  • 117
    • 0036487278 scopus 로고    scopus 로고
    • Combining flat and structured representations for fingerprint classification with recursive neural networks and support vector machines
    • DOI 10.1016/S0031-3203(02)00039-0, PII S0031320302000390
    • Y. Yao, G. 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 2003 397 406 (Pubitemid 35212836)
    • (2002) Pattern Recognition , vol.36 , Issue.2 , pp. 397-406
    • Yao, Y.1    Marcialis, G.L.2    Pontil, M.3    Frasconi, P.4    Roli, F.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.