{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:05:29Z","timestamp":1743141929836,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319483535"},{"type":"electronic","value":"9783319483542"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48354-2_41","type":"book-chapter","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T15:27:10Z","timestamp":1478878030000},"page":"417-428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Simplifying Calculation of Graph Similarity Through Matrices"],"prefix":"10.1007","author":[{"given":"Xu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jihong","family":"Ouyang","sequence":"additional","affiliation":[]},{"given":"Guifen","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,12]]},"reference":[{"key":"41_CR1","volume-title":"Graphs and Matrices","author":"RB Bapat","year":"2011","unstructured":"Bapat, R.B.: Graphs and Matrices. Springer Press, New York (2011)"},{"issue":"39","key":"41_CR2","doi-asserted-by":"publisher","first-page":"11853","DOI":"10.1021\/ja036030u","volume":"125","author":"H Masahiro","year":"2003","unstructured":"Masahiro, H., Yasushi, O., Susumu, G., et al.: Development of a chemical structure comparison method for integrated analysis of chemical and genomic information in the metabolic pathways. J. Am. Chem. Soc. 125(39), 11853\u201311865 (2003)","journal-title":"J. Am. Chem. Soc."},{"key":"41_CR3","volume-title":"Bioinformatics, Problem Solving Paradigms","author":"S Volker","year":"2008","unstructured":"Volker, S.: Bioinformatics, Problem Solving Paradigms. Springer Press, Berlin (2008)"},{"issue":"16","key":"41_CR4","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1016\/j.patrec.2012.07.017","volume":"33","author":"HE Cees","year":"2012","unstructured":"Cees, H.E., Hui, W.: Kernels for acyclic digraphs. Pattern Recogn. Lett. 33(16), 2239\u20132244 (2012)","journal-title":"Pattern Recogn. Lett."},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Kang, U., Hanghang, T., Jimeng, S.: Fast random walk graph kernel. In: Proceedings of the Twelfth SIAM International Conference on Data Mining, pp. 828\u2013838 (2012)","DOI":"10.1137\/1.9781611972825.71"},{"issue":"12","key":"41_CR6","doi-asserted-by":"publisher","first-page":"5136","DOI":"10.1109\/TIP.2014.2362059","volume":"23","author":"K Amin","year":"2014","unstructured":"Amin, K., Peyman, M.: A general framework for regularized, similarity-based image restoration. IEEE Trans. Image Process. 23(12), 5136\u20135151 (2014)","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"41_CR7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00778-014-0373-y","volume":"24","author":"Y Ye","year":"2015","unstructured":"Ye, Y., Guoren, W., Lei, C., et al.: Graph similarity search on large uncertain graph databases. Int. J. Very Large Data Bases 24(2), 271\u2013296 (2015)","journal-title":"Int. J. Very Large Data Bases"},{"key":"41_CR8","unstructured":"Nino, S., Karsten, M.B.: Fast subtree kernels on graphs. In: The annual Conference on Neural Information Processing Systems, pp. 1660\u20131668 (2009)"},{"key":"41_CR9","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan, S.V.N., Schraudolph Nicol, N., Risi, K., et al.: Graph Kernels. J. Mach. Learn. Res. 11, 1201\u20131242 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"41_CR10","unstructured":"Karsten, M.B., Hans-Peter, K.: Shortest-path kernels on graphs. In: IEEE International Conference on Data Mining, pp. 74\u201381 (2005)"},{"issue":"6","key":"41_CR11","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1109\/TPAMI.2006.126","volume":"28","author":"W Hui","year":"2006","unstructured":"Hui, W.: Nearest neighbors by neighborhood counting. IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI) 28(6), 942\u2013953 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI)"},{"key":"41_CR12","unstructured":"Hui, W.: All common subsequences. In: Proceeding of 20th International Joint Conference on Artificial Intelligence, pp. 635\u2013640 (2007)"},{"issue":"4","key":"41_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/TKDE.2007.190721","volume":"20","author":"W Hui","year":"2008","unstructured":"Hui, W., Fionn, M.: A study of the neighborhood counting similarity. IEEE Trans. Knowl. Data Eng. 20(4), 449\u2013461 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.is.2013.12.008","volume":"42","author":"H Jun","year":"2014","unstructured":"Jun, H., Liu Hongyan, Yu., Jeffrey, X., et al.: Assessing single-pair similarity over graphs by aggregating first-meeting probabilities [J]. Inf. Syst. 42, 107\u2013122 (2014)","journal-title":"Inf. Syst."},{"issue":"12","key":"41_CR15","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1093\/bioinformatics\/btu282","volume":"30","author":"K Michael","year":"2014","unstructured":"Michael, K., Janusz, Dutkowski, Michael, Yu., et al.: Inferring gene ontologies from pairwise similarity data. Bioinformatics 30(12), 34\u201342 (2014)","journal-title":"Bioinformatics"},{"issue":"3","key":"41_CR16","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1016\/j.eswa.2014.08.051","volume":"42","author":"R Andrew","year":"2015","unstructured":"Andrew, R., Byunghoon, K., Jaemin, L., et al.: Graph kernel based measure for evaluating the influence of patents in a patent citation network. Expert Syst. Appl. 42(3), 1479\u20131486 (2015)","journal-title":"Expert Syst. Appl."},{"key":"41_CR17","unstructured":"Pierre, M., Nobuhisa, U., Tatsuya, A., et al.: Extensions of marginalized graph kernels. In: Proceedings of the 21st International Conference on Machine Learning, pp. 552\u2013559 (2004)"},{"issue":"6","key":"41_CR18","first-page":"345","volume":"5","author":"W Robert","year":"1962","unstructured":"Robert, W.: Floyd. algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"issue":"1","key":"41_CR19","first-page":"127","volume":"3","author":"K Zolt\u00e1n","year":"2011","unstructured":"Zolt\u00e1n, K.: On scattered subword complexity. Acta Univ. Sapientiae Informatica 3(1), 127\u2013136 (2011)","journal-title":"Acta Univ. Sapientiae Informatica"},{"issue":"3","key":"41_CR20","first-page":"561","volume":"10","author":"I Wang","year":"2014","unstructured":"Wang, I.: An algebraic decomposed algorithm for all pairs shortest paths. Pac. J. Optim. 10(3), 561\u2013576 (2014)","journal-title":"Pac. J. Optim."},{"key":"41_CR21","volume-title":"Graph Theory","author":"D Reinhard","year":"2005","unstructured":"Reinhard, D.: Graph Theory, 3rd edn. Springer Press, New York (2005)","edition":"3"}],"container-title":["IFIP Advances in Information and Communication Technology","Computer and Computing Technologies in Agriculture IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48354-2_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T02:10:34Z","timestamp":1605060634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48354-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319483535","9783319483542"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48354-2_41","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"12 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CCTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer and Computing Technologies in Agriculture","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ccta2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}