{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:27:57Z","timestamp":1725895677321},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642342882"},{"type":"electronic","value":"9783642342899"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-34289-9_13","type":"book-chapter","created":{"date-parts":[[2012,10,6]],"date-time":"2012-10-06T05:46:55Z","timestamp":1349502415000},"page":"111-120","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic FP-Tree Pruning for Concurrent Frequent Itemsets Mining"],"prefix":"10.1007","author":[{"given":"Wei","family":"Song","sequence":"first","affiliation":[]},{"given":"Wenbo","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jinhong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"487","volume-title":"20th International Conference on Very Large Data Bases","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: 20th International Conference on Very Large Data Bases, pp. 487\u2013499. Morgan Kaufmann, Santiago de Chile (1994)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s10618-010-0185-7","volume":"21","author":"A. Pietracaprina","year":"2010","unstructured":"Pietracaprina, A., Riondato, M., Upfal, E., Vandin, F.: Mining Top-K Frequent Itemsets Through Progressive Sampling. Data Min. Knowl. Discov.\u00a021, 310\u2013326 (2010)","journal-title":"Data Min. Knowl. Discov."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.knosys.2008.03.011","volume":"21","author":"W. Song","year":"2008","unstructured":"Song, W., Yang, B.R., Xu, Z.Y.: Index-BitTableFI: An Improved Algorithm for Mining Frequent Itemsets. Knowl.-Based Syst.\u00a021, 507\u2013513 (2008)","journal-title":"Knowl.-Based Syst."},{"key":"13_CR4","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, 53\u201387 (2004)","journal-title":"Data Min. Knowl. Discov."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G. Grahne","year":"2005","unstructured":"Grahne, G., Zhu, J.: Fast Algorithms for Frequent Itemset Mining using FP-Trees. IEEE Trans. Knowl. Data Eng.\u00a017, 1347\u20131362 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.is.2005.11.004","volume":"32","author":"G. Liu","year":"2007","unstructured":"Liu, G., Lu, H., Yu, J.X.: CFP-Tree: A Compact Disk-Based Structure for Storing and Querying Frequent Itemsets. Inform. Syst.\u00a032, 295\u2013319 (2007)","journal-title":"Inform. Syst."},{"key":"13_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-258-0","volume-title":"Understanding Concurrent Systems","author":"A.W. Roscoe","year":"2010","unstructured":"Roscoe, A.W.: Understanding Concurrent Systems. Springer, London (2010)"},{"key":"13_CR8","unstructured":"Requent Itemset Mining Implementations Repository, \n                    \n                      http:\/\/fimi.ua.ac.be"},{"key":"13_CR9","unstructured":"IBM Quest Market-Basket Synthetic Data Generator, \n                    \n                      http:\/\/www.cs.loyola.edu\/~cgiannel\/assoc_gen.html"}],"container-title":["Communications in Computer and Information Science","Computational Intelligence and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34289-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:33:44Z","timestamp":1557275624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34289-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642342882","9783642342899"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34289-9_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}