{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T13:34:18Z","timestamp":1744205658564},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T00:00:00Z","timestamp":1372723200000},"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":[[2014,9]]},"DOI":"10.1007\/s10115-013-0657-3","type":"journal-article","created":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T11:06:16Z","timestamp":1372676776000},"page":"509-539","source":"Crossref","is-referenced-by-count":14,"title":["Efficient clustering of uncertain data streams"],"prefix":"10.1007","volume":"40","author":[{"given":"Cheqing","family":"Jin","sequence":"first","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Feng","family":"Cao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,2]]},"reference":[{"key":"657_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC (2009) Managing and mining uncertain data. Springer, Berlin","DOI":"10.1007\/978-0-387-09690-2"},{"key":"657_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal CC (2009) On high dimensional projected clustering of uncertain data streams. In: Proceedings of ICDE, pp. 1152\u20131154","DOI":"10.1109\/ICDE.2009.188"},{"key":"657_CR3","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1016\/j.neucom.2008.12.026","volume":"72","author":"N Alex","year":"2009","unstructured":"Alex N, Hasenfuss A, Hammer B (2009) Patch clustering for massive data sets. Neurocomputing 72:1455\u20131469","journal-title":"Neurocomputing"},{"key":"657_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Han J, Wang J, Yu PS (2003) A framework for clustering evolving data streams. In: Proceedings of VLDB","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"657_CR5","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Yu PS (2008) A framework for clustering uncertain data streams. In: Proceedings of ICDE","DOI":"10.1109\/ICDE.2008.4497423"},{"key":"657_CR6","doi-asserted-by":"crossref","unstructured":"Babcock B, Babu S, Datar M, Motwani R, Widom J (2002) Models and issues in data stream systems. In: Proceedings of ACM SIGACT-SIGMOD symposium on principles of database systems","DOI":"10.1145\/543613.543615"},{"key":"657_CR7","doi-asserted-by":"crossref","unstructured":"Burdick D, Deshpande PM, Jayram T, Ramakrishnan R, Vaithyanathan S (2005) OLAP over uncertain and imprecise data. In: Proceedings of VLDB","DOI":"10.1007\/s00778-006-0033-y"},{"key":"657_CR8","doi-asserted-by":"crossref","unstructured":"Babcock B, Datar M, Motwani R, O\u2019Callaghan L (2003) Maintaining variance and k-medians over data stream windows. In: Proceedings of ACM PODS","DOI":"10.1145\/773153.773176"},{"key":"657_CR9","unstructured":"Benjelloun O, Sarma AD, Halevy AY, Widom J (2006) Uldbs: databases with uncertainty and lineage. In: Proceedings of VLDB"},{"key":"657_CR10","doi-asserted-by":"crossref","unstructured":"Chau M, Cheng R, Kao B, Ng J (2006) Uncertain data mining: An example in clustering location data. In: Proceedings of PAKDD","DOI":"10.1007\/11731139_24"},{"key":"657_CR11","doi-asserted-by":"crossref","unstructured":"Cormode G, Garofalakis M (2007) Sketching probabilistic data streams. In: Proceedings of ACM SIGMOD","DOI":"10.1145\/1247480.1247513"},{"key":"657_CR12","doi-asserted-by":"crossref","unstructured":"Cormode G, McGregor A (2008) Approximation algorithms for clustering uncertain data. In: Proceedings of PODS","DOI":"10.1145\/1376916.1376944"},{"key":"657_CR13","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1080\/01969727308546046","volume":"3","author":"JC Dunn","year":"1973","unstructured":"Dunn JC (1973) A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters. J Cybern 3:32\u201357","journal-title":"J Cybern"},{"key":"657_CR14","doi-asserted-by":"crossref","unstructured":"Dalvi NN, Suciu D (2004) Efficient query evaluation on probabilistic databases. In: Proceedings of ICDE","DOI":"10.1016\/B978-012088469-8.50076-0"},{"key":"657_CR15","doi-asserted-by":"crossref","unstructured":"Dalvi NN, Suciu D (2007) Management of probabilistic data foundations and challenges. In: Proceedings of ACM PODS","DOI":"10.1145\/1265530.1265531"},{"key":"657_CR16","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) Density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of KDD"},{"key":"657_CR17","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1998) Cure: an efficient clustering algorithm for large databases. In: Proceedings of SIGMOD, pp 73\u201384","DOI":"10.1145\/276304.276312"},{"issue":"2","key":"657_CR18","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D Hochbaum","year":"1985","unstructured":"Hochbaum D, Shmoys D (1985) A best possible heuristic for the k-center problem. Math Oper Res 10(2):180\u2013184","journal-title":"Math Oper Res"},{"key":"657_CR19","unstructured":"Jain A, Dubes R (1988) Algorithms for clustering data. Prentice Hall, New Jersey"},{"key":"657_CR20","unstructured":"Jayram T, Kale S, Vee E (2007) Efficient aggregation algorithms for probabilistic data. In: Proceedings of SODA"},{"issue":"1","key":"657_CR21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.14778\/1453856.1453892","volume":"1","author":"C Jin","year":"2008","unstructured":"Jin C, Yi K, Chen L, Yu JX, Lin X (2008) Sliding-window top-k queries on uncertain streams. Proc VLDB Endow 1(1):301\u2013312","journal-title":"Proc VLDB Endow"},{"key":"657_CR22","doi-asserted-by":"crossref","unstructured":"Kao B, Lee SD, Cheung DW, Ho W-S, Chan KF (2008) Clustering uncertain data using Voronoi diagrams. In: Proceedings of ICDM, pp 333\u2013342","DOI":"10.1109\/ICDM.2008.31"},{"key":"657_CR23","doi-asserted-by":"crossref","unstructured":"Kriegel H-P, Pfeifle M (2005) Density-based clustering of uncertain data. In: Proceedings of KDD","DOI":"10.1145\/1081870.1081955"},{"key":"657_CR24","doi-asserted-by":"crossref","unstructured":"Kriegel H-P, Pfeifle M (2005) Hierarchical density-based clustering of uncertain data. In: Proceedings of ICDM","DOI":"10.1109\/ICDM.2005.75"},{"key":"657_CR25","doi-asserted-by":"crossref","unstructured":"Lee SD, Kao B, Cheng R (2007) Reducing uk-means to k-means. In: Proceedingd of ICDM workshops, pp 483\u2013488","DOI":"10.1109\/ICDMW.2007.40"},{"key":"657_CR26","doi-asserted-by":"crossref","unstructured":"Ngai WK, Kao B, Chui CK, Cheng R, Chau M, Yip KY (2006) Efficient clustering of uncertain data. In: Proceedings of ICDM","DOI":"10.1109\/ICDM.2006.63"},{"key":"657_CR27","doi-asserted-by":"crossref","unstructured":"O\u2019Callaghan L, Mishra N, Meyerson A, Guha S (2002) Streaming-data algorithms for high-quality clustering. In: Proceedings of ICDE","DOI":"10.1109\/ICDE.2002.994785"},{"issue":"1","key":"657_CR28","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10115-010-0316-x","volume":"28","author":"N Pelekis","year":"2011","unstructured":"Pelekis N, Kopanakis I, Kotsifakos EK, Frentzos E, Theodoridis Y (2011) clustering uncertain trajectories. Knowl Inf Syst 28(1):117\u2013147","journal-title":"Knowl Inf Syst"},{"key":"657_CR29","unstructured":"Tao Y, Cheng R, Xiao X, Ngai WK, Kao B, Prabhakar S (2005) Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: Proceedings of VLDB"},{"key":"657_CR30","unstructured":"Xin D, Halevy AY, Yu C (2007) Data integration with uncertainty. In: Proceedings of VLDB"},{"key":"657_CR31","doi-asserted-by":"crossref","unstructured":"Zhang M, Chen S, Jensen CS, Ooi BC, Zhang Z (2009) Effectively indexing uncertain moving objects for predictive queries. In: Proceedings of VLDB","DOI":"10.14778\/1687627.1687762"},{"key":"657_CR32","doi-asserted-by":"crossref","unstructured":"Zhang Q, Li F, Yi K (2008) Finding frequent items in probabilistic data. In: Proceedings of SIGMOD","DOI":"10.1145\/1376616.1376698"},{"key":"657_CR33","doi-asserted-by":"crossref","unstructured":"Zhang W, Lin X, Zhang Y, Wang W, Yu JX (2009) Probilistic skyline operator over sliding windows. In: Proceedings of ICDE","DOI":"10.1109\/ICDE.2009.83"},{"key":"657_CR34","doi-asserted-by":"crossref","unstructured":"Zhang Y, Lin X, ZHU G, Zhang W, Lin Q (2010) Efficient rank based knn query processing over uncertain data. In: Proceedings of ICDE","DOI":"10.1109\/ICDE.2010.5447874"},{"key":"657_CR35","doi-asserted-by":"crossref","unstructured":"Zhang T, Ramakrishnan R, Livnya M (1996) Birch: an efficient data clustering method for very large databases. In: Proceedings of ACM SIGMOD, pp 103\u2013114","DOI":"10.1145\/233269.233324"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0657-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0657-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0657-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T17:58:38Z","timestamp":1563299918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0657-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,2]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["657"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0657-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2013,7,2]]}}}