{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:41:09Z","timestamp":1743158469953,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299575"},{"type":"electronic","value":"9783642299582"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-29958-2_7","type":"book-chapter","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T13:19:58Z","timestamp":1337519998000},"page":"98-116","source":"Crossref","is-referenced-by-count":0,"title":["UF-Evolve: Uncertain Frequent Pattern Mining"],"prefix":"10.1007","author":[{"given":"Shu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/11779568_40","volume-title":"Advances in Applied Artificial Intelligence","author":"M. Adnan","year":"2006","unstructured":"Adnan, M., Alhajj, R., Barker, K.: Constructing Complete FP-Tree for Incremental Mining of Frequent Patterns in Dynamic Databases. In: Ali, M., Dapoigny, R. (eds.) IEA\/AIE 2006. LNCS (LNAI), vol.\u00a04031, pp. 363\u2013372. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Antova, L., Jansen, T., Koch, C., Olteanu, D.: Fast and Simple Relational Processing of Uncertain Data. In: ICDE 2008, pp. 983\u2013992 (2008)","key":"7_CR2","DOI":"10.1109\/ICDE.2008.4497507"},{"doi-asserted-by":"crossref","unstructured":"Borgelt, C.: An Implementation of the FP-growth Algorithm. In: OSDM 2005, Chicago, Illinois, USA, August 21, pp. 1\u20135 (2005)","key":"7_CR3","DOI":"10.1145\/1133905.1133907"},{"unstructured":"Chau, M., Cheng, R., Kao, B.: Uncertain Data Mining: A New Research Direction. In Proceedings of the Workshop on the Sciences of the Artificial, Hualien, Taiwan, December 7-8, pp. 1\u20138 (2005)","key":"7_CR4"},{"doi-asserted-by":"crossref","unstructured":"Cheung, W., Zaiane, O.R.: Incremental Mining of Frequent Patterns Without Candidate Generation or Support Constraint. In: Proceedings of the Seventh International Database Engineering and Applications Symposium (IDEAS 2003), pp. 111\u2013116 (2003)","key":"7_CR5","DOI":"10.1109\/IDEAS.2003.1214917"},{"key":"7_CR6","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":"7_CR7","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-47922-8_13","volume-title":"Advances in Artificial Intelligence","author":"C.I. Ezeife","year":"2002","unstructured":"Ezeife, C.I., Su, Y.: Mining Incremental Association Rules with Generalized FP-Tree. In: Cohen, R., Spencer, B. (eds.) Canadian AI 2002. LNCS (LNAI), vol.\u00a02338, pp. 147\u2013160. Springer, Heidelberg (2002)"},{"key":"7_CR8","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 Mining and Knowledge Discovery\u00a08, 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"2424","DOI":"10.1016\/j.eswa.2007.04.009","volume":"34","author":"T.P. Hong","year":"2008","unstructured":"Hong, T.P., Lin, C.W., Wu, Y.L.: Incrementally fast updated frequent pattern trees. Expert Systems with Applications\u00a034, 2424\u20132435 (2008)","journal-title":"Expert Systems with Applications"},{"doi-asserted-by":"crossref","unstructured":"Leung, C.K.S., Carmichael, C., Hao, B.: Efficient Mining of Frequent Patterns from Uncertain Data. In: ICDM-DUNE 2007, pp. 1\u201319 (2007)","key":"7_CR10","DOI":"10.1109\/ICDMW.2007.84"},{"key":"7_CR11","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)"},{"unstructured":"Li, H.F., Lee, S.Y., Shan, M.K.: An Efficient Algorithm for Mining Frequent Itemsets over the Entire History of Data Streams, http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary? doi=10.1.1.81.9955","key":"7_CR12"},{"unstructured":"IBM Quest Market-Basket Synthetic Data Generator, http:\/\/www.cs.loyola.edu\/~cgiannel\/assoc_gen.html","key":"7_CR13"}],"container-title":["Lecture Notes in Business Information Processing","Enterprise Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29958-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:21:10Z","timestamp":1743157270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29958-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299575","9783642299582"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29958-2_7","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2012]]}}}