{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T01:27:41Z","timestamp":1648862861974},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2011,9,15]],"date-time":"2011-09-15T00:00:00Z","timestamp":1316044800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s11432-011-4378-5","type":"journal-article","created":{"date-parts":[[2011,9,14]],"date-time":"2011-09-14T10:37:25Z","timestamp":1315996645000},"page":"2028-2039","source":"Crossref","is-referenced-by-count":1,"title":["Computing rarity on uncertain data"],"prefix":"10.1007","volume":"54","author":[{"given":"CheQing","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MinQi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"AoYing","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,15]]},"reference":[{"key":"4378_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-0-387-09690-2","volume-title":"Managing and Mining Uncertain Data","author":"C. C. Aggarwal","year":"2009","unstructured":"Aggarwal C C. Managing and Mining Uncertain Data. Berlin\/Heidelberg: Springer-Verlag, 2009. 1\u2013494"},{"key":"4378_CR2","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1145\/1247480.1247559","volume-title":"Proceedings of ACM SIGMOD 2007","author":"L. Antova","year":"2007","unstructured":"Antova L, Koch C, Olteanu D. From complete to incomplete information and back. In: Chan C Y, Ooi B C, Zhou A, eds. Proceedings of ACM SIGMOD 2007. New York: ACM Press, 2007. 713\u2013724"},{"key":"4378_CR3","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00778-006-0004-3","volume":"16","author":"N. Dalvi","year":"2007","unstructured":"Dalvi N, Suciu D. Efficient query evaluation on probabilistic databases. Int J Very Large Data Base, 2007, 16: 523\u2013544","journal-title":"Int J Very Large Data Base"},{"key":"4378_CR4","unstructured":"Agrawal P, Benjelloun O, Sarma A D, et al. Trio: a system for data, uncertainty, and lineage. In: Dayal U, Whang K Y, Lomet D, et al., eds. Proceedings of VLDB 2006. VLDB Endowment, 2006. 1151\u20131154"},{"key":"4378_CR5","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1145\/1376616.1376698","volume-title":"Proceedings of ACM SIGMOD 2008","author":"Q. Zhang","year":"2008","unstructured":"Zhang Q, Li F, Yi K. Finding frequent items in probabilistic data. In: Wang J T, ed. Proceedings of ACM SIGMOD 2008. New York: ACM Press, 2008. 819\u2013832"},{"key":"4378_CR6","first-page":"119","volume-title":"Proceedings of ACM SIGKDD 2009","author":"T. Bernecker","year":"2009","unstructured":"Bernecker T, Kriegel H P, Renz M, et al. Probabilistic frequent itemset mining in uncertain databases. In: Elder J F IV, Fogelman-Souli\u00e9 F, Flach P A, et al., eds. Proceedings of ACM SIGKDD 2009. New York: ACM Press, 2009. 119\u2013128"},{"key":"4378_CR7","first-page":"346","volume-title":"Proceedings of SODA 2007","author":"T. Jayram","year":"2007","unstructured":"Jayram T, Kale S, Vee E. Efficient aggregation algorithms for probabilistic data. In: Bansal N, Pruhs K, Stein C, eds. Proceedings of SODA 2007. Philadelphia: SIAM, 2007. 346\u2013355"},{"key":"4378_CR8","first-page":"150","volume-title":"Proceedings of IEEE ICDE 2008","author":"C. C. Aggarwal","year":"2008","unstructured":"Aggarwal C C, Yu P S. A framework for clustering uncertain data streams. In: Alonso G, Blakely J A, Chen A, eds. Proceedings of IEEE ICDE 2008. Piscataway: IEEE Press, 2008. 150\u2013159"},{"key":"4378_CR9","first-page":"323","volume-title":"Proceedings of ESA 2002","author":"M. Datar","year":"2002","unstructured":"Datar M, Muthukrishnan S. Estimating rarity and similarity over data stream windows. In: M\u00f6hring R H, Raman R, eds. Proceedings of ESA 2002. Berlin\/Heidelberg: Springer-Verlag, 2002. 323\u2013334"},{"key":"4378_CR10","first-page":"1","volume-title":"Proceedings of CPM 2000","author":"A. Broder","year":"2000","unstructured":"Broder A. Identifying and filtering near-duplicate documents. In: Giancarlo R, Sankoff D, eds. Proceedings of CPM 2000. Berlin\/Heidelberg: Springer-Verlag, 2000. 1\u201310"},{"key":"4378_CR11","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E. Cohen","year":"1997","unstructured":"Cohen E. Size-estimation framework with applications to transitive closure and reachability. J Comput Syst Sci, 1997, 55: 441\u2013453","journal-title":"J Comput Syst Sci"},{"key":"4378_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1017\/CBO9780511814075.005","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani R, Raghavan P. Randomized Algorithms. Cambridge: Cambridge University Press, 1995. 67\u201373"},{"key":"4378_CR13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1541880.1541882","volume":"41","author":"V. Chandola","year":"2009","unstructured":"Chandola V, Banerjee A, Kumar V. Anomaly detection: a survey. ACM Comput Surv, 2009, 41: 15","journal-title":"ACM Comput Surv"},{"key":"4378_CR14","unstructured":"Dong X, Halevy A Y, Yu C. Data integration with uncertainty. In: Koch C, Gehrke J, Garofalakis M N, et al., eds. Proceedings of VLDB 2007. VLDB Endowment, 2007. 687\u2013698"},{"key":"4378_CR15","unstructured":"Tao Y, Cheng R, Xiao X, et al. Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: Bohm K, Jensen C S, Haas L M, et al., eds. Proceedings of VLDB 2005. VLDB Endowment, 2005. 922\u2013933"},{"key":"4378_CR16","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.14778\/1687627.1687762","volume":"2","author":"M. Zhang","year":"2009","unstructured":"Zhang M, Chen S, Jensen C S, et al. Effectively indexing uncertain moving objects for predictive queries. P VLDB Endowment, 2009, 2: 1198\u20131209","journal-title":"P VLDB Endowment"},{"key":"4378_CR17","unstructured":"Benjelloun O, Sarma A D, Halevy A Y, et al. Uldbs: databases with uncertainty and lineage. In: Dayal U, Whang K Y, Lomet D B, et al., eds. Proceedings of VLDB 2006. VLDB Endowment, 2006. 953\u2013964"},{"key":"4378_CR18","unstructured":"Burdick D, Deshpande D M, Jayram T, et al. OLAP over uncertain and imprecise data. In: Bohm K, Jensen C S, Haas L M, et al., eds. Proceedings of VLDB 2005. VLDB Endowment, 2005. 970\u2013981"},{"key":"4378_CR19","unstructured":"Zhang Y, Lin X, Zhu G, et al. Efficient rank based knn query processing over uncertain data. In: Li F, Moro M M, Ghandeharizadeh S, et al., eds. Proceedings of IEEE ICDE 2010. Piscataway: IEEE Press, 2010. 28\u201339"},{"key":"4378_CR20","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, et al. Sliding-window top-k queries on uncertain streams. P VLDB Endowment, 2008, 1: 301\u2013312","journal-title":"P VLDB Endowment"},{"key":"4378_CR21","first-page":"191","volume-title":"Proceedings of ACM PODS 2008","author":"G. Cormode","year":"2008","unstructured":"Cormode G, McGregor A. Approximation algorithms for clustering uncertain data. In: Lenzerini M, Lembo D, eds. Proceedings of ACM PODS 2008. New York: ACM Press, 2008. 191\u2013200"},{"key":"4378_CR22","doi-asserted-by":"crossref","first-page":"997","DOI":"10.14778\/1920841.1920967","volume":"3","author":"M. Potamias","year":"2010","unstructured":"Potamias M, Bonchi F, Gionis A, et al. k-nearest neighbors in uncertain graphs. P VLDB Endowment, 2010, 3: 997\u20131008","journal-title":"P VLDB Endowment"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4378-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-011-4378-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4378-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:36:15Z","timestamp":1559403375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-011-4378-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,15]]},"references-count":22,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["4378"],"URL":"https:\/\/doi.org\/10.1007\/s11432-011-4378-5","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,15]]}}}