{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:05Z","timestamp":1725489125967},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322808"},{"type":"electronic","value":"9783642322815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32281-5_8","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T12:59:36Z","timestamp":1344862776000},"page":"71-82","source":"Crossref","is-referenced-by-count":1,"title":["A High-Performance Algorithm for Frequent Itemset Mining"],"prefix":"10.1007","author":[{"given":"Jun-Feng","family":"Qu","sequence":"first","affiliation":[]},{"given":"Mengchi","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1132956.1132958","volume":"38","author":"A. Ceglar","year":"2006","unstructured":"Ceglar, A., Roddick, J.F.: Association mining. ACM Comput. Surv.\u00a038(2), 1\u201342 (2006)","journal-title":"ACM Comput. Surv."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Wang, H., Wang, W., Yang, J., Yu, P.S.: Clustering by pattern similarity in large data sets. In: Proc. ACM SIGMOD, pp. 394\u2013405 (2002)","DOI":"10.1145\/564736.564737"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, H., Yan, X., Han, J., Yu, P.S.: Direct discriminative pattern mining for effective classification. In: Proc. ICDE, pp. 169\u2013178 (2008)","DOI":"10.1109\/ICDE.2008.4497425"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"8_CR5","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. VLDB, pp. 487\u2013499 (1994)"},{"key":"8_CR6","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. In: Proc. VLDB, pp. 432\u2013444 (1995)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Gerd, S., Lakhal, L.: Mining frequent patterns with counting inference. SIGKDD Explor. Newsl.\u00a02(2), 66\u201375 (2000)","journal-title":"SIGKDD Explor. Newsl."},{"issue":"1","key":"8_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 Min. Knowl. Disc.\u00a08(1), 53\u201387 (2004)","journal-title":"Data Min. Knowl. Disc."},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng.\u00a012(3), 372\u2013390 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1109\/TKDE.2006.1599386","volume":"18","author":"M. Song","year":"2006","unstructured":"Song, M., Rajasekaran, S.: A transaction mapping algorithm for frequent itemsets mining. IEEE Trans. Knowl. Data Eng.\u00a018(4), 472\u2013481 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: Proc. ACM SIGKDD, pp. 326\u2013335 (2003)","DOI":"10.1145\/956755.956788"},{"issue":"11","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1016\/j.ins.2009.01.010","volume":"179","author":"Y.J. Tsay","year":"2009","unstructured":"Tsay, Y.J., Hsu, T.J., Yu, J.R.: Fiut: A new method for mining frequent itemsets. Inf. Sci.\u00a0179(11), 1724\u20131737 (2009)","journal-title":"Inf. Sci."},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00778-006-0025-y","volume":"16","author":"A. Ghoting","year":"2007","unstructured":"Ghoting, A., Buehrer, G., Parthasarathy, S., Kim, D., Nguyen, A., Chen, Y.K., Dubey, P.: Cache-conscious frequent pattern mining on modern and emerging processors. The VLDB Journal\u00a016(1), 77\u201396 (2007)","journal-title":"The VLDB Journal"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Schlegel, B., Gemulla, R., Lehner, W.: Memory-efficient frequent-itemset mining. In: Proc. EDBT, pp. 461\u2013472 (2011)","DOI":"10.1145\/1951365.1951420"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: Lcm ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Proc. IEEE ICDM Workshop FIMI (2004)","DOI":"10.1145\/1133905.1133916"},{"issue":"10","key":"8_CR16","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(10), 1347\u20131362 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"8_CR17","unstructured":"Liu, G., Lu, H., Yu, J.X., Wang, W., Xiao, X.: Afopt: An efficient implementation of pattern growth approach. In: Proc. IEEE ICDM Workshop FIMI (2003)"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1023\/B:DAMI.0000040905.52966.1a","volume":"9","author":"G. Liu","year":"2004","unstructured":"Liu, G., Lu, H., Lou, W., Xu, Y., Yu, J.X.: Efficient mining of frequent patterns using ascending frequency ordered prefix-tree. Data Min. Knowl. Disc.\u00a09(3), 249\u2013274 (2004)","journal-title":"Data Min. Knowl. Disc."},{"key":"8_CR19","unstructured":"Schmidt-thieme, L.: Algorithmic features of eclat. In: Proc. IEEE ICDM Workshop FIMI (2004)"},{"key":"8_CR20","unstructured":"FP-Growth Implementation, \n                    \n                      http:\/\/adrem.ua.ac.be\/~goethals\/software\/"},{"key":"8_CR21","unstructured":"Frequent Itemset Mining Implementations Repository, \n                    \n                      http:\/\/fimi.ua.ac.be\/"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32281-5_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:59:48Z","timestamp":1620129588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32281-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322808","9783642322815"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32281-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}