{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:11:51Z","timestamp":1725624711915},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642246494"},{"type":"electronic","value":"9783642246500"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24650-0_5","type":"book-chapter","created":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T10:08:55Z","timestamp":1319278135000},"page":"40-53","source":"Crossref","is-referenced-by-count":2,"title":["Distributed Mining of Constrained Frequent Sets from Uncertain Data"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"Cuzzocrea","sequence":"first","affiliation":[]},{"given":"Carson K.","family":"Leung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., et al.: Frequent pattern mining with uncertain data. In: Proc. KDD 2009, pp. 29\u201337 (2009)","DOI":"10.1145\/1557019.1557030"},{"issue":"6","key":"5_CR2","first-page":"962","volume":"8","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Shafer, J.: Parallel mining of association rules. IEEE TKDE\u00a08(6), 962\u2013969 (1996)","journal-title":"IEEE TKDE"},{"key":"5_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., et al.: Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bernecker, T., et al.: Probabilistic frequent itemset mining in uncertain databases. In: Proc. KDD 2009, pp. 119\u2013127 (2009)","DOI":"10.1145\/1557019.1557039"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., et al.: A fast distributed algorithm for mining association rules. In: Proc. PDIS 1996, pp. 31\u201342 (1996)","DOI":"10.1109\/PDIS.1996.568665"},{"key":"5_CR7","series-title":"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., et al.: Mining frequent itemsets from uncertain data. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol.\u00a04426, pp. 47\u201358. Springer, Heidelberg (2007)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Coenen, F., et al.: T-trees, vertical partitioning and distributed association rule mining. In: Proc. IEEE ICDM 2003, pp. 513\u2013516 (2003)","DOI":"10.1109\/ICDM.2003.1250965"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/11535331_23","volume-title":"Advances in Spatial and Temporal Databases","author":"X. Dai","year":"2005","unstructured":"Dai, X., Yiu, M.L., Mamoulis, N., Tao, Y., Vaitis, M.: Probabilistic spatial queries on existentially uncertain data. In: Medeiros, C.B., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol.\u00a03633, pp. 400\u2013417. Springer, Heidelberg (2005)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"El-Hajj, M., Za\u00efane, O.R.: Parallel leap: large-scale maximal pattern mining in a distributed environment. In: Proc. ICPADS 2006, pp. 135\u2013142 (2006)","DOI":"10.1109\/ICPADS.2006.77"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Grahne, G., et al.: Efficient mining of constrained correlated sets. In: Proc. IEEE ICDE 2000, pp. 512\u2013521 (2000)","DOI":"10.1109\/ICDE.2000.839450"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., et al.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery\u00a08(1), 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/958942.958944","volume":"28","author":"L.V.S. Lakshmanan","year":"2003","unstructured":"Lakshmanan, L.V.S., Leung, C.K.-S., Ng, R.: Efficient dynamic mining of constrained frequent sets. ACM TODS\u00a028(4), 337\u2013389 (2003)","journal-title":"ACM TODS"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S.: Frequent itemset mining with constraints. In: Encyclopedia of Database Systems, pp. 1179\u20131183 (2009)","DOI":"10.1007\/978-0-387-39940-9_170"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/1809400.1809425","volume":"11","author":"C.K.-S. Leung","year":"2009","unstructured":"Leung, C.K.-S., Brajczuk, D.A.: Efficient algorithms for the mining of constrained frequent patterns from uncertain data. ACM SIGKDD Explorations\u00a011(2), 123\u2013130 (2009)","journal-title":"ACM SIGKDD Explorations"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., Hao, B.: Mining of frequent itemsets from streams of uncertain data. In: Proc. IEEE ICDE 2009, pp. 1663\u20131670 (2009)","DOI":"10.1109\/ICDE.2009.157"},{"key":"5_CR17","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., et al.: 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":"5_CR18","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., et al.: Mining uncertain data for frequent itemsets that satisfy aggregate constraints. In: Proc. ACM SAC 2010, pp. 1034\u20131038 (2010)","DOI":"10.1145\/1774088.1774305"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Ng, R.T., et al.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proc. ACM SIGMOD 1998, pp. 13\u201324 (1998)","DOI":"10.1145\/276304.276307"},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/B:DAMI.0000023674.74932.4c","volume":"8","author":"J. Pei","year":"2004","unstructured":"Pei, J., et al.: Pushing convertible constraints in frequent itemset mining. Data Mining and Knowledge Discovery\u00a08(3), 227\u2013252 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"4","key":"5_CR21","first-page":"458","volume":"7","author":"A. Schuster","year":"2005","unstructured":"Schuster, A., et al.: A high-performance distributed algorithm for mining association rules. KAIS\u00a07(4), 458\u2013475 (2005)","journal-title":"KAIS"},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"M.J. Zaki","year":"1999","unstructured":"Zaki, M.J.: Parallel and distributed association mining: a survey. IEEE Concurrency\u00a07(4), 14\u201325 (1999)","journal-title":"IEEE Concurrency"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, Q., et al.: Finding frequent items in probabilistic data. In: Proc. ACM SIGMOD 2008, pp. 819\u2013832 (2008)","DOI":"10.1145\/1376616.1376698"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24650-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,26]],"date-time":"2020-06-26T07:10:35Z","timestamp":1593155435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24650-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642246494","9783642246500"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24650-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}