{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:01:07Z","timestamp":1725620467319},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037665"},{"type":"electronic","value":"9783642037672"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03767-2_42","type":"book-chapter","created":{"date-parts":[[2009,8,28]],"date-time":"2009-08-28T15:29:00Z","timestamp":1251473340000},"page":"342-350","source":"Crossref","is-referenced-by-count":18,"title":["Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph"],"prefix":"10.1007","author":[{"given":"M.","family":"Ferrer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Valveny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Serratosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Bardaj\u00ed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Bunke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"42_CR1","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: A review. ACM Comput. Surv.\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"42_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0167-8655(01)00173-8","volume":"23","author":"S. G\u00fcnter","year":"2002","unstructured":"G\u00fcnter, S., Bunke, H.: Self-organizing map for clustering in the graph domain. Pattern Recognition Letters\u00a023(4), 405\u2013417 (2002)","journal-title":"Pattern Recognition Letters"},{"issue":"6","key":"42_CR3","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1142\/S0218001402001915","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. International Journal of Pattern Recognition and Artificial Intelligence\u00a016(6), 621\u2013656 (2002)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"42_CR4","unstructured":"Luo, B., Robles-Kelly, A., Torsello, A., Wilson, R.C., Hancock, E.: Clustering shock trees. In: Proc. 3rd IAPR Workshop Graph-Based Representations in Pattern Recognition, pp. 217\u2013228 (2001)"},{"key":"42_CR5","doi-asserted-by":"crossref","DOI":"10.1142\/5832","volume-title":"Graph-Theoretic Techniques for Web Content Mining","author":"A. Schenker","year":"2005","unstructured":"Schenker, A., Bunke, H., Last, M., Kandel, A.: Graph-Theoretic Techniques for Web Content Mining. World Scientific Publishing, USA (2005)"},{"issue":"10","key":"42_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."},{"issue":"11-13","key":"42_CR7","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1016\/S0167-8655(99)00094-X","volume":"20","author":"H. Bunke","year":"1999","unstructured":"Bunke, H., M\u00fcnger, A., Jiang, X.: Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem. Pattern Recognition Letters\u00a020(11-13), 1271\u20131277 (1999)","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"42_CR8","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":"42_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/11492542_18","volume-title":"Pattern Recognition and Image Analysis","author":"M. Ferrer","year":"2005","unstructured":"Ferrer, M., Serratosa, F., Sanfeliu, A.: Synthesis of median spectral graph. In: Marques, J.S., P\u00e9rez de la Blanca, N., Pina, P. (eds.) IbPRIA 2005. LNCS, vol.\u00a03523, pp. 139\u2013146. Springer, Heidelberg (2005)"},{"key":"42_CR10","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 2007. LNCS, vol.\u00a04538, pp. 383\u2013393. Springer, Heidelberg (2007)"},{"issue":"3","key":"42_CR11","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":"42_CR12","volume-title":"Machine Learning","author":"T.M. Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)"},{"issue":"4","key":"42_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H. Bunke","year":"1983","unstructured":"Bunke, H., Allerman, G.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters\u00a01(4), 245\u2013253 (1983)","journal-title":"Pattern Recognition Letters"},{"issue":"3","key":"42_CR14","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics\u00a013(3), 353\u2013362 (1983)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Algorithmic applications of low-distortion geometric embeddings. In: IEEE Symposium on Foundations of Computer Science, pp. 10\u201333 (2001)","DOI":"10.1109\/SFCS.2001.959878"},{"issue":"10","key":"42_CR16","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1016\/S0031-3203(03)00084-0","volume":"36","author":"B. Luo","year":"2003","unstructured":"Luo, B., Wilson, R.C., Hancock, E.R.: Spectral embedding of graphs. Pattern Recognition\u00a036(10), 2213\u20132230 (2003)","journal-title":"Pattern Recognition"},{"issue":"7","key":"42_CR17","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TPAMI.2005.145","volume":"27","author":"R.C. Wilson","year":"2005","unstructured":"Wilson, R.C., Hancock, E.R., Luo, B.: Pattern vectors from algebraic graph theory. IEEE Trans. Pattern Anal. Mach. Intell.\u00a027(7), 1112\u20131124 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"42_CR18","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1016\/j.patcog.2006.05.031","volume":"40","author":"A. Robles-Kelly","year":"2007","unstructured":"Robles-Kelly, A., Hancock, E.R.: A Riemannian approach to graph embedding. Pattern Recognition\u00a040(3), 1042\u20131056 (2007)","journal-title":"Pattern Recognition"},{"issue":"2","key":"42_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.patcog.2005.06.012","volume":"39","author":"E. Pekalska","year":"2006","unstructured":"Pekalska, E., Duin, R.P.W., Pacl\u00edk, P.: Prototype selection for dissimilarity-based classifiers. Pattern Recognition\u00a039(2), 189\u2013208 (2006)","journal-title":"Pattern Recognition"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Ferrer, M., Valveny, E., Serratosa, F., Riesen, K., Bunke, H.: An approximate algorithm for median graph computation using graph embedding. In: Proceedings of 19th ICPR, pp. 287\u2013297 (2008)","DOI":"10.1109\/ICPR.2008.4761354"},{"key":"42_CR21","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":"42_CR22","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 2007. LNCS, vol.\u00a04538, pp. 1\u201312. Springer, Heidelberg (2007)"},{"key":"42_CR23","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)"},{"key":"42_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K. Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol.\u00a05342, pp. 287\u2013297. Springer, Heidelberg (2008)"},{"key":"42_CR25","doi-asserted-by":"publisher","first-page":"846","DOI":"10.2307\/2284239","volume":"66","author":"W.M. Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. Journal of the American Statistival Association\u00a066, 846\u2013850 (1971)","journal-title":"Journal of the American Statistival Association"},{"key":"42_CR26","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/01969727408546059","volume":"4","author":"J. Dunn","year":"1974","unstructured":"Dunn, J.: Well separated clusters and optimal fuzzy partitions. Journal of Cibernetics\u00a04, 95\u2013104 (1974)","journal-title":"Journal of Cibernetics"}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03767-2_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:20:45Z","timestamp":1619781645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03767-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037665","9783642037672"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03767-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}