{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:10:10Z","timestamp":1725531010892},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642013065"},{"type":"electronic","value":"9783642013072"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01307-2_14","type":"book-chapter","created":{"date-parts":[[2009,4,18]],"date-time":"2009-04-18T09:47:58Z","timestamp":1240048078000},"page":"122-133","source":"Crossref","is-referenced-by-count":5,"title":["Clustering with Lower Bound on Similarity"],"prefix":"10.1007","author":[{"given":"Mohammad Al","family":"Hasan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeed","family":"Salem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjarath","family":"Pupacdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed J.","family":"Zaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Han, J., Wang, J., Yu, P.S.: A framework for clustering evolving data streams. In: VLDB Proceedings (August 2003)","key":"14_CR1","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.7155\/jgaa.00084","volume":"8","author":"J. Aslam","year":"2004","unstructured":"Aslam, J., Pelekhov, J.E., Rus, D.: The star clustering algorithm for static and dynamic information organization. Graph Algorithms and Application\u00a08(1), 95\u2013129 (2004)","journal-title":"Graph Algorithms and Application"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"K.S. Azoury","year":"2001","unstructured":"Azoury, K.S., Warmuth, M.K.: Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning\u00a043(3), 211\u2013246 (2001)","journal-title":"Machine Learning"},{"unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data streams. In: ACM SIGMOD-SIGACT-SIGART symposium on Principles of Database Systems. ACM, New York","key":"14_CR4"},{"doi-asserted-by":"crossref","unstructured":"Banerjee, A., Basu, S.: Topic models over text streams: A study of batch and online unsepervised learning. In: SIAM Data Mining (2007)","key":"14_CR5","DOI":"10.1137\/1.9781611972771.40"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-540-24586-5_59","volume-title":"Progress in Pattern Recognition, Speech and Image Analysis","author":"R.J. Gil-Garc\u00eda","year":"2003","unstructured":"Gil-Garc\u00eda, R.J., Bad\u00eda-Contelles, J.M., Pons-Porrata, A.: Extended Star Clustering. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol.\u00a02905, pp. 480\u2013487. Springer, Heidelberg (2003)"},{"key":"14_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0020-0190(96)00191-3","volume":"61","author":"G. King","year":"1997","unstructured":"King, G., Tzeng, W.: On-line algorithm for the dominating set problem. Information Processing Letters\u00a061, 11\u201314 (1997)","journal-title":"Information Processing Letters"},{"issue":"5","key":"14_CR9","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM\u00a041(5), 960\u2013981 (1994)","journal-title":"Journal of the ACM"},{"unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg","key":"14_CR10"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/SCT.1993.336517","volume-title":"Proc. of Eighth Annual Structure in Complexity Theorey","author":"D. Zuckerman","year":"1993","unstructured":"Zuckerman, D.: Np-complete problems have a version that\u2019s hard to approximate. In: Proc. of Eighth Annual Structure in Complexity Theorey, pp. 305\u2013312. IEEE Computer Society, Los Alamitos (1993)"}],"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-01307-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T14:36:57Z","timestamp":1551969417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01307-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642013065","9783642013072"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01307-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}