{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T07:08:46Z","timestamp":1745996926560,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030194932"},{"type":"electronic","value":"9783030194949"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19494-9_20","type":"book-chapter","created":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T15:30:52Z","timestamp":1558020652000},"page":"212-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Penalty-Based Aggregation of Strings"],"prefix":"10.1007","author":[{"given":"Ra\u00fal","family":"P\u00e9rez-Fern\u00e1ndez","sequence":"first","affiliation":[]},{"given":"Bernard","family":"De Baets","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,17]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"JK Lanctot","year":"2003","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185, 41\u201355 (2003)","journal-title":"Inf. Comput."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Nicolas, F., Rivals, E.: Complexities of the centre and median string problems. In: Proceedings of the 14th Annual Conference on Combinatorial Pattern Matching, pp. 315\u2013327. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-44888-8_23"},{"key":"20_CR4","unstructured":"Gagolewski, M.: Data Fusion. Theory, Methods and Applications. Institute of Computer Science, Polish Academy of Sciences, Warsaw (2015)"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950)","journal-title":"Bell Syst. Tech. J."},{"issue":"8","key":"20_CR6","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Phys. Doklady 10(8), 707\u2013710 (1966)","journal-title":"Soviet Phys. Doklady"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"P\u00e9rez-Fern\u00e1ndez, R., De\u00a0Baets, B.: On the role of monometrics in penalty-based data aggregation. IEEE Trans. Fuzzy Syst. (in press). \n                    https:\/\/doi.org\/10.1109\/TFUZZ.2018.2880716","DOI":"10.1109\/TFUZZ.2018.2880716"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0255(93)90104-T","volume":"68","author":"RR Yager","year":"1993","unstructured":"Yager, R.R.: Toward a general theory of information aggregation. Inf. Sci. 68, 191\u2013206 (1993)","journal-title":"Inf. Sci."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1016\/j.fss.2009.05.012","volume":"161","author":"T Calvo","year":"2010","unstructured":"Calvo, T., Beliakov, G.: Aggregation functions based on penalties. Fuzzy Sets Syst. 161, 1420\u20131436 (2010)","journal-title":"Fuzzy Sets Syst."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.fss.2016.09.011","volume":"323","author":"H Bustince","year":"2017","unstructured":"Bustince, H., Beliakov, G., Dimuro, G.P., Bedregal, B., Mesiar, R.: On the definition of penalty functions in data aggregation. Fuzzy Sets Syst. 323, 1\u201318 (2017)","journal-title":"Fuzzy Sets Syst."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/S0377-2217(98)00186-6","volume":"111","author":"SH Owen","year":"1998","unstructured":"Owen, S.H., Daskin, M.S.: Strategic facility location: a review. Eur. J. Oper. Res. 111, 423\u2013447 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/506147.506150","volume":"49","author":"M Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: On the closest string and substring problems. J. ACM 49(2), 157\u2013171 (2002)","journal-title":"J. ACM"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-540-78839-3_33","volume-title":"Research in Computational Molecular Biology","author":"B Ma","year":"2008","unstructured":"Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. In: Vingron, M., Wong, L. (eds.) Research in Computational Molecular Biology, pp. 396\u2013409. Springer, Berlin (2008)"},{"issue":"11","key":"20_CR14","doi-asserted-by":"publisher","first-page":"1442","DOI":"10.1287\/mnsc.20.11.1442","volume":"20","author":"PC Fishburn","year":"1974","unstructured":"Fishburn, P.C.: Lexicographic orders, utilities and decision rules: a survey. Manag. Sci. 20(11), 1442\u20131471 (1974)","journal-title":"Manag. Sci."},{"key":"20_CR15","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (2009)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Deza, M.M., Deza, E.: Encyclopedia of Distances. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-00234-2"},{"issue":"3","key":"20_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/363958.363994","volume":"7","author":"FJ Damerau","year":"1964","unstructured":"Damerau, F.J.: A technique for computer detection and correction of spelling errors. Commun. ACM 7(3), 171\u2013176 (1964)","journal-title":"Commun. ACM"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0167-8655(85)90061-3","volume":"3","author":"T Kohonen","year":"1985","unstructured":"Kohonen, T.: Median strings. Pattern Recogn. Lett. 3, 309\u2013313 (1985)","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1111\/j.1469-8137.1912.tb05611.x","volume":"11","author":"P Jaccard","year":"1912","unstructured":"Jaccard, P.: The distribution of the flora in the Alpine zone. New Phytol. 11(2), 37\u201350 (1912)","journal-title":"New Phytol."},{"key":"20_CR20","unstructured":"Jaro, M.A.: Advances in record-linkage methodology as applied to matching the 1985 census of Tampa, Florida. J. Am. Stat. Assoc. 84, 414\u2013420 (1989)"},{"key":"20_CR21","unstructured":"Winkler, W.E.: String comparator metrics and enhanced decision rules in the Fellegi-Sunter model of record linkage. In: Proceedings of the Section on Survey Research Methods of the American Statistical Association, pp. 354\u2013359 (1990)"}],"container-title":["Advances in Intelligent Systems and Computing","New Trends in Aggregation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19494-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T21:06:45Z","timestamp":1558040805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19494-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030194932","9783030194949"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19494-9_20","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"17 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AGOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Summer School on Aggregation Operators","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Olomouc","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"agop2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}