메뉴 건너뛰기




Volumn 115, Issue 7, 2011, Pages 905-918

Learning graph prototypes for shape recognition

Author keywords

Discriminative graphs; Genetic algorithm; Graph classification; Graph prototypes; Median graphs; Symbol recognition

Indexed keywords

DISCRIMINATIVE GRAPHS; GRAPH CLASSIFICATION; GRAPH PROTOTYPES; MEDIAN GRAPHS; SYMBOL RECOGNITION;

EID: 79956084078     PISSN: 10773142     EISSN: 1090235X     Source Type: Journal    
DOI: 10.1016/j.cviu.2010.12.015     Document Type: Article
Times cited : (14)

References (44)
  • 1
    • 27944453480 scopus 로고    scopus 로고
    • Finding frequent patterns in a large sparse graph
    • DOI 10.1007/s10618-005-0003-9
    • M. Kuramochi, and G. Karypis Finding frequent patterns in a large sparse graph Data Mining and Knowledge Discovery 11 3 2005 243 271 (Pubitemid 41669194)
    • (2005) Data Mining and Knowledge Discovery , vol.11 , Issue.3 , pp. 243-271
    • Kuramochi, M.1    Karypis, G.2
  • 2
    • 0037364958 scopus 로고    scopus 로고
    • Complete mining of frequent patterns from graphs: Mining graph data
    • A. Inokuchi, T. Washio, and H. Motoda Complete mining of frequent patterns from graphs: mining graph data Machine Learning 50 3 2003 321 354
    • (2003) Machine Learning , vol.50 , Issue.3 , pp. 321-354
    • Inokuchi, A.1    Washio, T.2    Motoda, H.3
  • 3
    • 49749086479 scopus 로고    scopus 로고
    • Fast online graph clustering via erdos renyi mixture
    • H. Zanghi, C. Ambroise, and V. Miele Fast online graph clustering via erdos renyi mixture Pattern Recognition 41 12 2008 3592 3599
    • (2008) Pattern Recognition , vol.41 , Issue.12 , pp. 3592-3599
    • Zanghi, H.1    Ambroise, C.2    Miele, V.3
  • 4
    • 27344438468 scopus 로고    scopus 로고
    • Graph matching and clustering using spectral partitions
    • DOI 10.1016/j.patcog.2005.06.014, PII S0031320305002694
    • H. Qiu, and E.R. Hancock Graph matching and clustering using spectral partitions Pattern Recognition 39 1 2006 22 34 (Pubitemid 41525561)
    • (2006) Pattern Recognition , vol.39 , Issue.1 , pp. 22-34
    • Qiu, H.1    Hancock, E.R.2
  • 5
    • 34250818638 scopus 로고    scopus 로고
    • Inexact graph matching using a genetic algorithm for image recognition
    • DOI 10.1016/j.patrec.2007.02.013, PII S0167865507000682
    • S. Auwatanamongkol Inexact graph matching using a genetic algorithm for image recognition Pattern Recognition Letters 28 12 2007 1428 1437 (Pubitemid 46990580)
    • (2007) Pattern Recognition Letters , vol.28 , Issue.12 , pp. 1428-1437
    • Auwatanamongkol, S.1
  • 6
    • 33745360257 scopus 로고    scopus 로고
    • Inexact graph matching using a genetic algorithm for image recognition
    • M. Neuhaus, and H. Bunke Inexact graph matching using a genetic algorithm for image recognition Pattern Recognition 39 10 2006 1852 1863
    • (2006) Pattern Recognition , vol.39 , Issue.10 , pp. 1852-1863
    • Neuhaus, M.1    Bunke, H.2
  • 7
    • 32044474167 scopus 로고    scopus 로고
    • Protein classification by matching and clustering surface graphs
    • DOI 10.1016/j.patcog.2005.10.008, PII S0031320305003869, Graph-Based Representations
    • M.A. Lozano, and F. Escolano Protein classification by matching and clustering surface graphs Pattern Recognition 39 4 2006 539 551 (Pubitemid 43199453)
    • (2006) Pattern Recognition , vol.39 , Issue.4 , pp. 539-551
    • Lozano, M.A.1    Escolano, F.2
  • 12
    • 23844458045 scopus 로고    scopus 로고
    • Graph kernels for molecular structure-activity relationship analysis with support vector machines
    • DOI 10.1021/ci050039t
    • P. MahT, N. Ueda, T. Akutsu, J.-L. Perret, and J.-P. Vert Graph kernels for molecular structure-activity relationship analysis with support vector machines Journal of Chemical Information and Modeling 45 4 2005 939 951 (Pubitemid 41156693)
    • (2005) Journal of Chemical Information and Modeling , vol.45 , Issue.4 , pp. 939-951
    • Mahe, P.1    Ueda, N.2    Akutsu, T.3    Perret, J.-L.4    Vert, J.-P.5
  • 17
    • 0016127071 scopus 로고
    • Finding prototypes for nearest neighbor classifiers
    • C.-L. Chang Finding prototypes for nearest neighbor classifiers IEEE Transactions on Computers 23 11 1974 1179 1184
    • (1974) IEEE Transactions on Computers , vol.23 , Issue.11 , pp. 1179-1184
    • Chang, C.-L.1
  • 22
    • 35248884846 scopus 로고    scopus 로고
    • Graph clustering using the weighted minimum common supergraph
    • H. Bunke, P. Foggia, C. Guidobaldi, M. Vento, Graph clustering using the weighted minimum common supergraph, in: GbRPR, 2003, pp. 235-246.
    • (2003) GbRPR , pp. 235-246
    • Bunke, H.1    Foggia, P.2    Guidobaldi, C.3    Vento, M.4
  • 23
    • 34547108590 scopus 로고    scopus 로고
    • Structural shape prototypes for the automatic classification of 3D objects
    • DOI 10.1109/MCG.2007.89
    • S. Marini, M. Spagnuolo, and B. Falcidieno Structural shape prototypes for the automatic classification of 3d objects IEEE Computer Graphics and Applications 27 4 2007 28 37 (Pubitemid 47098755)
    • (2007) IEEE Computer Graphics and Applications , vol.27 , Issue.4 , pp. 28-37
    • Marini, S.1    Spagnuolo, M.2    Falcidieno, B.3
  • 24
    • 0342973213 scopus 로고    scopus 로고
    • Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem
    • X.J.H. Bunke, and A. Mnnger Combinatorial search versus genetic algorithms: a case study based on the generalized median graph problem Pattern Recognition Letters 20 11 1999 1271 1277
    • (1999) Pattern Recognition Letters , vol.20 , Issue.11 , pp. 1271-1277
    • Bunke, X.J.H.1    Mnnger, A.2
  • 26
    • 33845187171 scopus 로고    scopus 로고
    • Spectral median graphs applied to graphical symbol recognition
    • M. Ferrer, E. Valveny, F. Serratosa, Spectral median graphs applied to graphical symbol recognition, in: CIARP, 2006, pp. 774-783.
    • (2006) CIARP , pp. 774-783
    • Ferrer, M.1    Valveny, E.2    Serratosa, F.3
  • 27
    • 38149015505 scopus 로고    scopus 로고
    • On the relation between the median and the maximum common subgraph of a set of graphs
    • M. Ferrer, F. Serratosa, E. Valveny, On the relation between the median and the maximum common subgraph of a set of graphs, in: GbRPR, 2007, pp. 351-360.
    • (2007) GbRPR , pp. 351-360
    • Ferrer, M.1    Serratosa, F.2    Valveny, E.3
  • 28
    • 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 Computing-A Fusion of Foundations, Methodologies and Applications 10 1 2005 47 53 (Pubitemid 41631145)
    • (2006) Soft Computing , vol.10 , Issue.1 , pp. 47-53
    • Hlaoui, A.1    Wang, S.2
  • 30
    • 0000935031 scopus 로고
    • Editing for the k-nearest neighbors rule by a genetic algorithm
    • L.I. Kuncheva Editing for the k-nearest neighbors rule by a genetic algorithm Pattern Recognition Letters 16 8 1995 809 814
    • (1995) Pattern Recognition Letters , vol.16 , Issue.8 , pp. 809-814
    • Kuncheva, L.I.1
  • 33
    • 0031198630 scopus 로고    scopus 로고
    • On a relation between graph edit distance and maximum common subgraph
    • PII S0167865597000603
    • H. Bunke On a relation between graph edit distance and maximum common subgraph Pattern Recognition Letters 18 8 1997 689 694 (Pubitemid 127411238)
    • (1997) Pattern Recognition Letters , vol.18 , Issue.8 , pp. 689-694
    • Bunke, H.1
  • 35
    • 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 Computing 27 7 2009 950 959
    • (2009) Image Vision Computing , vol.27 , Issue.7 , pp. 950-959
    • Riesen, K.1    Bunke, H.2
  • 36
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximal common subgraph
    • PII S0167865597001797
    • H. Bunke, and K. Shearer A graph distance metric based on the maximal common subgraph Pattern Recognition Letters 19 3-4 1998 255 259 (Pubitemid 128383123)
    • (1998) Pattern Recognition Letters , vol.19 , Issue.3-4 , pp. 255-259
    • Bunke, H.1    Shearer, K.2
  • 38
    • 33745126452 scopus 로고    scopus 로고
    • A fast technique for comparing graph representations with applications to performance evaluation
    • D.P. Lopresti, and G.T. Wilfong A fast technique for comparing graph representations with applications to performance evaluation IJDAR 6 4 2003 219 229
    • (2003) IJDAR , vol.6 , Issue.4 , pp. 219-229
    • Lopresti, D.P.1    Wilfong, G.T.2


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