{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:25:34Z","timestamp":1725852334996},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319320243"},{"type":"electronic","value":"9783319320250"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32025-0_10","type":"book-chapter","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T12:47:38Z","timestamp":1458823658000},"page":"149-163","source":"Crossref","is-referenced-by-count":5,"title":["Probabilistic Maximal Frequent Itemset Mining Over Uncertain Databases"],"prefix":"10.1007","author":[{"given":"Haifeng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"17","author":"J Han","year":"2007","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 17, 55\u201386 (2007)","journal-title":"Data Min. Knowl. Discov."},{"issue":"5","key":"10_CR2","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TKDE.2008.190","volume":"21","author":"CC Aggarwal","year":"2009","unstructured":"Aggarwal, C.C., Yu, P.S.: A survey of uncertain data algorithms and applications. Trans. Knowl. Data Min. 21(5), 609\u2013623 (2009)","journal-title":"Trans. Knowl. Data Min."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J.: Efficiently mining long patterns from databases. In: Proceedings of SIGMOD (1998)","DOI":"10.1145\/276304.276313"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT 1999","author":"N Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rulesd. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45681-3_7","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"T Calders","year":"2002","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 74\u201386. Springer, Heidelberg (2002)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-71701-0_8","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C-K Chui","year":"2007","unstructured":"Chui, C.-K., Kao, B., Hung, E.: Mining frequent itemsets from uncertain data. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 47\u201358. Springer, Heidelberg (2007)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-68125-0_8","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C-K Chui","year":"2008","unstructured":"Chui, C.-K., Kao, B.: A decremental approach for mining frequent itemsets from uncertain data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 64\u201375. Springer, Heidelberg (2008)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science (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":"CK-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. 5012, pp. 653\u2013661. Springer, Heidelberg (2008)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Li, Y., Wang, J., Wang, J.: Frequent pattern mining with uncertain data. In: Proceedings of KDD (2009)","DOI":"10.1145\/1557019.1557030"},{"key":"10_CR10","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":"CK-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., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part I. LNCS, vol. 7238, pp. 272\u2013287. Springer, Heidelberg (2012)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-3-319-10160-6_11","volume-title":"Data Warehousing and Knowledge Discovery","author":"CK-S Leung","year":"2014","unstructured":"Leung, C.K.-S., MacKinnon, R.K.: BLIMP: a compact tree structure for uncertain frequent pattern mining. In: Bellatreche, L., Mohania, M.K. (eds.) DaWaK 2014. LNCS, vol. 8646, pp. 115\u2013123. Springer, Heidelberg (2014)"},{"issue":"2","key":"10_CR12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/1809400.1809425","volume":"11","author":"Carson Kai-Sang Leung","year":"2010","unstructured":"Leung, C.K.S., Brajczuk, D.A.: Efficient algorithms for the mining of constrained frequent patterns from uncertain data. In: SIGKDD Explorer, vol. 11, No. 2, pp. 123-130 (2009)","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","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, vol. 6118, pp. 480\u2013487. Springer, Heidelberg (2010)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Leung, C.K.S., Hao, B.: Mining of frequent itemsets from streams of uncertain data. In: Proceedings of ICDE (2009)","DOI":"10.1109\/ICDE.2009.157"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-23544-3_19","volume-title":"Data Warehousing and Knowledge Discovery","author":"CK-S Leung","year":"2011","unstructured":"Leung, C.K.-S., Jiang, F.: Frequent pattern mining from time-fading streams of uncertain data. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2011. LNCS, vol. 6862, pp. 252\u2013264. Springer, Heidelberg (2011)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-37574-3_5","volume-title":"Transactions on Large-Scale Data- and Knowledge-Centered Systems VIII","author":"H-L Nguyen","year":"2013","unstructured":"Nguyen, H.-L., Ng, W.-K., Woon, Y.-K.: Concurrent semi-supervised learning with active learning of data streams. In: Hameurlain, A., K\u00fcng, J., Wagner, R., Cuzzocrea, A., Dayal, U. (eds.) TLDKS VIII. LNCS, vol. 7790, pp. 113\u2013136. Springer, Heidelberg (2013)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-642-37487-6_33","volume-title":"Database Systems for Advanced Applications","author":"CK-S Leung","year":"2013","unstructured":"Leung, C.K.-S., Hayduk, Y.: Mining frequent patterns from uncertain data with mapreduce for big data analytics. In: Feng, L., Bressan, S., Winiwarter, W., Song, W., Meng, W. (eds.) DASFAA 2013, Part I. LNCS, vol. 7825, pp. 440\u2013455. Springer, Heidelberg (2013)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Li, F., Yi, K.: Finding frequent items in probabilistic data. In: Proceedings of SIGMOD (2008)","DOI":"10.1145\/1376616.1376698"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Bernecker, T., Kriegel, H.P., Renz, M., Verhein, F., Zuefle, A.: Probabilistic frequent itemset mining in uncertain databases. In: Proceedings of SIGKDD (2009)","DOI":"10.1145\/1557019.1557039"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Sun, L., Cheng, R., Cheung, D.W., Cheng, J.: Mining uncertain data with probabilistic guarantees. In: Proceedings of KDD (2010)","DOI":"10.1145\/1835804.1835841"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-31235-9_3","volume-title":"Scientific and Statistical Database Management","author":"T Bernecker","year":"2012","unstructured":"Bernecker, T., Kriegel, H.-P., Renz, M., Verhein, F., Zuefle, A.: Probabilistic frequent pattern growth for itemset mining in uncertain databases. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 38\u201355. Springer, Heidelberg (2012)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Wang, L., Cheng, R., Lee, S.D., Cheung, D.: Accelerating probabilistic frequent itemset mining: a model-based approach. In: Proceedings of CIKM (2010)","DOI":"10.1145\/1871437.1871494"},{"issue":"12","key":"10_CR23","doi-asserted-by":"publisher","first-page":"2170","DOI":"10.1109\/TKDE.2011.165","volume":"24","author":"L Wang","year":"2012","unstructured":"Wang, L., Cheung, D., Cheng, R., Lee, S.D., Yang, X.S.: Efficient mining of frequent item sets on large uncertain databases. Trans. Knowl. Data Min. 24(12), 2170\u20132183 (2012)","journal-title":"Trans. Knowl. Data Min."},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Calders, T., Garboni, C., Goethals, B.: Approximation of frequentness probability of itemsets in uncertain data. In: Proceedings of ICDM (2010)","DOI":"10.1109\/ICDM.2010.42"},{"issue":"11","key":"10_CR25","doi-asserted-by":"crossref","first-page":"1650","DOI":"10.14778\/2350229.2350277","volume":"5","author":"Yongxin Tong","year":"2012","unstructured":"Tong, Y., Chen, L., Cheng, Y., Yu, P.S.: Mining frequent itemsets over uncertain databases. In: Proceedings of VLDB (2012)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Tang, P., Peterson, E.A.: Mining probabilistic frequent closed itemsets in uncertain databases. In: Proceedings of ACMSE (2011)","DOI":"10.1145\/2016039.2016068"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Peterson, E.A., Tang, P.: Fast approximation of probabilistic frequent closed itemsets. In: Proceedings of ACMSE (2012)","DOI":"10.1145\/2184512.2184563"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Tong, Y., Chen, L., Ding, B.: Discovering threshold-based frequent closed itemsets over probabilistic data. In: Proceedings of ICDE (2012)","DOI":"10.1109\/ICDE.2012.51"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Liu, C., Chen, L., Zhang, C.: Mining probabilistic representative frequent patterns from uncertain data. In: Proceedings of SDM (2013)","DOI":"10.1137\/1.9781611972832.9"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Liu, C., Chen, L., Zhang, C.: Summarizing probabilistic frequent patterns : a fast approach. In: Proceedings of KDD (2013)","DOI":"10.1145\/2487575.2487618"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32025-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T21:44:46Z","timestamp":1559425486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32025-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319320243","9783319320250"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32025-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}