{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:11:15Z","timestamp":1743102675754,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":6,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789400758599"},{"type":"electronic","value":"9789400758605"}],"license":[{"start":{"date-parts":[[2012,12,11]],"date-time":"2012-12-11T00:00:00Z","timestamp":1355184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,12,11]],"date-time":"2012-12-11T00:00:00Z","timestamp":1355184000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-94-007-5860-5_113","type":"book-chapter","created":{"date-parts":[[2012,12,10]],"date-time":"2012-12-10T12:00:32Z","timestamp":1355140832000},"page":"937-945","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Analyzing Efficient Algorithms of Frequent Pattern Mining"],"prefix":"10.1007","author":[{"given":"Unil","family":"Yun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gangin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung-Jin","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,11]]},"reference":[{"issue":"11","key":"113_CR1","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"17","author":"D Burdick","year":"2005","unstructured":"Burdick D, Calimlim M, Flanick J, Gehrke J, Yiu T (2005) MAFIA: a maximal frequent itemset algorithm. Trans Knowl Data Eng 17(11):1490\u20131503","journal-title":"Trans Knowl Data Eng"},{"issue":"10","key":"113_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 (2005) Fast algorithms for frequent itemset mining using FP-trees. Trans Knowl Data Eng 17(10):1347\u20131362","journal-title":"Trans Knowl Data Eng"},{"issue":"1","key":"113_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Disc 15(1):55\u201386","journal-title":"Data Min Knowl Disc"},{"issue":"1","key":"113_CR3","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 (2004) Mining frequent patterns without candidate generation: a frequent pattern tree approach. Data Min Knowl Disc 8(1):53\u201387","journal-title":"Data Min Knowl Disc"},{"issue":"3","key":"113_CR5","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, Xu YJ (2004) Efficient mining of frequent patterns using ascending frequency ordered prefix-tree. Data Min Data Min Knowl Disc 9(3):249\u2013274","journal-title":"Data Min Data Min Knowl Disc"},{"key":"113_CR6","doi-asserted-by":"crossref","unstructured":"Uno T, Kiyomi M, Arimura H (2004) LCM ver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Workshop on frequent itemset mining implementations\u2014FIMI","DOI":"10.1145\/1133905.1133916"}],"container-title":["Lecture Notes in Electrical Engineering","IT Convergence and Security 2012"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-94-007-5860-5_113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T09:18:25Z","timestamp":1683796705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-94-007-5860-5_113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,11]]},"ISBN":["9789400758599","9789400758605"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-94-007-5860-5_113","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2012,12,11]]},"assertion":[{"value":"11 December 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}