{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:14Z","timestamp":1725798614287},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444146"},{"type":"electronic","value":"9783662444153"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44415-3_10","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T00:40:31Z","timestamp":1407890431000},"page":"93-102","source":"Crossref","is-referenced-by-count":2,"title":["Flip-Flop Sublinear Models for Graphs"],"prefix":"10.1007","author":[{"given":"Brijnesh","family":"Jain","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1928","DOI":"10.1016\/j.patcog.2010.05.016","volume":"44","author":"H. Bunke","year":"2011","unstructured":"Bunke, H., Riesen, K.: Improving vector space embedding of graphs through feature selection algorithms. Pattern Recognition\u00a044(9), 1928\u20131940 (2011)","journal-title":"Pattern Recognition"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: NIPS (2006)","DOI":"10.7551\/mitpress\/7503.003.0044"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"10_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The elements of statistical learning","author":"T. Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The elements of statistical learning. Springer, New York (2001)"},{"key":"10_CR5","first-page":"1993","volume":"3","author":"B. Jain","year":"2003","unstructured":"Jain, B., Wysotzki, F.: Multi-Layer Perceptron Learning in the Domain of Graphs. IJCNN\u00a03, 1993\u20131998 (2003)","journal-title":"IJCNN"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-27868-9_8","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"B. Jain","year":"2004","unstructured":"Jain, B., Wysotzki, F.: Structural perceptrons for attributed graphs. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol.\u00a03138, pp. 85\u201394. Springer, Heidelberg (2004)"},{"key":"10_CR7","unstructured":"Jain, B.: Structural Neural Learning Machines. PhD thesis, TU Berlin (2005)"},{"key":"10_CR8","first-page":"2667","volume":"10","author":"B. Jain","year":"2009","unstructured":"Jain, B., Obermayer, K.: Structure Spaces. The Journal of Machine Learning Research\u00a010, 2667\u20132714 (2009)","journal-title":"The Journal of Machine Learning Research"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-20844-7_7","volume-title":"Graph-Based Representations in Pattern Recognition","author":"B. Jain","year":"2011","unstructured":"Jain, B., Obermayer, K.: Maximum likelihood for gaussians on graphs. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol.\u00a06658, pp. 62\u201371. Springer, Heidelberg (2011)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-20844-7_13","volume-title":"Graph-Based Representations in Pattern Recognition","author":"B. Jain","year":"2011","unstructured":"Jain, B., Obermayer, K.: Generalized learning graph quantization. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol.\u00a06658, pp. 122\u2013131. Springer, Heidelberg (2011)"},{"key":"10_CR11","unstructured":"Jain, B., Obermayer, K.: Learning in Riemannian Orbifolds. arXiv preprint arXiv:1204.4294 (2012)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Jain, B.: Sublinear Models for Graphs. arXiv preprint arXiv:1204.4294 (2014)","DOI":"10.1007\/978-3-662-44415-3_10"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Jain, B.: Flip-Flop Sublinear Models for Graphs: Proof of Theorem 1. arXiv preprint arXiv:cs.LG (2014)","DOI":"10.1007\/978-3-662-44415-3_10"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Livi, L., Rizzi, A., Sadeghian, A.: Optimized Dissimilarity Space Embedding for Labeled Graphs. Information Sciences (2014)","DOI":"10.1016\/j.ins.2014.01.005"},{"key":"10_CR15","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)"},{"key":"10_CR16","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.) SSPR&SPR 2008. LNCS, vol.\u00a05342, pp. 287\u2013297. Springer, Heidelberg (2008)"},{"issue":"5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Transactions on PAMI\u00a010(5), 695\u2013703 (1988)","journal-title":"IEEE Transactions on PAMI"}],"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-662-44415-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T18:31:06Z","timestamp":1689445866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44415-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444146","9783662444153"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44415-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}