{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:40:07Z","timestamp":1744026007177,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325830"},{"type":"electronic","value":"9783642325847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32584-7_17","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:53:13Z","timestamp":1346154793000},"page":"205-216","source":"Crossref","is-referenced-by-count":4,"title":["A Fast Algorithm for Frequent Itemset Mining Using Patricia* Structures"],"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":"17_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":"17_CR2","doi-asserted-by":"crossref","unstructured":"Calders, T., Garboni, C., Goethals, B.: Approximation of Frequentness Probability of Itemsets in Uncertain Data. In: Proc. IEEE ICDM, pp. 749\u2013754 (2010)","DOI":"10.1109\/ICDM.2010.42"},{"issue":"2","key":"17_CR3","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":"10","key":"17_CR4","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":"17_CR5","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."},{"key":"17_CR6","volume-title":"The Art of Computer Programming, vol 3: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming, vol 3: Sorting and Searching. Addison Wesley, Reading (1973)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Lam, H.T., Calders, T.: Mining Top-K Frequent Items in a Data Stream with Flexible Sliding Windows. In: Proc. ACM SIGKDD, pp. 283\u2013292 (2010)","DOI":"10.1145\/1835804.1835842"},{"issue":"3","key":"17_CR8","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":"17_CR9","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":"17_CR10","unstructured":"Pietracaprina, A., Zandolin, D.: Mining Frequent Itemsets Using Patricia Tries*. In: Proc. IEEE ICDM Workshop FIMI (2003)"},{"key":"17_CR11","unstructured":"Schmidt-thieme, L.: Algorithmic Features of Eclat. In: Proc. IEEE ICDM Workshop FIMI (2004)"},{"issue":"11","key":"17_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."},{"key":"17_CR13","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"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32584-7_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:10:05Z","timestamp":1744024205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32584-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325830","9783642325847"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32584-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}