{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T21:04:55Z","timestamp":1761599095401},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,11,16]],"date-time":"2010-11-16T00:00:00Z","timestamp":1289865600000},"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":[[2011,9]]},"DOI":"10.1007\/s10115-010-0360-6","type":"journal-article","created":{"date-parts":[[2010,11,15]],"date-time":"2010-11-15T03:01:16Z","timestamp":1289790076000},"page":"665-685","source":"Crossref","is-referenced-by-count":18,"title":["SimClus: an effective algorithm for clustering with a lower bound on similarity"],"prefix":"10.1007","volume":"28","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":"Mohammed J.","family":"Zaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,16]]},"reference":[{"key":"360_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Han J, Wang J, Yu PS (2003) A framework for clustering evolving data streams. In: VLDB proceedings","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"issue":"1","key":"360_CR2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.7155\/jgaa.00084","volume":"8","author":"J Aslam","year":"2004","unstructured":"Aslam J, Pelekhov JE, Rus D (2004) The star clustering algorithm for static and dynamic information organization. Graph Algorithms Appl 8(1): 95\u2013129","journal-title":"Graph Algorithms Appl"},{"issue":"3","key":"360_CR3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"KS Azoury","year":"2001","unstructured":"Azoury KS, Warmuth MK (2001) Relative loss bounds for on-line density estimation with the exponential family of distributions. Mach Learn 43(3): 211\u2013246","journal-title":"Mach Learn"},{"key":"360_CR4","doi-asserted-by":"crossref","unstructured":"Banerjee A, Basu S (2007) Topic models over text streams: A study of batch and online unsepervised learning. In: Proceedings of SIAM data mining conference 2007","DOI":"10.1137\/1.9781611972771.40"},{"key":"360_CR5","unstructured":"Babcock B, Babu S, Datar M, Motwani R, Widom J (2002) Models and issues in data streams. In: SIGMOD-SIGACT-SIGART symposium on principles of database systems, ACM 2002"},{"key":"360_CR6","doi-asserted-by":"crossref","unstructured":"Badoiu M, Har-Peled S, Indyk P (2002) Approximate clustering via core-sets. Proc. of thirty-fourth STOC, ACM, pp 250\u2013257","DOI":"10.1145\/509907.509947"},{"key":"360_CR7","doi-asserted-by":"crossref","unstructured":"Banerjee A, Krumpelman C, Basu S, Mooney RJ, Ghosh J (2005) Model-based overlapping clustering. In: Eleventh ACM SIGKDD international conference on KDD","DOI":"10.1145\/1081870.1081932"},{"key":"360_CR8","doi-asserted-by":"crossref","unstructured":"Boyardo RJ, Ma Y, Srikant R (2007) Scaling up all pairs similarity search. Proc. of 16th Internation World Wide Web Conference, May 2007","DOI":"10.1145\/1242572.1242591"},{"issue":"1","key":"360_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10115-008-0136-4","volume":"18","author":"B Bringmann","year":"2009","unstructured":"Bringmann B, Zimmermann A (2009) One in a million: picking the right patterns. Knowl Inf Syst 18(1): 61\u201381","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"360_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10115-009-0216-0","volume":"21","author":"V Chaoji","year":"2009","unstructured":"Chaoji V, Hasan MA, Salem S, Zaki MJ (2009) SPARCL: an effective and efficient algorithm for mining arbitrary shape-based clusters. Knowl Inf Syst 21(2): 201\u2013229","journal-title":"Knowl Inf Syst"},{"key":"360_CR11","unstructured":"Cox E (2005) Fuzzy modeling tools for data mining and knowledge discovery. Morgan Kaufmann"},{"key":"360_CR12","unstructured":"Dongen SV (2000) Graph clustering by flow simulation. PhD in Computer Science, Univeristy of Utrecht"},{"key":"360_CR13","doi-asserted-by":"crossref","unstructured":"Chen X, Zhang D, Lee WS (2005) Text classification with kernels on the multinomial manifold. SIGIR Proceedings","DOI":"10.1145\/1076034.1076081"},{"key":"360_CR14","volume-title":"Extended star clustering, in CIARP (LNCS 2905)","author":"R G-Garcia","year":"2003","unstructured":"G-Garcia R, Badia-Contelles J, Pons-Porrata A (2003) Extended star clustering, in CIARP (LNCS 2905). Springer, New York"},{"key":"360_CR15","volume-title":"Computers and intractability: a guide to the theory of np-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. W.H. Freeman, San Francisco"},{"key":"360_CR16","doi-asserted-by":"crossref","unstructured":"Huang D, Sherman B, Tan Q et\u00a0al (2007) The DAVID gene functional classification tool: a novel biological module-centric algorithm to functionally analyze large gene lists. Genome Biol 8(9)","DOI":"10.1186\/gb-2007-8-9-r183"},{"issue":"3","key":"360_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10115-006-0005-y","volume":"10","author":"M Kobayashi","year":"2006","unstructured":"Kobayashi M, Aono M (2006) Exploring overlapping clusters using dynamic re-scaling and sampling. Knowl Inf Syst 10(3): 295\u2013313","journal-title":"Knowl Inf Syst"},{"issue":"8","key":"360_CR18","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"1999","unstructured":"Karypis G, Han E, Kumar V (1999) Chameleon: hierarchical clustering using dynamic modeling. Computer 32(8): 68\u201375","journal-title":"Computer"},{"key":"360_CR19","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0020-0190(96)00191-3","volume":"61","author":"G King","year":"1997","unstructured":"King G, Tzeng W (1997) On-line algorithm for the dominating set problem. Inf Process Lett 61: 11\u201314","journal-title":"Inf Process Lett"},{"key":"360_CR20","doi-asserted-by":"crossref","unstructured":"Liu H, Lin Y, Han J (2009) Methods for mining frequent items in data streams: an overview. Knowl Inf Syst. doi: 10.1007\/s10115-009-0267-2","DOI":"10.1007\/s10115-009-0267-2"},{"issue":"2","key":"360_CR21","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd SP (1982) Least square quantization in pcm. IEEE Trans Inf Theory 28(2): 129\u2013136","journal-title":"IEEE Trans Inf Theory"},{"issue":"5","key":"360_CR22","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund C, Yannakakis M (1994) On the hardness of approximating minimization problems. J ACM 41(5): 960\u2013981","journal-title":"J ACM"},{"key":"360_CR23","doi-asserted-by":"crossref","unstructured":"Narasimhamurthy A, Greene D, Hurley N, Cunningham P (2009) Partitioning large networks without breaking communities. Knowl Inf Syst. doi: 10.1007\/s10115-009-0251-x","DOI":"10.1007\/s10115-009-0251-x"},{"key":"360_CR24","unstructured":"Ng RT, Han J (1994) Efficient and effective clustering methods for spatial data mining. In: VLDB proceedings August 1994"},{"key":"360_CR25","doi-asserted-by":"crossref","unstructured":"Palla G, Derenyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435","DOI":"10.1038\/nature03607"},{"key":"360_CR26","doi-asserted-by":"crossref","unstructured":"Parikh N, Sundaresan N (2008) Inferring semantic query relation from collective user behavior. In: Proceedings of conference on information and knowledge management, ACM, October 2008","DOI":"10.1145\/1458082.1458130"},{"key":"360_CR27","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"1998","unstructured":"Vazirani VV (1998) Approximation algorithms. Springer, New York"},{"key":"360_CR28","unstructured":"Xin D, Han J, Yan X, Cheng H (2005) Mining compressed frequent-pattern sets. In: VLDB proceedings, August 2005"},{"key":"360_CR29","unstructured":"Zamir O, Etzioni O (1994) Grouper: a dynamic clustering interface to web search results. In: Proceedings of world wide web, pp 1261\u20131274"},{"key":"360_CR30","doi-asserted-by":"crossref","unstructured":"Zuckerman D (1993) Np-complete problems have a version that\u2019s hard to approximate. In: Proceedings of eighth annual structure in complexity theory, IEEE Computer Society, pp 305\u2013312","DOI":"10.1109\/SCT.1993.336517"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0360-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-010-0360-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0360-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T04:42:06Z","timestamp":1559796126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-010-0360-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,16]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["360"],"URL":"https:\/\/doi.org\/10.1007\/s10115-010-0360-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,16]]}}}