{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:55:22Z","timestamp":1725573322404},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540352259"},{"type":"electronic","value":"9783540352266"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11775300_35","type":"book-chapter","created":{"date-parts":[[2006,6,14]],"date-time":"2006-06-14T07:51:04Z","timestamp":1150271464000},"page":"410-421","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Incremental Data Summarization for Hierarchical Clustering"],"prefix":"10.1007","author":[{"given":"Bing","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yuliang","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Zhihui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Baile","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"MacQueen, J.: Some Methods for Classification and Analysis of Multivariate Observations. In: 5th Berkeley Symp. Math. Statist. Prob., pp. 281\u2013297 (1967)"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breuing, M., Kriegel, H.-P., Sander, J.: OPTICS: Ordering Points to Identify the Clustering Structure. In: SIGMOD 1999, pp. 49\u201360 (1999)","DOI":"10.1145\/304181.304187"},{"issue":"1","key":"35_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R. Sibson","year":"1973","unstructured":"Sibson, R.: SLINK: An Optimally Efficient Algorithm for the Single-link Cluster Method. The Computer Journal\u00a016(1), 30\u201334 (1973)","journal-title":"The Computer Journal"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Sander, J., Qin, X., Lu, Z., Niu, N., Kovarsky, A.: Automated Extraction of Clusters from Hierarchical Clustering Representations. In: PAKDD 2003 (2003)","DOI":"10.1007\/3-540-36175-8_8"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Breuing, M., Kriegel, H.-P., Kroger, P., Sander, J.: Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering. In: SIGMOD 2001, pp. 79\u201390 (2001)","DOI":"10.1145\/376284.375672"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Linvy, M.: BIRCH: An Efficient Data Clustering Method for Very Large Databases. In: SIGMOD 1996, pp. 103\u2013114 (1996)","DOI":"10.1145\/235968.233324"},{"key":"35_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-47887-6_23","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C. Chen","year":"2002","unstructured":"Chen, C., Hwang, S., Oyang, Y.: An Incremental Hierarchical Data Clustering Algorithm Based on Gravity Theory. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, p. 237. Springer, Heidelberg (2002)"},{"key":"35_CR8","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Wimmer, M., Xu, X.: Incremental Clustering for Mining in a Data Warehousing Enviornment. In: VLDB 1998, pp. 323\u2013333 (1998)"},{"key":"35_CR9","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, pp. 226\u2013231 (1996)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Widyantoro, D.H., Ioerger, T.R., Yen, J.: An Incremental Approach to Building a Cluster Hierarchy. In: ICDM 2002, pp. 705\u2013708 (2002)","DOI":"10.1109\/ICDM.2002.1184034"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental Clustering and Dynamic Information Retrieval. In: 29th Symposium on Theory of Computing, pp. 626\u2013635 (1997)","DOI":"10.1145\/258533.258657"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Nassar, S., Sander, J., Cheng, C.: Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering. In: SIGMOD 2004, pp. 467\u2013478 (2004)","DOI":"10.1145\/1007568.1007621"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Larsen, B., Aone, C.: Fast and Effective Text Mining Using Linear-time Document Clustering. In: KDD 1999, pp. 16\u201322 (1999)","DOI":"10.1145\/312129.312186"}],"container-title":["Lecture Notes in Computer Science","Advances in Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11775300_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:00Z","timestamp":1619507700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11775300_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352259","9783540352266"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11775300_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}