{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T08:58:04Z","timestamp":1773046684799,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,1,15]],"date-time":"2015-01-15T00:00:00Z","timestamp":1421280000000},"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":["Pattern Anal Applic"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10044-014-0440-4","type":"journal-article","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T07:00:36Z","timestamp":1421218836000},"page":"745-763","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Two density-based k-means initialization algorithms for non-metric data clustering"],"prefix":"10.1007","volume":"19","author":[{"given":"Filippo Maria","family":"Bianchi","sequence":"first","affiliation":[]},{"given":"Lorenzo","family":"Livi","sequence":"additional","affiliation":[]},{"given":"Antonello","family":"Rizzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,15]]},"reference":[{"key":"440_CR1","unstructured":"Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms., SODA \u201907Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp 1027\u20131035"},{"key":"440_CR2","unstructured":"Bache K, Lichman M (2013) UCI Machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"440_CR3","doi-asserted-by":"crossref","unstructured":"Bardaji I, Ferrer M, Sanfeliu A (2010) A comparison between two representatives of a set of graphs: median vs. barycenter graph. In: Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition, SSPR&SPR\u201910. Springer, Berlin, pp 149\u2013158","DOI":"10.1007\/978-3-642-14980-1_14"},{"issue":"2","key":"440_CR4","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00500-013-1065-z","volume":"18","author":"FM Bianchi","year":"2014","unstructured":"Bianchi FM, Livi L, Rizzi A, Sadeghian A (2014) A Granular Computing approach to the design of optimized graph classification systems. Soft Comput 18(2):393\u2013412. doi: 10.1007\/s00500-013-1065-z","journal-title":"Soft Comput"},{"issue":"6","key":"440_CR5","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1109\/TPAMI.2012.226","volume":"35","author":"SR Bul\u00f2","year":"2013","unstructured":"Bul\u00f2 SR, Pelillo M (2013) A game-theoretic approach to hypergraph clustering. IEEE Trans Pattern Anal Machine Intell 35(6):1312\u20131327","journal-title":"IEEE Trans Pattern Anal Machine Intell"},{"issue":"4","key":"440_CR6","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R Cilibrasi","year":"2005","unstructured":"Cilibrasi R, Vit\u00e1nyi PMB (2005) Clustering by compression. IEEE Trans Inf Theory 51(4):1523\u20131545","journal-title":"IEEE Trans Inf Theory"},{"key":"440_CR7","doi-asserted-by":"publisher","unstructured":"Del Vescovo G, Livi L, Frattale Mascioli FM, Rizzi A (2014) On the problem of modeling structured data with the MinSOD representative. Int J Comput Theory Eng 6(1):9\u201314. doi: 10.7763\/IJCTE.2014.V6.827","DOI":"10.7763\/IJCTE.2014.V6.827"},{"key":"440_CR8","doi-asserted-by":"crossref","unstructured":"Duin RPW, Fred ALN, Loog M, P\u0119kalska E (2012) Mode seeking clustering by KNN and mean shift evaluated. In: Gimel\u2019farb G, Hancock E, Imiya A, Kuijper A, Kudo M, Omachi S, Windeatt T, Yamada K (eds) Structural, syntactic, and statistical pattern recognition, LNCS, vol. 7626. Springer, Berlin, pp 51\u201359. doi:10.1007\/978-3-642-34166-3\\_6","DOI":"10.1007\/978-3-642-34166-3"},{"key":"440_CR9","doi-asserted-by":"crossref","unstructured":"Duin RPW, P\u0119kalska E (2010) Non-Euclidean dissimilarities: causes and informativeness. In: Proceedings of the 2010 joint IAPR international conference on structural, syntactic, and statistical pattern recognition. Springer, Berlin, pp 324\u2013333","DOI":"10.1007\/978-3-642-14980-1_31"},{"key":"440_CR10","doi-asserted-by":"crossref","unstructured":"Duin RPW, P\u0119kalska E, Harol A, Lee WJ, Bunke H (2008) On Euclidean corrections for non-Euclidean dissimilarities. In: Vitoria Lobo N, Kasparis T, Roli F, Kwok J, Georgiopoulos M, Anagnostopoulos G, Loog M (eds) Structural, syntactic, and statistical pattern recognition, vol. 5342, LNCS. Springer, Berlin, pp 551\u2013561. doi:10.1007\/978-3-540-89689-0\\_59","DOI":"10.1007\/978-3-540-89689-0"},{"key":"440_CR11","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. KDD 96:226\u2013231","journal-title":"KDD"},{"issue":"2","key":"440_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.ijar.2008.08.006","volume":"50","author":"M Filippone","year":"2009","unstructured":"Filippone M (2009) Dealing with non-metric dissimilarities in Fuzzy central clustering algorithms. Int J Approx Reas 50(2):363\u2013384. doi: 10.1016\/j.ijar.2008.08.006","journal-title":"Int J Approx Reas"},{"issue":"1","key":"440_CR13","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.patcog.2007.05.018","volume":"41","author":"M Filippone","year":"2008","unstructured":"Filippone M, Camastra F, Masulli F, Rovetta S (2008) A survey of kernel and spectral methods for clustering. Pattern Recognit 41(1):176\u2013190","journal-title":"Pattern Recognit"},{"key":"440_CR14","doi-asserted-by":"publisher","unstructured":"Mascioli Frattale FM, Rizzi A, Panella M, Martinelli G (2000) Scale-based approach to hierarchical fuzzy clustering. Signal Process 80(6):1001\u20131016. doi: 10.1016\/S0165-1684(00)00016-5","DOI":"10.1016\/S0165-1684(00)00016-5"},{"key":"440_CR15","doi-asserted-by":"crossref","unstructured":"Hinneburg A, Gabriel HH (2007) Denclue 2.0: fast clustering based on kernel density estimation. In: Advances in intelligent data analysis VII. Springer, Berlin, pp 70\u201380","DOI":"10.1007\/978-3-540-74825-0_7"},{"issue":"8","key":"440_CR16","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recognit Lett 31(8):651\u2013666. doi: 10.1016\/j.patrec.2009.09.011","journal-title":"Pattern Recognit Lett"},{"key":"440_CR17","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1109\/34.954604","volume":"23","author":"X Jiang","year":"2001","unstructured":"Jiang X, M\u00fcunger A, Bunke H (2001) On median graphs: properties, algorithms, and applications. IEEE Trans Pattern Anal Mach Intell 23:1144\u20131151. doi: 10.1109\/34.954604","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"440_CR18","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R Kannan","year":"2004","unstructured":"Kannan R, Vempala S, Vetta A (2004) On clusterings: Good, bad, and spectral. J ACM (JACM) 51:497\u2013515","journal-title":"J ACM (JACM)"},{"key":"440_CR19","doi-asserted-by":"publisher","unstructured":"Kriegel HP, Kr\u00f6ger P, Zimek A (2009) Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans Knowl Dis Data 3(1):1:1\u20131:58. doi: 10.1145\/1497577.1497578","DOI":"10.1145\/1497577.1497578"},{"key":"440_CR20","doi-asserted-by":"publisher","unstructured":"Livi L, Bianchi FM, Rizzi A, Sadeghian A (2013) Dissimilarity space embedding of labeled graphs by a clustering-based compression procedure. In: Proceedings of the 2013 international joint conference on neural networks, pp 1646\u20131653. doi: 10.1109\/IJCNN.2013.6706937","DOI":"10.1109\/IJCNN.2013.6706937"},{"key":"440_CR21","doi-asserted-by":"publisher","first-page":"186","DOI":"10.5220\/0003733201860191","volume":"1","author":"L Livi","year":"2012","unstructured":"Livi L, Del Vescovo G, Rizzi A (2012) Graph Recognition by Seriation and Frequent Substructures Mining. Proc First Int Conf Pattern Recognit Appl Methods 1:186\u2013191. doi: 10.5220\/0003733201860191","journal-title":"Proc First Int Conf Pattern Recognit Appl Methods"},{"key":"440_CR22","doi-asserted-by":"crossref","unstructured":"Livi L, Del Vescovo G, Rizzi A (2013) Combining graph seriation and substructures mining for graph recognition. In: Latorre Carmona P, S\u00e1nchez JS, Fred ALN (eds) Pattern recognition\u2014applications and methods. Advances in intelligent and soft computing, vol 204. Springer, Berlin, pp 79\u201391. doi:10.1007\/978-3-642-36530-0\\_7","DOI":"10.1007\/978-3-642-36530-0"},{"key":"440_CR23","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.fss.2013.01.001","volume":"221","author":"L Livi","year":"2013","unstructured":"Livi L, Rizzi A (2013) Graph ambiguity. Fuzzy Sets Syst 221:24\u201347. doi: 10.1016\/j.fss.2013.01.001","journal-title":"Fuzzy Sets Syst"},{"issue":"3","key":"440_CR24","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 (2013) The graph matching problem. Pattern Anal Appl 16(3):253\u2013283. doi: 10.1007\/s10044-012-0284-8","journal-title":"Pattern Anal Appl"},{"key":"440_CR25","unstructured":"Livi L, Del Vescovo G, Rizzi A, Frattale Mascioli FM (2014) Building pattern recognition applications with the SPARE library. arXiv:1410.5263"},{"key":"440_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ins.2014.01.005","volume":"266","author":"L Livi","year":"2014","unstructured":"Livi L, Rizzi A, Sadeghian A (2014) Optimized dissimilarity space embedding for labeled graphs. Inf Sci 266:47\u201364. doi: 10.1016\/j.ins.2014.01.005","journal-title":"Inf Sci"},{"key":"440_CR27","doi-asserted-by":"publisher","unstructured":"Livi L, Tahayori H, Sadeghian A, Rizzi A (2013) Aggregating $$\\alpha$$ \u03b1 -planes for Type-2 fuzzy set matching. In: 2013 Joint IFSA World Congress and NAFIPS annual meeting (IFSA\/NAFIPS), pp 860\u2013865 (2013). doi: 10.1109\/IFSA-NAFIPS.2013.6608513","DOI":"10.1109\/IFSA-NAFIPS.2013.6608513"},{"issue":"2","key":"440_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd S (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013137. doi: 10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans Inf Theory"},{"key":"440_CR29","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.neucom.2013.01.015","volume":"113","author":"MA Lozano","year":"2013","unstructured":"Lozano MA, Escolano F (2013) Graph matching and clustering using kernel attributes. Neurocomputing 113:177\u2013194. doi: 10.1016\/j.neucom.2013.01.015","journal-title":"Neurocomputing"},{"key":"440_CR30","doi-asserted-by":"publisher","unstructured":"Ostrovsky R, Rabani Y, Schulman L, Swamy C (2006) The effectiveness of Lloyd-type methods for the k-means problem. In: FOCS \u201906. 47th annual IEEE symposium on foundations of computer science, pp 165\u2013176. doi: 10.1109\/FOCS.2006.75","DOI":"10.1109\/FOCS.2006.75"},{"issue":"3","key":"440_CR31","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","volume":"33","author":"E Parzen","year":"1962","unstructured":"Parzen E (1962) On estimation of a probability density function and mode. Ann Math Stat 33(3):1065\u20131076","journal-title":"Ann Math Stat"},{"key":"440_CR32","doi-asserted-by":"crossref","unstructured":"Pekalska E, Duin RPW (2005) The dissimilarity representation for pattern recognition: foundations and applications. In: Series in machine perception and artificial intelligence. World Scientific, Singapore","DOI":"10.1142\/5965"},{"key":"440_CR33","doi-asserted-by":"crossref","unstructured":"Pekalska E, Harol A, Duin RPW, Spillmann B, Bunke H (2006) Non-Euclidean or non-metric measures can be informative. In: Yeung DY, Kwok J, Fred ALN, Roli F, Ridder D (eds) Structural, syntactic, and statistical pattern recognition, LNCS, vol 4109. Springer, Berlin, pp 871\u2013880. doi:10.1007\/11815921\\_96","DOI":"10.1007\/11815921"},{"key":"440_CR34","doi-asserted-by":"crossref","unstructured":"Riesen K, Bunke H (2008) IAM graph database repository for graph based pattern recognition and machine learning. In: Proceedings of the 2008 joint IAPR international workshop on structural, syntactic, and statistical pattern recognition. Springer, Berlin, pp 287\u2013297. doi:10.1007\/978-3-540-89689-0\\_33","DOI":"10.1007\/978-3-540-89689-0"},{"key":"440_CR35","doi-asserted-by":"publisher","unstructured":"Rizzi A, Del Vescovo G, Livi L, Frattale Mascioli FM (2012) A new granular computing approach for sequences representation and classification. In: Proceedings of the 2012 international joint conference on neural networks, pp 2268\u20132275. doi: 10.1109\/IJCNN.2012.6252680","DOI":"10.1109\/IJCNN.2012.6252680"},{"key":"440_CR36","doi-asserted-by":"crossref","unstructured":"Rizzi A, Livi L, Tahayori H, Sadeghian A (2013) Matching general type-2 fuzzy sets by comparing the vertical slices. In: 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA\/NAFIPS), pp 866\u2013871. doi:10.1109\/IFSA-NAFIPS.2013.6608514","DOI":"10.1109\/IFSA-NAFIPS.2013.6608514"},{"issue":"12","key":"440_CR37","doi-asserted-by":"publisher","first-page":"1540","DOI":"10.1109\/TPAMI.2003.1251147","volume":"25","author":"V Roth","year":"2003","unstructured":"Roth V, Laub J, Kawanabe M, Buhmann J (2003) Optimal cluster preserving embedding of nonmetric proximity data. IEEE Trans Pattern Anal Mach Intell 25(12):1540\u20131551. doi: 10.1109\/TPAMI.2003.1251147","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"440_CR38","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw PJ (1987) Silhouettes: A graphical aid to the interpretation and validation of cluster analysis. J Comput Appl Math 20:53\u201365. doi: 10.1016\/0377-0427(87)90125-7","journal-title":"J Comput Appl Math"},{"key":"440_CR39","unstructured":"Theodoridis S, Koutroumbas K (2008) Pattern recognition, 4th edn. Elsevier\/Academic Press, Amsterdam"},{"issue":"12","key":"440_CR40","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1109\/TPAMI.2005.237","volume":"27","author":"A Topchy","year":"2005","unstructured":"Topchy A, Jain AK, Punch W (2005) Clustering ensembles: models of consensus and weak partitions. IEEE Trans Pattern Anal Mach Intell 27(12):1866\u20131881. doi: 10.1109\/TPAMI.2005.237","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"4","key":"440_CR41","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/sam.v3:4","volume":"3","author":"L Vendramin","year":"2010","unstructured":"Vendramin L, Campello RJGB, Hruschka ER (2010) Relative clustering validity criteria: a comparative overview. Stat Anal Data Min 3(4):209\u2013235. doi: 10.1002\/sam.v3:4","journal-title":"Stat Anal Data Min"},{"issue":"8","key":"440_CR42","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1109\/21.299710","volume":"24","author":"RR Yager","year":"1994","unstructured":"Yager RR, Filev DP (1994) Approximate clustering via the mountain method. IEEE Trans Syst Man Cybern 24(8):1279\u20131284","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"440_CR43","unstructured":"Yu XG, Jian Y (2005) A new clustering algorithm based on knn and denclue. In: Proceedings of 2005 international conference on machine learning and cybernetics, vol 4. IEEE, New York, pp 2033\u20132038"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-014-0440-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-014-0440-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-014-0440-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T18:07:57Z","timestamp":1566238077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-014-0440-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,15]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["440"],"URL":"https:\/\/doi.org\/10.1007\/s10044-014-0440-4","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,15]]}}}