{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:47Z","timestamp":1759335947825},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319101590"},{"type":"electronic","value":"9783319101606"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10160-6_11","type":"book-chapter","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T03:14:54Z","timestamp":1408504494000},"page":"115-123","source":"Crossref","is-referenced-by-count":21,"title":["BLIMP: A Compact Tree Structure for Uncertain Frequent Pattern Mining"],"prefix":"10.1007","author":[{"given":"Carson Kai-Sang","family":"Leung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard Kyle","family":"MacKinnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Li, Y., Wang, J., Wang, J.: Frequent pattern mining with uncertain data. In: ACM KDD 2009, pp. 29\u201337 (2009)","DOI":"10.1145\/1557019.1557030"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bernecker, T., Kriegel, H.-P., Renz, M., Verhein, F., Zuefle, A.: Probabilistic frequent itemset mining in uncertain databases. In: ACM KDD 2009, pp. 119\u2013127 (2009)","DOI":"10.1145\/1557019.1557039"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Calders, T., Garboni, C., Goethals, B.: Approximation of frequentness probability of itemsets in uncertain data. In: IEEE ICDM 2010, pp. 749\u2013754 (2010)","DOI":"10.1109\/ICDM.2010.42"},{"key":"11_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-13657-3_51","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T. Calders","year":"2010","unstructured":"Calders, T., Garboni, C., Goethals, B.: Efficient pattern mining of uncertain data with sampling. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010, Part I. LNCS (LNAI), vol.\u00a06118, pp. 480\u2013487. Springer, Heidelberg (2010)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-40131-2_18","volume-title":"Data Warehousing and Knowledge Discovery","author":"F. Jiang","year":"2013","unstructured":"Jiang, F., Leung, C.K.-S.: Stream mining of frequent patterns from delayed batches of uncertain data. In: Bellatreche, L., Mohania, M.K. (eds.) DaWaK 2013. LNCS, vol.\u00a08057, pp. 209\u2013221. Springer, Heidelberg (2013)"},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1002\/widm.31","volume":"1","author":"C.K.-S. Leung","year":"2011","unstructured":"Leung, C.K.-S.: Mining uncertain data. WIREs Data Mining and Knowledge Discovery\u00a01(4), 316\u2013329 (2011)","journal-title":"WIREs Data Mining and Knowledge Discovery"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., Hao, B.: Mining of frequent itemsets from streams of uncertain data. In: IEEE ICDE 2009, pp. 1663\u20131670 (2009)","DOI":"10.1109\/ICDE.2009.157"},{"key":"11_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-540-68125-0_61","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C.K.-S. Leung","year":"2008","unstructured":"Leung, C.K.-S., Mateo, M.A.F., Brajczuk, D.A.: A tree-based approach for frequent pattern mining from uncertain data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 653\u2013661. Springer, Heidelberg (2008)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-29038-1_21","volume-title":"Database Systems for Advanced Applications","author":"C.K.-S. Leung","year":"2012","unstructured":"Leung, C.K.-S., Tanbeer, S.K.: Fast tree-based mining of frequent itemsets from uncertain data. In: Lee, S.-G., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part I. LNCS, vol.\u00a07238, pp. 272\u2013287. Springer, Heidelberg (2012)"},{"key":"11_CR12","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-37453-1_2","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C.K.-S. Leung","year":"2013","unstructured":"Leung, C.K.-S., Tanbeer, S.K.: PUF-tree: A compact tree structure for frequent pattern mining of uncertain data. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS (LNAI), vol.\u00a07818, pp. 13\u201325. Springer, Heidelberg (2013)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-32584-7_16","volume-title":"Data Warehousing and Knowledge Discovery","author":"D. Oguz","year":"2012","unstructured":"Oguz, D., Ergenc, B.: Incremental itemset mining based on matrix Apriori algorithm. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2012. LNCS, vol.\u00a07448, pp. 192\u2013204. Springer, Heidelberg (2012)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-32584-7_17","volume-title":"Data Warehousing and Knowledge Discovery","author":"J.-F. Qu","year":"2012","unstructured":"Qu, J.-F., Liu, M.: A fast algorithm for frequent itemset mining using Patricia* structures. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2012. LNCS, vol.\u00a07448, pp. 205\u2013216. Springer, Heidelberg (2012)"},{"issue":"11","key":"11_CR15","first-page":"1650","volume":"5","author":"Y. Tong","year":"2012","unstructured":"Tong, Y., Chen, L., Cheng, Y., Yu, P.S.: Mining frequent itemsets over uncertain databases. PVLDB\u00a05(11), 1650\u20131661 (2012)","journal-title":"PVLDB"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Li, F., Yi, K.: Finding frequent items in probabilistic data. In: ACM SIGMOD 2008, pp. 819\u2013832 (2008)","DOI":"10.1145\/1376616.1376698"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10160-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:34:50Z","timestamp":1558974890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10160-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319101590","9783319101606"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10160-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}