乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T07:09:22Z","timestamp":1720854562746},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15H06009","16K00259"],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2876860","type":"journal-article","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T00:01:22Z","timestamp":1540252882000},"page":"63606-63618","source":"Crossref","is-referenced-by-count":1,"title":["Structural Data Recognition With Graph Model Boosting"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-5205-0542","authenticated-orcid":false,"given":"Tomo","family":"Miyazaki","sequence":"first","affiliation":[]},{"given":"Shinichiro","family":"Omachi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2400451"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383171"},{"key":"ref32","first-page":"729","article-title":"An application of boosting to graph classification","author":"kudo","year":"2005","journal-title":"Proc 17th Adv Neural Inf Process Syst"},{"key":"ref31","author":"vapnik","year":"1998","journal-title":"Statistical Learning Theory"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033119.52532.ce"},{"key":"ref37","first-page":"313","article-title":"Balanced graph matching","author":"cour","year":"2007","journal-title":"Proc 19th Adv Neural Inf Process Syst"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.11"},{"key":"ref35","first-page":"492","article-title":"Reweighted random walks for graph matching","volume":"6315","author":"cho","year":"2010","journal-title":"Vision Computer"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1613\/jair.105"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.387"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-5819-7"},{"key":"ref29","first-page":"38","article-title":"Closure-tree: An index structure for graph queries","author":"he","year":"2006","journal-title":"Proc Int Conf Data Eng"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34166-3_4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2008.4761206"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1985.4767707"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00107-3"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00227-3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.125"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003253"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587639"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/28.1.235"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.09.018"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.01.005"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2019264"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2008.04.006"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1984.6313232"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/3-540-45028-9_21","article-title":"Graph clustering using the weighted minimum common supergraph","volume":"2726","author":"bunke","year":"2003","journal-title":"Graph Based Representations in Pattern Recognition"},{"key":"ref12","first-page":"163","article-title":"Fast suboptimal algorithms for the computation of graph edit distance","author":"neuhaus","year":"2006","journal-title":"Proc Int Conf Struct Syntactic and Statistical Pattern Recog"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/978-3-319-58961-9_11","article-title":"A Hungarian algorithm for error-correcting graph matching","author":"bougleux","year":"2017","journal-title":"Graph-Based Represent Pattern Recognit"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58961-9_20"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.030"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/34.954604"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.381"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-319-58961-9_21","article-title":"An edit distance between graph correspondences","author":"moreno-garc\u00eda","year":"2017","journal-title":"Graph-Based Represent Pattern Recognit"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.04.017"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2016.7899882"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1021\/jm040835a"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1980.4308468"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34166-3_26"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","article-title":"IAM graph database repository for graph based pattern recognition and machine learning","author":"riesen","year":"2008","journal-title":"Proc Int Workshop on Structural and Syntactic Pattern Recogn"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1997.609410"},{"key":"ref47","article-title":"Columbia object image library: Coil-100","author":"nene","year":"1996"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"349","DOI":"10.4310\/SII.2009.v2.n3.a8","article-title":"Multi-class AdaBoost","volume":"2","author":"zhu","year":"2009","journal-title":"Statist Interface"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"ref44","author":"breiman","year":"1984","journal-title":"Classification and Regression Trees"},{"key":"ref43","first-page":"113","article-title":"Reducing multiclass to binary: A unifying approach for margin classifiers","volume":"1","author":"allwein","year":"2001","journal-title":"J Mach Learn Res"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08501919.pdf?arnumber=8501919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T03:21:21Z","timestamp":1643253681000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8501919\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2876860","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}