{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T02:32:55Z","timestamp":1773541975660,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642374555","type":"print"},{"value":"9783642374562","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37456-2_10","type":"book-chapter","created":{"date-parts":[[2013,4,5]],"date-time":"2013-04-05T07:14:37Z","timestamp":1365146077000},"page":"111-122","source":"Crossref","is-referenced-by-count":5,"title":["A New, Fast and Accurate Algorithm for Hierarchical Clustering on Euclidean Distances"],"prefix":"10.1007","author":[{"given":"Elio","family":"Masciari","sequence":"first","affiliation":[]},{"given":"Giuseppe Massimiliano","family":"Mazzeo","sequence":"additional","affiliation":[]},{"given":"Carlo","family":"Zaniolo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/304181.304187","volume":"28","author":"M. Ankerst","year":"1999","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: Optics: Ordering points to identify the clustering structure. SIGMOD Record\u00a028(2), 49\u201360 (1999)","journal-title":"SIGMOD Record"},{"key":"10_CR2","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: SODA, pp. 1027\u20131035 (2007)"},{"key":"10_CR3","unstructured":"Ben-David, S., Ackerman, M.: Measures of clustering quality: A working set of axioms for clustering. In: NIPS, pp. 121\u2013128 (2008)"},{"issue":"15","key":"10_CR4","doi-asserted-by":"publisher","first-page":"2883","DOI":"10.1016\/S0167-8655(03)00146-6","volume":"24","author":"Y.M. Cheung","year":"2003","unstructured":"Cheung, Y.M.: k*-means: A new generalized k-means clustering algorithm. Pattern Recognition Letters\u00a024(15), 2883\u20132893 (2003)","journal-title":"Pattern Recognition Letters"},{"issue":"9","key":"10_CR5","first-page":"2073","volume":"121","author":"L.S. Einbond","year":"2007","unstructured":"Einbond, L.S., Su, T., Wu, H., Friedman, R., Wang, X., Ramirez, A., Kronenberg, F., Weinstein, I.B.: The growth inhibitory effect of actein on human breast cancer cells is associated with activation of stress response pathways. I. J. of Cancer\u00a0121(9), 2073\u20132083 (2007)","journal-title":"I. J. of Cancer"},{"key":"10_CR6","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD (1996)"},{"issue":"2","key":"10_CR7","first-page":"160","volume":"17","author":"S. Flesca","year":"2005","unstructured":"Flesca, S., Manco, G., Masciari, E., Pontieri, L., Pugliese, A.: Fast detection of xml structural similarity. TKDE\u00a017(2), 160\u2013175 (2005)","journal-title":"TKDE"},{"issue":"8","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1038\/sj.bjc.6605576","volume":"102","author":"K. Graham","year":"2010","unstructured":"Graham, K., De Las Morenas, A., Tripathi, A., King, C., Kavanah, M., Mendez, J., Stone, M., Slama, J., Miller, M., Antoine, G., Willers, H., Sebastiani, P., Rosenberg, C.L.: Gene expression in histologically normal epithelium from breast cancer patients and from cancer-free prophylactic mastectomy patients shares a similar profile. Br. J. Cancer\u00a0102(8), 1284\u20131293 (2010)","journal-title":"Br. J. Cancer"},{"key":"10_CR9","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann (2000)"},{"key":"10_CR10","unstructured":"MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: 5-th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281\u2013297 (1967)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rabani, Y., Schulman, L.J., Swamy, C.: The effectiveness of lloyd-type methods for the k-means problem. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.75"},{"issue":"9","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1109\/TPAMI.2005.187","volume":"27","author":"C.J. Veenman","year":"2005","unstructured":"Veenman, C.J., Reinders, M.J.T.: The nearest subclass classifier: A compromise between the nearest mean and nearest neighbor classifier. IEEE Trans. Pattern Anal. Mach. Intell.\u00a027(9), 1417\u20131429 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10_CR13","unstructured":"Wang, W., Yang, J., Muntz, R.R.: Sting: A statistical information grid approach to spatial data mining. In: VLDB, pp. 186\u2013195 (1997)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: Birch: An efficient data clustering method for very large databases. In: SIGMOD, pp. 103\u2013114 (1996)","DOI":"10.1145\/235968.233324"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37456-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T23:53:34Z","timestamp":1557618814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37456-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374555","9783642374562"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37456-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}