{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T09:57:55Z","timestamp":1770890275107,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030739720","type":"print"},{"value":"9783030739737","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73973-7_5","type":"book-chapter","created":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T14:03:24Z","timestamp":1617977004000},"page":"45-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exponential Weighted Moving Average of Time Series in Arbitrary Spaces with Application to Strings"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Welsing","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Nienk\u00f6tter","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7678-9528","authenticated-orcid":false,"given":"Xiaoyi","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,10]]},"reference":[{"issue":"3","key":"5_CR1","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 67(3), 209\u2013224 (2001)","journal-title":"Computing"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s100440200003","volume":"5","author":"H Bunke","year":"2002","unstructured":"Bunke, H., Jiang, X., Abegglen, K., Kandel, A.: On the weighted mean of a pair of strings. Pattern Anal. Appl. 5(1), 23\u201330 (2002)","journal-title":"Pattern Anal. Appl."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Chu, X., Ilyas, I.F., Krishnan, S., Wang, J.: Data cleaning: overview and emerging challenges. In: Proceedings of International Conference on Management of Data (SIGMOD), pp. 2201\u20132206 (2016)","DOI":"10.1145\/2882903.2912574"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/72.554199","volume":"8","author":"P Demartines","year":"1997","unstructured":"Demartines, P., H\u00e9rault, J.: Curvilinear component analysis: a self-organizing neural network for nonlinear mapping of data sets. IEEE Trans. Neural Netw. 8(1), 148\u2013154 (1997)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"4","key":"5_CR5","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 Recogn. 43(4), 1642\u20131655 (2010)","journal-title":"Pattern Recogn."},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10044-012-0304-8","volume":"17","author":"L Franek","year":"2014","unstructured":"Franek, L., Jiang, X., He, C.: Weighted mean of a pair of clusterings. Pattern Anal. Appl. 17(1), 153\u2013166 (2014)","journal-title":"Pattern Anal. Appl."},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.ijforecast.2006.03.005","volume":"22","author":"ES Gardner","year":"2006","unstructured":"Gardner, E.S.: Exponential smoothing: the state of the art - Part II. Int. J. Forecast. 22(4), 637\u2013666 (2006)","journal-title":"Int. J. Forecast."},{"key":"5_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/6855","volume-title":"Kernels for Structured Data","author":"T G\u00e4rtner","year":"2008","unstructured":"G\u00e4rtner, T.: Kernels for Structured Data. World Scientific, Singapore (2008)"},{"issue":"7","key":"5_CR9","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.patrec.2011.07.006","volume":"33","author":"X Jiang","year":"2012","unstructured":"Jiang, X., Wentker, J., Ferrer, M.: Generalized median string computation by means of string embedding in vector spaces. Pattern Recogn. Lett. 33(7), 842\u2013852 (2012)","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s41109-019-0195-3","volume":"5","author":"NM Kriege","year":"2020","unstructured":"Kriege, N.M., Johansson, F.D., Morris, C.: A survey on graph kernels. Appl. Netw. Sci. 5(1), 6 (2020)","journal-title":"Appl. Netw. Sci."},{"key":"5_CR11","unstructured":"Ma, S., Belkin, M.: Kernel machines that adapt to GPUs for effective large batch training. In: Proceedings of 2nd SysML Conference (2019)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.patrec.2018.08.027","volume":"134","author":"CF Moreno-Garc\u00eda","year":"2020","unstructured":"Moreno-Garc\u00eda, C.F., Serratosa, F., Jiang, X.: Correspondence edit distance to obtain a set of weighted means of graph correspondences. Pattern Recogn. Lett. 134, 29\u201336 (2020)","journal-title":"Pattern Recogn. Lett."},{"key":"5_CR13","unstructured":"Nakerst, G., Brennan, J., Haque, M.: Gradient descent with momentum - to accelerate or to super-accelerate? arXiv abs\/2001.06472 (2020)"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1109\/TSMC.2019.2896657","volume":"51","author":"A Nienk\u00f6tter","year":"2021","unstructured":"Nienk\u00f6tter, A., Jiang, X.: Distance-preserving vector space embedding for consensus learning. IEEE Trans. Syst. Man Cybern.: Syst. 51(2), 1244\u20131257 (2021)","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Nienk\u00f6tter, A., Jiang, X.: Kernel-based generalized median computation for consensus learning (2021). Under review","DOI":"10.1109\/TPAMI.2022.3202565"},{"key":"5_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel Methods for Pattern Analysis","author":"J Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)"},{"key":"5_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-52452-8","volume-title":"Time Series Analysis and Its Applications: With R Examples","author":"RH Shumway","year":"2017","unstructured":"Shumway, R.H., Stoffer, D.S.: Time Series Analysis and Its Applications: With R Examples. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-52452-8"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1109\/ACCESS.2019.2962152","volume":"8","author":"X Wang","year":"2020","unstructured":"Wang, X., Wang, C.: Time series data cleaning: a survey. IEEE Access 8, 1866\u20131881 (2020)","journal-title":"IEEE Access"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10479-008-0352-z","volume":"167","author":"E Weiszfeld","year":"2009","unstructured":"Weiszfeld, E., Plastria, F.: On the point for which the sum of the distances to n given points is minimum. Ann. Oper. Res. 167(1), 7\u201341 (2009)","journal-title":"Ann. Oper. Res."},{"key":"5_CR21","unstructured":"Welsing, A.: Moving average for time series of strings. Bachelor Thesis, University of M\u00fcnster (2020)"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"107668","DOI":"10.1016\/j.patcog.2020.107668","volume":"111","author":"L Xu","year":"2021","unstructured":"Xu, L., Bai, L., Jiang, X., Tan, M., Zhang, D., Luo, B.: Deep R\u00e9nyi entropy graph kernel. Pattern Recogn. 111, 107668 (2021)","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73973-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T22:02:19Z","timestamp":1744149739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73973-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030739720","9783030739737"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73973-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dais.unive.it\/sspr2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}