{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:19:55Z","timestamp":1759335595946},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642136566"},{"type":"electronic","value":"9783642136573"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13657-3_51","type":"book-chapter","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T11:29:16Z","timestamp":1274182156000},"page":"480-487","source":"Crossref","is-referenced-by-count":39,"title":["Efficient Pattern Mining of Uncertain Data with Sampling"],"prefix":"10.1007","author":[{"given":"Toon","family":"Calders","sequence":"first","affiliation":[]},{"given":"Calin","family":"Garboni","sequence":"additional","affiliation":[]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1557019.1557030","volume-title":"Proc. of KDD 2009","author":"C.C. Aggarwal","year":"2009","unstructured":"Aggarwal, C.C., Li, Y., Wang, J., Wang, J.: Frequent pattern mining with uncertain data. In: Proc. of KDD 2009, pp. 29\u201338. ACM, New York (2009)"},{"key":"51_CR2","first-page":"487","volume-title":"Proc. of VLDB 1994","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. of VLDB 1994, pp. 487\u2013499. Morgan Kaufmann Publishers Inc, San Francisco (1994)"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Chui, C.K., Kao, B.: A decremental approach for mining frequent itemsets from uncertain data. In: Washio, et al [9], pp. 64\u201375","DOI":"10.1007\/978-3-540-68125-0_8"},{"key":"51_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":"51_CR5","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/0-387-25465-X_17","volume-title":"The Data Mining and Knowledge Discovery Handbook","author":"B. Goethals","year":"2005","unstructured":"Goethals, B.: Frequent set mining. In: The Data Mining and Knowledge Discovery Handbook, ch.\u00a017, pp. 377\u2013397. Springer, Heidelberg (2005)"},{"issue":"1","key":"51_CR6","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., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov.\u00a08(1), 53\u201387 (2004)","journal-title":"Data Min. Knowl. Discov."},{"key":"51_CR7","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: Washio, et al [9], pp. 653\u2013661","DOI":"10.1007\/978-3-540-68125-0_61"},{"key":"51_CR8","first-page":"441","volume-title":"Proc. of ICDM 2001","author":"J. Pei","year":"2001","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-mine: Hyper-structure mining of frequent patterns in large databases. In: Proc. of ICDM 2001, Washington, DC, USA, pp. 441\u2013448. IEEE Computer Society, Los Alamitos (2001)"},{"key":"51_CR9","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Advances in Knowledge Discovery and Data Mining","year":"2008","unstructured":"Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.): PAKDD 2008. LNCS (LNAI), vol.\u00a05012. Springer, Heidelberg (2008)"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/956750.956788","volume-title":"Proc. of KDD 2003","author":"M.J. Zaki","year":"2003","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: Getoor, L., Senator, T.E., Domingos, P., Faloutsos, C. (eds.) Proc. of KDD 2003, pp. 326\u2013335. ACM, New York (2003)"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proc. of KDD 1997, pp. 283\u2013286 (1997)","DOI":"10.1007\/978-1-4615-5669-5_1"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13657-3_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:41:18Z","timestamp":1606167678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13657-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136566","9783642136573"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13657-3_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}