{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:01:15Z","timestamp":1774368075926,"version":"3.50.1"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030164683","type":"print"},{"value":"9783030164690","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16469-0_11","type":"book-chapter","created":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:56:12Z","timestamp":1559127372000},"page":"199-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Approaches for Solving the Large-Scale k-Medoids Problem: Towards Structured Data"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1730-5436","authenticated-orcid":false,"given":"Alessio","family":"Martino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8244-0015","authenticated-orcid":false,"given":"Antonello","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio Massimo","family":"Frattale Mascioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,30]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28, 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR2","unstructured":"MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In Cam, L.M.L., Neyman, J. (eds.) Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281\u2013297. University of California Press (1967)"},{"key":"11_CR3","unstructured":"Bradley, P.S., Mangasarian, O.L., Street, W.N.: Clustering via concave minimization. In: Proceedings of the 9th International Conference on Neural Information Processing Systems, NIPS\u201996, pp. 368\u2013374. MIT Press, Cambridge, MA, USA (1996)"},{"key":"11_CR4","unstructured":"Kaufman, L., Rousseeuw, P.J.: Clustering by means of medoids. In: Statistical Data Analysis Based on the L1-Norm and Related Methods (1987)"},{"key":"11_CR5","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, vol. 96, pp. 226\u2013231 (1996)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: Optics: ordering points to identify the clustering structure. In: Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201999, pp. 49\u201360. ACM, New York, NY, USA (1999)","DOI":"10.1145\/304182.304187"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201996, pp. 103\u2013114. ACM, New York, NY, USA (1996)","DOI":"10.1145\/233269.233324"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/276305.276312","volume":"27","author":"S Guha","year":"1998","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. SIGMOD Rec. 27, 73\u201384 (1998)","journal-title":"SIGMOD Rec."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM 51, 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"11_CR10","first-page":"95","volume":"10","author":"M Zaharia","year":"2010","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I.: Spark: cluster computing with working sets. HotCloud 10, 95 (2010)","journal-title":"HotCloud"},{"key":"11_CR11","first-page":"1","volume":"17","author":"X Meng","year":"2016","unstructured":"Meng, X., Bradley, J., Yavuz, B., Sparks, E., Venkataraman, S., Liu, D., Freeman, J., Tsai, D., Amde, M., Owen, S., et al.: MLlib: machine learning in apache spark. J. Mach. Learn. Res. 17, 1\u20137 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Martino, A., Rizzi, A., Frattale\u00a0Mascioli, F.M.: Efficient approaches for solving the large-scale k-medoids problem. In: Proceedings of the 9th International Joint Conference on Computational Intelligence\u2014Volume 1: IJCCI, INSTICC, pp. 338\u2013347. SciTePress (2017)","DOI":"10.5220\/0006515003380347"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-642-10665-1_71","volume-title":"Cloud Computing","author":"W Zhao","year":"2009","unstructured":"Zhao, W., Ma, H., He, Q.: Parallel k-means clustering based on mapreduce. In: Jaatun, M.G., Zhao, G., Rong, C. (eds.) Cloud Computing, pp. 674\u2013679. Springer, Berlin, Heidelberg (2009)"},{"key":"11_CR14","unstructured":"Yue, X., Man, W., Yue, J., Liu, G.: Parallel k-medoids++ spatial clustering algorithm based on mapreduce (2016). arXiv:1608.06861"},{"key":"11_CR15","unstructured":"Arbelaez, A., Quesada, L.: Parallelising the k-medoids clustering problem using space-partitioning. In: Sixth Annual Symposium on Combinatorial Search (2013)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Jiang, Y., Zhang, J.: Parallel k-medoids clustering algorithm based on Hadoop. In: 2014 5th IEEE International Conference on Software Engineering and Service Science (ICSESS), pp. 649\u2013652. IEEE (2014)","DOI":"10.1109\/ICSESS.2014.6933652"},{"key":"11_CR17","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis, vol. 344. Wiley (2009)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Martino, A., Rizzi, A., Mascioli, F. M. F.: Distance matrix pre-caching and distributed computation of internal validation indices in k-medoids clustering. In: 2018 International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138. IEEE (2018)","DOI":"10.1109\/IJCNN.2018.8489101"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","volume":"36","author":"HS Park","year":"2009","unstructured":"Park, H.S., Jun, C.H.: A simple and fast algorithm for k-medoids clustering. Expert Syst. Appl. 36, 3336\u20133341 (2009)","journal-title":"Expert Syst. Appl."},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.7763\/IJCTE.2014.V6.827","volume":"6","author":"G Del Vescovo","year":"2014","unstructured":"Del Vescovo, G., Livi, L., Frattale Mascioli, F.M., Rizzi, A.: On the problem of modeling structured data with the minsod representative. Int. J. Comput. Theory Eng. 6, 9 (2014)","journal-title":"Int. J. Comput. Theory Eng."},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-89629-8_3","volume-title":"Computational Intelligence for Pattern Recognition","author":"A Martino","year":"2018","unstructured":"Martino, A., Giuliani, A., Rizzi, A.: Granular computing techniques for bioinformatics pattern recognition problems in non-metric spaces. In: Pedrycz, W., Chen, S.M. (eds.) Computational Intelligence for Pattern Recognition, pp. 53\u201381. Springer International Publishing, Cham (2018)"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of euclidean sum-of-squares clustering. Mach. Learn. 75, 245\u2013248 (2009)","journal-title":"Mach. Learn."},{"key":"11_CR23","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027\u20131035. Society for Industrial and Applied Mathematics (2007)"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s10044-014-0440-4","volume":"3","author":"FM Bianchi","year":"2016","unstructured":"Bianchi, F.M., Livi, L., Rizzi, A.: Two density-based k-means initialization algorithms for non-metric data clustering. Pattern Anal. Appl. 3, 745\u2013763 (2016)","journal-title":"Pattern Anal. Appl."},{"key":"11_CR25","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauley, M., Franklin, M.J., Shenker, S., Stoica, I.: Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In: Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation, pp. 2\u20132. USENIX Association (2012)"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02289263","volume":"18","author":"RL Thorndike","year":"1953","unstructured":"Thorndike, R.L.: Who belongs in the family? Psychometrika 18, 267\u2013276 (1953)","journal-title":"Psychometrika"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10044-012-0284-8","volume":"16","author":"L Livi","year":"2013","unstructured":"Livi, L., Rizzi, A.: The graph matching problem. Pattern Anal. Appl. 16, 253\u2013283 (2013)","journal-title":"Pattern Anal. Appl."},{"key":"11_CR28","unstructured":"Livi, L., Del\u00a0Vescovo, G., Rizzi, A.: Graph recognition by seriation and frequent substructures mining. In: ICPRAM 2012\u2014Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods, vol.\u00a01, pp. 186\u2013191 (2012)"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCSE.2011.37","volume":"13","author":"S van der Walt","year":"2011","unstructured":"van der Walt, S., Colbert, S.C., Varoquaux, G.: The NumPy array: a structure for efficient numerical computation. Comput. Sci. Eng. 13, 22\u201330 (2011)","journal-title":"Comput. Sci. Eng."},{"key":"11_CR30","unstructured":"Jones, E., Oliphant, T., Peterson, P., et\u00a0al.: SciPy: open source scientific tools for Python (2001). Accessed 13 Mar 2018"},{"key":"11_CR31","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/MCSE.2011.36","volume":"13","author":"KJ Millman","year":"2011","unstructured":"Millman, K.J., Aivazis, M.: Python for scientists and engineers. Comput. Sci. Eng. 13, 9\u201312 (2011)","journal-title":"Comput. Sci. Eng."},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Oliphant, T.E.: Python for scientific computing. Comput. Sci. Eng. 9 (2007)","DOI":"10.1109\/MCSE.2007.58"},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1093\/bioinformatics\/btt547","volume":"29","author":"T Cokelaer","year":"2013","unstructured":"Cokelaer, T., Pultz, D., Harder, L.M., Serra-Musach, J., Saez-Rodriguez, J.: Bioservices: a common Python package to access biological web services programmatically. Bioinformatics 29, 3241\u20133242 (2013)","journal-title":"Bioinformatics"},{"key":"11_CR34","doi-asserted-by":"publisher","first-page":"D353","DOI":"10.1093\/nar\/gkw1092","volume":"45","author":"M Kanehisa","year":"2016","unstructured":"Kanehisa, M., Furumichi, M., Tanabe, M., Sato, Y., Morishima, K.: KEGG: new perspectives on genomes, pathways, diseases and drugs. Nucleic Acids Res. 45, D353\u2013D361 (2016)","journal-title":"Nucleic Acids Res."},{"key":"11_CR35","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1093\/nar\/28.1.27","volume":"28","author":"M Kanehisa","year":"2000","unstructured":"Kanehisa, M., Goto, S.: KEGG: kyoto encyclopedia of genes and genomes. Nucleic Acids Res. 28, 27\u201330 (2000)","journal-title":"Nucleic Acids Res."},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"D457","DOI":"10.1093\/nar\/gkv1070","volume":"44","author":"M Kanehisa","year":"2015","unstructured":"Kanehisa, M., Sato, Y., Kawashima, M., Furumichi, M., Tanabe, M.: KEGG as a reference resource for gene and protein annotation. Nucleic Acids Res. 44, D457\u2013D462 (2015)","journal-title":"Nucleic Acids Res."},{"key":"11_CR37","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1186\/1471-2105-7-24","volume":"7","author":"K Tun","year":"2006","unstructured":"Tun, K., Dhar, P.K., Palumbo, M.C., Giuliani, A.: Metabolic pathways variability and sequence\/networks comparisons. BMC Bioinform. 7, 24 (2006)","journal-title":"BMC Bioinform."},{"key":"11_CR38","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 Labs Tech. J. 29, 147\u2013160 (1950)","journal-title":"Bell Labs Tech. J."},{"key":"11_CR39","doi-asserted-by":"publisher","first-page":"28","DOI":"10.2174\/138920308783565705","volume":"9","author":"A Giuliani","year":"2008","unstructured":"Giuliani, A., Krishnan, A., Zbilut, J.P., Tomita, M.: Proteins as networks: usefulness of graph theory in protein science. Curr. Protein Pept. Sci. 9, 28\u201338 (2008)","journal-title":"Curr. Protein Pept. Sci."},{"key":"11_CR40","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1021\/cr3002356","volume":"113","author":"L Di Paola","year":"2012","unstructured":"Di Paola, L., De Ruvo, M., Paci, P., Santoni, D., Giuliani, A.: Protein contact networks: an emerging paradigm in chemistry. Chem. Rev. 113, 1598\u20131613 (2012)","journal-title":"Chem. Rev."},{"key":"11_CR41","doi-asserted-by":"publisher","first-page":"106","DOI":"10.2174\/1574893611666151109175216","volume":"11","author":"L Livi","year":"2016","unstructured":"Livi, L., Giuliani, A., Sadeghian, A.: Characterization of graphs for protein structure modeling and recognition of solubility. Curr. Bioinform. 11, 106\u2013114 (2016)","journal-title":"Curr. Bioinform."},{"key":"11_CR42","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1080\/07391102.2015.1077736","volume":"34","author":"L Livi","year":"2016","unstructured":"Livi, L., Maiorino, E., Giuliani, A., Rizzi, A., Sadeghian, A.: A generative model for protein contact networks. J. Biomol. Struct. Dyn. 34, 1441\u20131454 (2016)","journal-title":"J. Biomol. Struct. Dyn."},{"key":"11_CR43","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1016\/j.physa.2016.12.046","volume":"471","author":"E Maiorino","year":"2017","unstructured":"Maiorino, E., Rizzi, A., Sadeghian, A., Giuliani, A.: Spectral reconstruction of protein contact networks. Phys. A Stat. Mech. Appl. 471, 804\u2013817 (2017)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"11_CR44","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-59126-1_24","volume-title":"Image Analysis","author":"A Martino","year":"2017","unstructured":"Martino, A., Maiorino, E., Giuliani, A., Giampieri, M., Rizzi, A.: Supervised approaches for function prediction of proteins contact networks from topological structure information. In: Sharma, P., Bianchi, F.M. (eds.) Image Analysis, pp. 285\u2013296. Springer International Publishing, Cham (2017)"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Martino, A., Rizzi, A., Mascioli, F. M. F.: Supervised approaches for protein function prediction by topological data analysis. In: 2018 International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138. IEEE (2018)","DOI":"10.1109\/IJCNN.2018.8489307"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"De Santis, E., Martino, A., Rizzi, A., Mascioli, F. M. F.: Dissimilarity space representations and automatic feature selection for protein function prediction. In: 2018 International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138. IEEE (2018)","DOI":"10.1109\/IJCNN.2018.8489115"},{"key":"11_CR47","doi-asserted-by":"publisher","first-page":"D158","DOI":"10.1093\/nar\/gkw1099","volume":"45","author":"The UniProt Consortium","year":"2017","unstructured":"The UniProt Consortium: UniProt: the universal protein knowledgebase. Nucleic Acids Res. 45, D158\u2013D169 (2017)","journal-title":"Nucleic Acids Res."},{"key":"11_CR48","unstructured":"Levenshtein, V.I.: Binary Codes Capable of Correcting Deletions, Insertions, and Reversals, vol. 10, pp. 707\u2013710. Soviet Physics Doklady (1966)"},{"key":"11_CR49","unstructured":"Cinti, A., Bianchi, F. M., Martino, A., & Rizzi, A. (2017). A novel algorithm for online inexact string matching and its FPGA implementation. arXiv preprint arXiv:1712.03560"}],"container-title":["Studies in Computational Intelligence","Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16469-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T14:05:18Z","timestamp":1697119518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-16469-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030164683","9783030164690"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16469-0_11","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Computational Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Funchal-Madeira","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcci2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}