{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:28:12Z","timestamp":1771702092401,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s11390-015-1555-9","type":"journal-article","created":{"date-parts":[[2015,7,8]],"date-time":"2015-07-08T08:51:22Z","timestamp":1436345482000},"page":"696-712","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Mining Frequent Itemsets in Correlated Uncertain Databases"],"prefix":"10.1007","volume":"30","author":[{"given":"Yong-Xin","family":"Tong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieying","family":"She","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,8]]},"reference":[{"key":"1555_CR1","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C, Gruber M, Kunath P, Pryakhin A, Schubert M. ProVer: Probabilistic video retrieval using the Gauss-tree. In Proc. the 23rd ICDE, April 2007, pp.1521-1522.","DOI":"10.1109\/ICDE.2007.369063"},{"key":"1555_CR2","doi-asserted-by":"crossref","unstructured":"Chen L, Ng R T. On the marriage of Lp-norms and edit distance. In Proc. the 30th VLDB, August 31-September 3, 2004, pp.792-803.","DOI":"10.1016\/B978-012088469-8.50070-X"},{"key":"1555_CR3","doi-asserted-by":"crossref","unstructured":"Chen L, \u00d6zsu M T, Oria V. Robust and fast similarity search for moving object trajectories. In Proc. ACM SIGMOD, June 2005, pp.491-502.","DOI":"10.1145\/1066157.1066213"},{"issue":"9","key":"1555_CR4","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1109\/TKDE.2004.46","volume":"16","author":"R Cheng","year":"2004","unstructured":"Cheng R, Kalashnikov D V, Prabhakar S. Querying imprecise data in moving object environments. IEEE Trans. Knowl. Data Eng., 2004, 16(9): 1112-1127.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1555_CR5","doi-asserted-by":"crossref","unstructured":"Deshpande A, Guestrin C, Madden S, Hellerstein J M, Hong W. Model-driven data acquisition in sensor networks. In Proc. the 30th VLDB, August 31-September 3, 2004, pp.588-599.","DOI":"10.1016\/B978-012088469-8.50053-X"},{"key":"1555_CR6","doi-asserted-by":"crossref","unstructured":"Kodialam M S, Nandagopal T. Fast and reliable estimation schemes in RFID systems. In Proc. the 12th MOBICOM, September 2006, pp.322-333.","DOI":"10.1145\/1161089.1161126"},{"issue":"4","key":"1555_CR7","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1109\/TNET.2009.2037497","volume":"18","author":"Y Liu","year":"2010","unstructured":"Liu Y, Liu K, Li M. Passive diagnosis for wireless sensor networks. IEEE\/ACM Trans. Netw., 2010, 18(4): 1132-1144.","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"1555_CR8","doi-asserted-by":"crossref","unstructured":"Chui C K, Kao B, Hung E. Mining frequent itemsets from uncertain data. In Proc. the 11th PAKDD, May 2007, pp.47-58.","DOI":"10.1007\/978-3-540-71701-0_8"},{"key":"1555_CR9","doi-asserted-by":"crossref","unstructured":"Chui C K, Kao B. A decremental approach for mining frequent itemsets from uncertain data. In Proc. the 12th PAKDD, May 2008, pp.64-75.","DOI":"10.1007\/978-3-540-68125-0_8"},{"key":"1555_CR10","doi-asserted-by":"crossref","unstructured":"Calders T, Garboni C, Goethals B. Efficient pattern mining of uncertain data with sampling. In Proc. the 14th PAKDD, June 2010, pp.480-487.","DOI":"10.1007\/978-3-642-13657-3_51"},{"key":"1555_CR11","doi-asserted-by":"crossref","unstructured":"Aggarwal C C, Li Y, Wang J, Wang J. Frequent pattern mining with uncertain data. In Proc. the 15th SIGKDD, June 28\u2013July 1, 2009, pp.29-38.","DOI":"10.1145\/1557019.1557030"},{"key":"1555_CR12","doi-asserted-by":"crossref","unstructured":"Bernecker T, Kriegel H P, Renz M, Verhein F, Z\u00fcfle A. Probabilistic frequent itemset mining in uncertain databases. In Proc. the 15th SIGKDD, June 28\u2013July 1, 2009, pp.119-128.","DOI":"10.1145\/1557019.1557039"},{"key":"1555_CR13","doi-asserted-by":"crossref","unstructured":"Calders T, Garboni C, Goethals B. Approximation of frequentness probability of itemsets in uncertain data. In Proc. the 10th ICDM, December 2010, pp.749-754.","DOI":"10.1109\/ICDM.2010.42"},{"key":"1555_CR14","doi-asserted-by":"crossref","unstructured":"Gao C, Wang J. Direct mining of discriminative patterns for classifying uncertain data. In Proc. the 16th SIGKDD, July 2010, pp.861-870.","DOI":"10.1145\/1835804.1835913"},{"key":"1555_CR15","doi-asserted-by":"crossref","unstructured":"Leung C K S, Mateo M A F, Brajczuk D A. A tree-based approach for frequent pattern mining from uncertain data. In Proc. the 12th PAKDD, May 2008, pp.653-661.","DOI":"10.1007\/978-3-540-68125-0_61"},{"key":"1555_CR16","doi-asserted-by":"crossref","unstructured":"Sun L, Cheng R, Cheung D W, Cheng J. Mining uncertain data with probabilistic guarantees. In Proc. the 16th SIGKDD, July 2010, pp.273-282.","DOI":"10.1145\/1835804.1835841"},{"key":"1555_CR17","doi-asserted-by":"crossref","unstructured":"Tong Y, Chen L, Ding B. Discovering threshold-based frequent closed itemsets over probabilistic data. In Proc. the 28th ICDE, April 2012, pp.270-281.","DOI":"10.1109\/ICDE.2012.51"},{"issue":"11","key":"1555_CR18","first-page":"1650","volume":"5","author":"Y Tong","year":"2014","unstructured":"Tong Y, Chen L, Cheng Y, Yu P S. Mining frequent itemsets over uncertain databases. PVLDB, 2014, 5(11): 1650-1661.","journal-title":"PVLDB"},{"key":"1555_CR19","doi-asserted-by":"crossref","unstructured":"Wang L, Cheng R, Lee S D, Cheung D W. Accelerating probabilistic frequent itemset mining: A model-based approach. In Proc. the 19th CIKM, October 2010, pp.429-438.","DOI":"10.1145\/1871437.1871494"},{"key":"1555_CR20","doi-asserted-by":"crossref","unstructured":"Zhang Q, Li F, Yi K. Finding frequent items in probabilistic data. In Proc. ACM SIGMOD, June 2008, pp.819-832.","DOI":"10.1145\/1376616.1376698"},{"issue":"4","key":"1555_CR21","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1109\/TCOM.1983.1095854","volume":"31","author":"F Schoute","year":"1983","unstructured":"Schoute F. Dynamic frame length ALOHA. IEEE Trans. Communications, 1983, 31(4): 565-568.","journal-title":"IEEE Trans. Communications"},{"key":"1555_CR22","unstructured":"Lancaster H O. The Chi-Squared Distribution. New York, USA: Wiley, 1969."},{"key":"1555_CR23","unstructured":"Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases. In Proc. the 20th VLDB, September 1994, pp.487-499."},{"key":"1555_CR24","unstructured":"van Dongen S M. Graph clustering by flow simulation [Ph.D. Thesis]. University of Utrecht, 2000."},{"key":"1555_CR25","doi-asserted-by":"crossref","unstructured":"Mo L, He Y, Liu Y, Zhao J, Tang S, Li X Y, Dai G. Canopy closure estimates with GreenOrbs: Sustainable sensing in the forest. In Proc. the 7th SenSys, November 2009, pp.99-112.","DOI":"10.1145\/1644038.1644049"},{"key":"1555_CR26","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD, May 2000, pp.1-12.","DOI":"10.1145\/342009.335372"},{"issue":"3","key":"1555_CR27","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki M J. Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng., 2000, 12(3): 372-390.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1555_CR28","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L. Discovering frequent closed itemsets for association rules. In Proc. the 7th ICDT, January 1999, pp.398-416.","DOI":"10.1007\/3-540-49257-7_25"},{"key":"1555_CR29","doi-asserted-by":"crossref","unstructured":"Bayardo R J. Efficiently mining long patterns from databases. In Proc. ACM SIGMOD, June 1998, pp.85-93.","DOI":"10.1145\/276304.276313"},{"key":"1555_CR30","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B. Mining all non-derivable frequent itemsets. In Proc. the 6th PKDD, August 2002, pp.74-85.","DOI":"10.1007\/3-540-45681-3_7"},{"key":"1555_CR31","doi-asserted-by":"crossref","unstructured":"Sen P, Deshpande A. Representing and querying correlated tuples in probabilistic databases. In Proc. the 23rd ICDE, April 2007, pp.596-605.","DOI":"10.1109\/ICDE.2007.367905"},{"issue":"1","key":"1555_CR32","first-page":"809","volume":"1","author":"P Sen","year":"2008","unstructured":"Sen P, Deshpande A, Getoor L. Exploiting shared correlations in probabilistic databases. PVLDB, 2008, 1(1): 809-820.","journal-title":"PVLDB"},{"key":"1555_CR33","doi-asserted-by":"crossref","unstructured":"Kanagal B, Deshpande A. Efficient query evaluation over temporally correlated probabilistic streams. In Proc. the 25th ICDE, March 29\u2013April 2, 2009, pp.1315-1318.","DOI":"10.1109\/ICDE.2009.229"},{"key":"1555_CR34","doi-asserted-by":"crossref","unstructured":"Olteanu D, van Schaik S J. Dagger: Clustering correlated uncertain data (to predict asset failure In energy networks). In Proc. the 18th SIGKDD, August 2012, pp.1504-1507.","DOI":"10.1145\/2339530.2339766"},{"key":"1555_CR35","doi-asserted-by":"crossref","unstructured":"Kanagal B, Deshpande A. Indexing correlated probabilistic databases. In Proc. ACM SIGMOD, June 2009, pp.455-468.","DOI":"10.1145\/1559845.1559894"},{"issue":"5","key":"1555_CR36","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1109\/TKDE.2013.123","volume":"26","author":"Y Gu","year":"2014","unstructured":"Gu Y, Gao C, Cong G, Yu G. Effective and efficient clustering methods for correlated probabilistic graphs. IEEE Trans. Knowl. Data Eng., 2014, 26(5): 1117-1130.","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-015-1555-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-015-1555-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-015-1555-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T02:41:35Z","timestamp":1566960095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-015-1555-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["1555"],"URL":"https:\/\/doi.org\/10.1007\/s11390-015-1555-9","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}