{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:11:51Z","timestamp":1725563511119},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642149795"},{"type":"electronic","value":"9783642149801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14980-1_14","type":"book-chapter","created":{"date-parts":[[2010,8,28]],"date-time":"2010-08-28T10:05:23Z","timestamp":1282989923000},"page":"149-158","source":"Crossref","is-referenced-by-count":3,"title":["A Comparison between Two Representatives of a Set of Graphs: Median vs. Barycenter Graph"],"prefix":"10.1007","author":[{"given":"Itziar","family":"Bardaji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miquel","family":"Ferrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Sanfeliu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/TPAMI.1985.4767707","volume":"7","author":"A. Wong","year":"1985","unstructured":"Wong, A., You, M.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE TPAMI\u00a07, 599\u2013609 (1985)","journal-title":"IEEE TPAMI"},{"issue":"6","key":"14_CR2","first-page":"621","volume":"16","author":"F. Serratosa","year":"2002","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Synthesis of function-described graphs and clustering of attributed graphs. IJPRAI\u00a016(6), 621\u2013656 (2002)","journal-title":"IJPRAI"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/S0031-3203(02)00107-3","volume":"36","author":"F. Serratosa","year":"2003","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Function-described graphs for modelling objects represented by sets of attributed graphs. Pattern Recognition\u00a036(3), 781\u2013798 (2003)","journal-title":"Pattern Recognition"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-70659-3_26","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"F. Serratosa","year":"2002","unstructured":"Serratosa, F., Alqu\u00e9zar, R., Sanfeliu, A.: Estimating the joint probability distribution of random vertices and arcs by means of second-order random graphs. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol.\u00a02396, pp. 252\u2013262. Springer, Heidelberg (2002)"},{"issue":"12","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1016\/S0167-8655(02)00103-4","volume":"23","author":"L.P. Cordella","year":"2002","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: Learning structural shape descriptions from examples. Pattern Recognition Letters\u00a023(12), 1427\u20131437 (2002)","journal-title":"Pattern Recognition Letters"},{"issue":"10","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1109\/34.954604","volume":"23","author":"X. Jiang","year":"2001","unstructured":"Jiang, X., M\u00fcnger, A., Bunke, H.: On median graphs: Properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell.\u00a023(10), 1144\u20131151 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Jain, B., Obermayer, K.: On the sample mean of graphs. In: Proc. of IJCNN 2008, June 2008, pp. 993\u20131000 (2008)","DOI":"10.1109\/IJCNN.2008.4633920"},{"issue":"3","key":"14_CR8","first-page":"353","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE TSMC\u00a013(3), 353\u2013362 (1983)","journal-title":"IEEE TSMC"},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s006070170006","volume":"67","author":"H. Bunke","year":"2001","unstructured":"Bunke, H., G\u00fcnter, S.: Weighted mean of a pair of graphs. Computing\u00a067(3), 209\u2013224 (2001)","journal-title":"Computing"},{"key":"14_CR10","unstructured":"M\u00fcnger, A.: Synthesis of prototype graphs from sample graphs. In: Diploma Thesis, University of Bern, in German (1998)"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00500-005-0464-1","volume":"10","author":"A. Hlaoui","year":"2006","unstructured":"Hlaoui, A., Wang, S.: Median graph computation for graph clustering. Soft Comput.\u00a010(1), 47\u201353 (2006)","journal-title":"Soft Comput."},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-72903-7_35","volume-title":"Graph-Based Representations in Pattern Recognition","author":"K. Riesen","year":"2007","unstructured":"Riesen, K., Neuhaus, M., Bunke, H.: Graph embedding in vector spaces by means of prototype selection. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol.\u00a04538, pp. 383\u2013393. Springer, Heidelberg (2007)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02187906","volume":"3","author":"C. Bajaj","year":"1988","unstructured":"Bajaj, C.: The algebraic degree of geometric optimization problems. Discrete Comput. Geom.\u00a03(2), 177\u2013191 (1988)","journal-title":"Discrete Comput. Geom."},{"key":"14_CR14","unstructured":"Weiszfeld, E.: Sur le point pour lequel la somme des distances de n points donn\u00e9s est minimum. Tohoku Math. Journal\u00a0(43), 355\u2013386 (1937)"},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1016\/j.patcog.2009.10.013","volume":"43","author":"M. Ferrer","year":"2010","unstructured":"Ferrer, M., Valveny, E., Serratosa, F., Riesen, K., Bunke, H.: Generalized median graph computation by means of graph embedding in vector spaces. Pattern Recognition\u00a043(4), 1642\u20131655 (2010)","journal-title":"Pattern Recognition"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-02124-4_12","volume-title":"Graph-Based Representations in Pattern Recognition","author":"M. Ferrer","year":"2009","unstructured":"Ferrer, M., Karatzas, D., Valveny, E., Bunke, H.: A recursive embedding approach to median graph computation. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol.\u00a05534, pp. 113\u2013123. Springer, Heidelberg (2009)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: SSPR\/SPR, pp. 287\u2013297 (2008)","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11815921_17","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"M. Neuhaus","year":"2006","unstructured":"Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR 2006 and SPR 2006. LNCS, vol.\u00a04109, pp. 163\u2013172. Springer, Heidelberg (2006)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72903-7_1","volume-title":"Graph-Based Representations in Pattern Recognition","author":"K. Riesen","year":"2007","unstructured":"Riesen, K., Neuhaus, M., Bunke, H.: Bipartite graph matching for computing the edit distance of graphs. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol.\u00a04538, pp. 1\u201312. Springer, Heidelberg (2007)"},{"key":"14_CR20","unstructured":"Bardaji, I.: Graph representatives: Two different approaches based on the median and the barycenter graph. Master\u2019s thesis, UPC, Barcelona (2009)"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14980-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:42:22Z","timestamp":1619786542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14980-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642149795","9783642149801"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14980-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}