{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:17Z","timestamp":1725558497854},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135286"},{"type":"electronic","value":"9783642135293"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13529-3_7","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T19:01:53Z","timestamp":1277319713000},"page":"50-59","source":"Crossref","is-referenced-by-count":14,"title":["Distance Based Fast Hierarchical Clustering Method for Large Datasets"],"prefix":"10.1007","author":[{"given":"Bidyut Kr.","family":"Patra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neminath","family":"Hubballi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santosh","family":"Biswas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sukumar","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. John Wiley & Sons, Inc., New York (1975)"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Computing Surveys"},{"key":"7_CR3","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 ACM SIGMOD, pp. 49\u201360 (1999)","DOI":"10.1145\/304182.304187"},{"key":"7_CR4","volume-title":"Numerical Taxonomy","author":"A. Sneath","year":"1973","unstructured":"Sneath, A., Sokal, P.H.: Numerical Taxonomy. Freeman, London (1973)"},{"issue":"317","key":"7_CR5","doi-asserted-by":"publisher","first-page":"86","DOI":"10.2307\/2282912","volume":"62","author":"B. King","year":"1967","unstructured":"King, B.: Step-Wise Clustering Procedures. Journal of the American Statistical Association\u00a062(317), 86\u2013101 (1967)","journal-title":"Journal of the American Statistical Association"},{"key":"7_CR6","first-page":"101","volume":"1","author":"F. Murtagh","year":"1984","unstructured":"Murtagh, F.: Complexities of hierarchic clustering algorithms: state of the art. Computational Statistics Quarterly\u00a01, 101\u2013113 (1984)","journal-title":"Computational Statistics Quarterly"},{"key":"7_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, pp. 103\u2013114 (1996)","DOI":"10.1145\/233269.233324"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0169-023X(02)00138-6","volume":"44","author":"M. Dash","year":"2003","unstructured":"Dash, M., Liu, H., Scheuermann, P., Tan, K.L.: Fast hierarchical clustering and its validation. Data Knowl. Eng.\u00a044(1), 109\u2013138 (2003)","journal-title":"Data Knowl. Eng."},{"key":"7_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/11430919_45","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Nanni","year":"2005","unstructured":"Nanni, M.: Speeding-up hierarchical agglomerative clustering in presence of expensive metrics. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 378\u2013387. Springer, Heidelberg (2005)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10115-006-0027-5","volume":"12","author":"H. Koga","year":"2007","unstructured":"Koga, H., Ishibashi, T., Watanabe, T.: Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing. Knowledge and Information Systems\u00a012(1), 25\u201353 (2007)","journal-title":"Knowledge and Information Systems"},{"issue":"16","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1016\/j.patrec.2009.08.008","volume":"30","author":"P. Viswanath","year":"2009","unstructured":"Viswanath, P., Babu, V.: Rough-dbscan: a fast hybrid density based clustering method for latge data sets. Pattern Recognition Letters\u00a030(16), 1477\u20131488 (2009)","journal-title":"Pattern Recognition Letters"},{"key":"7_CR12","series-title":"LNAI","first-page":"414","volume-title":"RSFDGrC 2009","author":"B.K. Patra","year":"2009","unstructured":"Patra, B.K., Nandi, S.: A Fast Single Link Clustering Method Based on Tolerance Rough Set Model. In: Sakai, H., et al. (eds.) RSFDGrC 2009. LNCS (LNAI), vol.\u00a05908, pp. 414\u2013422. Springer, Heidelberg (2009)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/0167-8191(95)00017-I","volume":"21","author":"C.F. Olson","year":"1995","unstructured":"Olson, C.F.: Parallel algorithms for hierarchical clustering. Parallel Computing\u00a021, 1313\u20131325 (1995)","journal-title":"Parallel Computing"},{"key":"7_CR14","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: ICML, pp. 147\u2013153 (2003)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Nassar, S., Sander, J., Cheng, C.: Incremental and effective data summarization for dynamic hierarchical clustering. In: Proceedings of SIGMOD Conference, pp. 467\u2013478 (2004)","DOI":"10.1145\/1007568.1007621"},{"issue":"336","key":"7_CR16","doi-asserted-by":"publisher","first-page":"846","DOI":"10.2307\/2284239","volume":"66","author":"W.M. Rand","year":"1971","unstructured":"Rand, W.M.: Objective Criteria for Evaluation of Clustering Methods. Journal of American Statistical Association\u00a066(336), 846\u2013850 (1971)","journal-title":"Journal of American Statistical Association"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Current Trends in Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13529-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:06:37Z","timestamp":1619784397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13529-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135286","9783642135293"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13529-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}