{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T02:09:46Z","timestamp":1767665386074,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681243"},{"type":"electronic","value":"9783540681250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68125-0_61","type":"book-chapter","created":{"date-parts":[[2008,5,10]],"date-time":"2008-05-10T07:40:05Z","timestamp":1210405205000},"page":"653-661","source":"Crossref","is-referenced-by-count":137,"title":["A Tree-Based Approach for Frequent Pattern Mining from Uncertain Data"],"prefix":"10.1007","author":[{"given":"Carson Kai-Sang","family":"Leung","sequence":"first","affiliation":[]},{"given":"Mark Anthony F.","family":"Mateo","sequence":"additional","affiliation":[]},{"given":"Dale A.","family":"Brajczuk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. VLDB, pp. 487\u2013499 (1994)","key":"61_CR1"},{"key":"61_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/11430919_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"F. Bonchi","year":"2005","unstructured":"Bonchi, F., Lucchese, C.: Pushing tougher constraints in frequent pattern mining. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 114\u2013124. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Cheung, W., Za\u00efane, O.R.: Incremental mining of frequent patterns without candidate generation or support constraint. In: Proc. IDEAS, pp. 111\u2013116 (2003)","key":"61_CR3","DOI":"10.1109\/IDEAS.2003.1214917"},{"key":"61_CR4","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., Kao, B., Hung, E.: 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":"61_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., et al.: Probabilistic spatial queries on existentially uncertain data. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol.\u00a03633, pp. 400\u2013417. Springer, Heidelberg (2005)"},{"unstructured":"El-Hajj, M., Za\u00efane, O.R.: COFI-tree mining: a new approach to pattern growth with reduced candidacy generation. In: Proc. FIMI (2003)","key":"61_CR6"},{"unstructured":"Giannella, C., Han, J., et al.: Mining frequent patterns in data streams at multiple time granularities. In: Data Mining: Next Generation Challenges and Future Directions, ch. 6. AAAI\/MIT Press (2004)","key":"61_CR7"},{"doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. SIGMOD, pp. 1\u201312 (2000)","key":"61_CR8","DOI":"10.1145\/342009.335372"},{"issue":"4","key":"61_CR9","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.T.: Efficient dynamic mining of constrained frequent sets. ACM TODS\u00a028(4), 337\u2013389 (2003)","journal-title":"ACM TODS"},{"doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., Carmichael, C.L., Hao, B.: Efficient mining of frequent patterns from uncertain data. In: Proc. IEEE ICDM Workshops, pp. 489\u2013494 (2007)","key":"61_CR10","DOI":"10.1109\/ICDMW.2007.84"},{"key":"61_CR11","series-title":"LNCS (LNAI)","first-page":"644","volume-title":"PAKDD 2008","author":"C.K.-S. Leung","year":"2008","unstructured":"Leung, C.K.-S., Irani, P.P., Carmichael, C.L.: FIsViz: A frequent itemset visualizer. In: Washio, T., et al. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 644\u2013652. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., Khan, Q.I.: DSTree: a tree structure for the mining of frequent sets from data streams. In: Proc. IEEE ICDM, pp. 928\u2013932 (2006)","key":"61_CR12","DOI":"10.1109\/ICDM.2006.62"},{"issue":"1","key":"61_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/568574.568581","volume":"4","author":"C.K.-S. Leung","year":"2002","unstructured":"Leung, C.K.-S., Lakshmanan, L.V.S., Ng, R.T.: Exploiting succinct constraints using FP-trees. SIGKDD Explorations\u00a04(1), 40\u201349 (2002)","journal-title":"SIGKDD Explorations"},{"doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, L.V.S., et al.: Exploratory mining and pruning optimizations of constrained associations Rules. In: Proc. SIGMOD, pp. 13\u201324 (1998)","key":"61_CR14","DOI":"10.1145\/276304.276307"},{"unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proc. SIGMOD Workshop on DMKD, pp. 21\u201330 (2000)","key":"61_CR15"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68125-0_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:49:21Z","timestamp":1738216161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68125-0_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681243","9783540681250"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68125-0_61","relation":{},"subject":[]}}