메뉴 건너뛰기




Volumn 33, Issue 16, 2012, Pages 2239-2244

Kernels for acyclic digraphs

Author keywords

Directed graph; Graph kernel; Graph minors; Graph similarity; Path and cycle in graphs; Pattern recognition

Indexed keywords

ACYCLIC DIGRAPH; ALGORITHMIC COMPLEXITY; COMMON PATH; GRAPH KERNELS; GRAPH MINORS; GRAPH SIMILARITY; PATH AND CYCLE IN GRAPHS; PATH LENGTH; SYNTHETIC AND REAL DATA;

EID: 84866544598     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2012.07.017     Document Type: Article
Times cited : (14)

References (45)
  • 1
    • 80052868158 scopus 로고    scopus 로고
    • Springer/Hindustan Book Agency New York/New Delhi
    • R. Bapat Graphs and Matrices 2011 Springer/Hindustan Book Agency New York/New Delhi
    • (2011) Graphs and Matrices
    • Bapat, R.1
  • 2
    • 33846839295 scopus 로고    scopus 로고
    • Concordance trees, concordance factors, and the exploration of reticulate genealogy
    • D.A. Baum Concordance trees, concordance factors, and the exploration of reticulate genealogy Taxon 56 2 2007 417 426 (Pubitemid 47025837)
    • (2007) Taxon , vol.56 , Issue.2 , pp. 417-426
    • Baum, D.A.1
  • 4
    • 84872972701 scopus 로고    scopus 로고
    • Kernel methods in bioinformatics
    • H.B.S. Horng-Shing Lu, H. Zhao, Springer Berlin (Ch. 15)
    • K.M. Borgwardt Kernel methods in bioinformatics H.B.S. Horng-Shing Lu, H. Zhao, Handbook of Statistical Bioinformatics 2011 Springer Berlin (Ch. 15)
    • (2011) Handbook of Statistical Bioinformatics
    • Borgwardt, K.M.1
  • 5
    • 34548585627 scopus 로고    scopus 로고
    • Shortest-path kernels on graphs
    • DOI 10.1109/ICDM.2005.132, 1565664, Proceedings - Fifth IEEE International Conference on Data Mining, ICDM 2005
    • K.M. Borgwardt, and H.-P. Kriegel Shortest-path kernels on graphs Proceedings of the International Conference on Data Mining (ICDM'05) 2005 IEEE Computer Society Houston, TX 74 81 (Pubitemid 47385679)
    • (2005) Proceedings - IEEE International Conference on Data Mining, ICDM , pp. 74-81
    • Borgwardt, K.M.1    Kriegel, H.-P.2
  • 6
    • 0031198630 scopus 로고    scopus 로고
    • On a relation between graph edit distance and maximum common subgraph
    • H. Bunke On a relation between graph edit distance and maximum common subgraph Pattern Recognition Lett. 18 8 1997 669 689
    • (1997) Pattern Recognition Lett. , vol.18 , Issue.8 , pp. 669-689
    • Bunke, H.1
  • 7
    • 78651327151 scopus 로고    scopus 로고
    • Recent advances in graph-based pattern recognition with applications in document analysis
    • H. Bunke, and K. Riesen Recent advances in graph-based pattern recognition with applications in document analysis Pattern Recognition 44 5 2011 1057 1067
    • (2011) Pattern Recognition , vol.44 , Issue.5 , pp. 1057-1067
    • Bunke, H.1    Riesen, K.2
  • 8
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximal common subgraph
    • PII S0167865597001797
    • H. Bunke, and K. Schearer A graph distance metric based on the maximal common subgraph Pattern Recognition Lett. 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
  • 12
    • 0003677229 scopus 로고    scopus 로고
    • third ed. Springer New York, NY
    • R. Diestel Graph Theory third ed. 2005 Springer New York, NY
    • (2005) Graph Theory
    • Diestel, R.1
  • 15
    • 0036428114 scopus 로고    scopus 로고
    • Comparing networks across space and time, size and species
    • K. Faust, and J. Skvoretz Comparing networks across space and time, size and species Sociol. Methodol. 32 1 2002 267 299
    • (2002) Sociol. Methodol. , vol.32 , Issue.1 , pp. 267-299
    • Faust, K.1    Skvoretz, J.2
  • 16
    • 0035339250 scopus 로고    scopus 로고
    • A graph distance metric combining maximum common subgraph and minimum common supergraph
    • M.L. Fernandez, and G. Valiente A graph distance metric combining maximum common subgraph and minimum common supergraph Pattern Recognition Lett. 22 6-7 2001 753 775
    • (2001) Pattern Recognition Lett. , vol.22 , Issue.67 , pp. 753-775
    • Fernandez, M.L.1    Valiente, G.2
  • 19
    • 0141843591 scopus 로고    scopus 로고
    • Development of a chemical structure comparison method for integrated analysis of chemical and genomic information in the metabolic pathways
    • DOI 10.1021/ja036030u
    • M. Hattori, Y. Okuno, S. Goto, and M. Kanehisa Development of a chemical structure comparison method for integrated analysis of chemical and genomic information in the metabolic pathways J. Amer. Chem. Soc. 125 2003 11853 11865 (Pubitemid 37175419)
    • (2003) Journal of the American Chemical Society , vol.125 , Issue.39 , pp. 11853-11865
    • Hattori, M.1    Okuno, Y.2    Goto, S.3    Kanehisa, M.4
  • 22
    • 79959318644 scopus 로고    scopus 로고
    • Computing subgraph isomorphic queries using structural unification and minimum graph structures
    • Jamil, H.; 2011. Computing subgraph isomorphic queries using structural unification and minimum graph structures. In: 26th ACM Symposium on Applied Computing, pp. 1058-1063.
    • (2011) 26th ACM Symposium on Applied Computing , pp. 1058-1063
    • Jamil, H.1
  • 28
    • 77955451424 scopus 로고    scopus 로고
    • Measuring tree similarity for natural language processing based information retrieval
    • Z. Lin, H. Wang, and S. McClean Measuring tree similarity for natural language processing based information retrieval Lecture Notes in Computer Science 6177 2010 13 23
    • (2010) Lecture Notes in Computer Science , vol.6177 , pp. 13-23
    • Lin, Z.1    Wang, H.2    McClean, S.3
  • 34
    • 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 7 2009 950 959
    • (2009) Image Vision Comput. , vol.27 , Issue.7 , pp. 950-959
    • Riesen, K.1    Bunke, H.2
  • 40
    • 0016870630 scopus 로고
    • An algorithm for subgraph isomorphism
    • J.R. Ullman An algorithm for subgraph isomorphism J. ACM 23 1 1976 31 42
    • (1976) J. ACM , vol.23 , Issue.1 , pp. 31-42
    • Ullman, J.R.1
  • 43
    • 84866355977 scopus 로고    scopus 로고
    • Faster subgraph isomorphism detection by well-founded total order indexing
    • in press
    • Weber, M.; Liwicki, M.; Dengel, A.; in press. Faster subgraph isomorphism detection by well-founded total order indexing. Pattern Recognition Lett.
    • Pattern Recognition Lett
    • Weber, M.1    Liwicki, M.2    Dengel, A.3


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