{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:01:20Z","timestamp":1725897680869},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325991"},{"type":"electronic","value":"9783642326004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32600-4_34","type":"book-chapter","created":{"date-parts":[[2012,8,20]],"date-time":"2012-08-20T05:02:17Z","timestamp":1345438937000},"page":"453-467","source":"Crossref","is-referenced-by-count":0,"title":["Mining Frequent Itemsets Using Node-Sets of a Prefix-Tree"],"prefix":"10.1007","author":[{"given":"Jun-Feng","family":"Qu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengchi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","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":"34_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proc. VLDB, pp. 487\u2013499 (1994)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: Proc. ACM SIGMOD, pp. 310\u2013321 (2002)","DOI":"10.1145\/564724.564727"},{"issue":"2","key":"34_CR4","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."},{"issue":"3","key":"34_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1839490.1839493","volume":"4","author":"J. Chen","year":"2010","unstructured":"Chen, J., Xiao, K.: Bisc: A Bitmap Itemset Support Counting Approach for Efficient Frequent Itemset Mining. ACM Trans. Knowl. Disc. Data\u00a04(3), 12:1\u201312:37 (2010)","journal-title":"ACM Trans. Knowl. Disc. Data"},{"key":"34_CR6","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":"34_CR7","unstructured":"Frequent Itemset Mining Implementations Repository, \n                    \n                      http:\/\/fimi.ua.ac.be\/"},{"key":"34_CR8","unstructured":"Frequent Pattern Mining Implementations, \n                    \n                      http:\/\/adrem.ua.ac.be\/~goethals\/software\/"},{"issue":"1","key":"34_CR9","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"},{"issue":"10","key":"34_CR10","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."},{"issue":"1","key":"34_CR11","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":"34_CR12","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":"34_CR13","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)"},{"key":"34_CR14","unstructured":"Lu, J., Ling, T.W., Chan, C.Y., Chen, T.: From Region Encoding to Extended Dewey: on Efficient Processing of XML Twig Pattern Matching. In: Proc. VLDB, pp. 193\u2013204 (2005)"},{"key":"34_CR15","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":"34_CR16","unstructured":"Schmidt-thieme, L.: Algorithmic Features of Eclat. In: Proc. IEEE ICDM Workshop FIMI (2004)"},{"issue":"3","key":"34_CR17","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1016\/j.patcog.2009.09.005","volume":"43","author":"W.K. Tsao","year":"2010","unstructured":"Tsao, W.K., Lee, A.J., Liu, Y.H., Chang, T.W., Lin, H.H.: A Data Mining Approach to Face Detection. Pattern Recogn.\u00a043(3), 1039\u20131049 (2010)","journal-title":"Pattern Recogn."},{"issue":"11","key":"34_CR18","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."},{"key":"34_CR19","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"},{"key":"34_CR20","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":"34_CR21","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":"3","key":"34_CR22","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."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32600-4_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:08:52Z","timestamp":1620130132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32600-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325991","9783642326004"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32600-4_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}