{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T18:57:13Z","timestamp":1703185033586},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,11,30]],"date-time":"2013-11-30T00:00:00Z","timestamp":1385769600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10115-013-0709-8","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T05:08:38Z","timestamp":1385701718000},"page":"1-20","source":"Crossref","is-referenced-by-count":8,"title":["Effective data summarization for hierarchical clustering in large datasets"],"prefix":"10.1007","volume":"42","author":[{"given":"Bidyut Kr.","family":"Patra","sequence":"first","affiliation":[]},{"given":"Sukumar","family":"Nandi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,30]]},"reference":[{"issue":"2","key":"709_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/304181.304187","volume":"28","author":"M Ankerst","year":"1999","unstructured":"Ankerst M, Breunig MM, Kriegel HP, Sander J (1999) OPTICS: ordering points to identify the clustering structure. SIGMOD Rec 28(2):49\u201360","journal-title":"SIGMOD Rec"},{"issue":"9","key":"709_CR2","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1016\/j.patcog.2008.11.021","volume":"42","author":"VS Babu","year":"2009","unstructured":"Babu VS, Viswanath P (2009) Rough-fuzzy weighted k-nearest leader classifier for large data sets. Pattern Recognit 42(9):1719\u20131731","journal-title":"Pattern Recognit"},{"key":"709_CR3","unstructured":"Bradley PS, Fayyad UM, Reina C (1998) Scaling clustering algorithms to large databases. In: Agrawal R, Stolorz P, Piatetsky-Shapiro G (eds) Proceedings of the fourth international conference on knowledge discovery and data mining (KDD-98). New York City, New York, USA, August, pp 9\u201315"},{"key":"709_CR4","doi-asserted-by":"crossref","unstructured":"Breunig MM, Kriegel H-P, Krger P, Sander J (2001) Data bubbles: quality preserving performance boosting for hierarchical clustering. In: Mehrotra S, Sellis T (eds) Proceedings of the 2001 ACM SIGMOD international conference on management of data. Santa Barbara, CA, USA, May, pp 79\u201390","DOI":"10.1145\/375663.375672"},{"key":"709_CR5","doi-asserted-by":"crossref","unstructured":"Breunig MM, Kriegel HP, Sander J (2000) Fast hierarchical clustering based on compressed data and OPTICS. In: Zighed D, Komorowski H, Zytkow J (eds) Proceedings of principles of data mining and knowledge discovery, 4th European conference, PKDD 2000. Lyon, France, September, pp 232\u2013242","DOI":"10.1007\/3-540-45372-5_23"},{"key":"709_CR6","volume-title":"Pattern classification","author":"RO Duda","year":"2000","unstructured":"Duda RO, Hart PE, Stork DG (2000) Pattern classification. Wiley, Singapore"},{"key":"709_CR7","unstructured":"Ester M, Kriegel H-P, Sander J (1996) Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis E, Han J, Fayyad U (eds) Proceedings of the second international conference on knowledge discovery and data mining (KDD-96). Portland, Oregon, USA, pp 226\u2013231"},{"key":"709_CR8","volume-title":"Clustering algorithms","author":"JA Hartigan","year":"1975","unstructured":"Hartigan JA (1975) Clustering algorithms. Wiley, New York"},{"issue":"8","key":"709_CR9","doi-asserted-by":"crossref","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","journal-title":"Pattern Recognit Lett"},{"issue":"3","key":"709_CR10","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264\u2013323","journal-title":"ACM Comput Surv"},{"issue":"317","key":"709_CR11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1080\/01621459.1967.10482890","volume":"62","author":"B King","year":"1967","unstructured":"King B (1967) Step-wise clustering procedures. J Am Stat Assoc 62(317):86\u2013101","journal-title":"J Am Stat Assoc"},{"key":"709_CR12","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz M, Lasek P (2010) TI-DBSCAN: clustering with DBSCAN by means of the triangle inequality. In: Szczuka M, Kryszkiewicz M, Ramanna S, Jensen R, Hu Q (eds) Proceedings of rough sets and current trends in computing (RSCTC 2010), 7th international conference, RSCTC 2010, Warsaw, Poland, June, 2010. Lecture Notes in Computer Science 6086, Springer, pp 60\u201369","DOI":"10.1007\/978-3-642-13529-3_8"},{"issue":"2","key":"709_CR13","doi-asserted-by":"crossref","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","journal-title":"IEEE Trans Inf Theory"},{"key":"709_CR14","first-page":"101","volume":"1","author":"F Murtagh","year":"1984","unstructured":"Murtagh F (1984) Complexities of hierarchic clustering algorithms: state of the art. Comput Stat Q 1:101\u2013113","journal-title":"Comput Stat Q"},{"issue":"5","key":"709_CR15","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","volume":"14","author":"RT Ng","year":"2002","unstructured":"Ng RT, Han J (2002) CLARANS: a method for clustering objects for spatial data mining. IEEE Trans Knowl Data Eng 14(5):1003\u20131016","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"12","key":"709_CR16","doi-asserted-by":"crossref","first-page":"2862","DOI":"10.1016\/j.patcog.2011.04.027","volume":"44","author":"BK Patra","year":"2011","unstructured":"Patra BK, Nandi S, Viswanath P (2011) A distance based clustering method for arbitrary shaped clusters in large datasets. Pattern Recognit 44(12):2862\u20132870","journal-title":"Pattern Recognit"},{"issue":"336","key":"709_CR17","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand WM (1971) Objective criteria for evaluation of clustering methods. J Am Stat Assoc 66(336):846\u2013850","journal-title":"J Am Stat Assoc"},{"key":"709_CR18","volume-title":"A first course in probability","author":"S Ross","year":"2002","unstructured":"Ross S (2002) A first course in probability. Pearson Education, New Delhi"},{"key":"709_CR19","doi-asserted-by":"crossref","unstructured":"Sarma T, Viswanath P, Reddy B (2013) A hybrid approach to speed-up the k-means clustering method. Int J Mach Learn Cybern 4(2):107\u2013117","DOI":"10.1007\/s13042-012-0079-7"},{"key":"709_CR20","volume-title":"Numerical taxonomy","author":"A Sneath","year":"1973","unstructured":"Sneath A, Sokal PH (1973) Numerical taxonomy. Freeman, London"},{"key":"709_CR21","first-page":"801","volume":"4","author":"H Steinhaus","year":"1956","unstructured":"Steinhaus H (1956) Sur la division des corps mat\u00e9riels en parties. Bull Acad Polon Sci Cl III 4:801\u2013804","journal-title":"Bull Acad Polon Sci Cl III"},{"issue":"16","key":"709_CR22","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1016\/j.patrec.2009.08.008","volume":"30","author":"P Viswanath","year":"2009","unstructured":"Viswanath P, Babu V (2009) Rough-DBSCAN: a fast hybrid density based clustering method for large data sets. Pattern Recognit Lett 30(16):1477\u20131488","journal-title":"Pattern Recognit Lett"},{"key":"709_CR23","doi-asserted-by":"crossref","unstructured":"Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases. In: Jagadish H, Mumick I (eds) Proceedings of the 1996 ACM SIGMOD international conference on management of data. Montreal, Quebec, Canada, June, pp 103\u2013114","DOI":"10.1145\/233269.233324"},{"key":"709_CR24","unstructured":"Zhao Y, Karypis G (2002) Criterion functions for document clustering: experiments and analysis. Technical report, University of Minnesota"},{"key":"709_CR25","unstructured":"Zhou J, Sander J (2003) Data bubbles for non-vector data: speeding-up hierarchical clustering in arbitrary metric spaces. In: Freytag J, Lockemann P, Abiteboul S, Carey M, Selinger P, Heuer A (eds) Proceedings of 29th international conference on very large data bases (VLDB 2003), September, 2003. Germany, Berlin, pp 452\u2013463"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0709-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0709-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0709-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T03:16:35Z","timestamp":1564888595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0709-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,30]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["709"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0709-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,30]]}}}