{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:59:17Z","timestamp":1725857957138},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319401799"},{"type":"electronic","value":"9783319401805"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40180-5_10","type":"book-chapter","created":{"date-parts":[[2016,6,20]],"date-time":"2016-06-20T13:36:32Z","timestamp":1466429792000},"page":"136-150","source":"Crossref","is-referenced-by-count":1,"title":["A Comparative Analysis of Algorithms for Mining Frequent Itemsets"],"prefix":"10.1007","author":[{"given":"Vyacheslav","family":"Busarov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalia","family":"Grafeeva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Mikhailova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,21]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining associations between sets of items in large databases. In: ACM SIGMOD International Conference on Management of Data, SIGMOD 1993, Washington, DC, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"10_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: 20th International Conference on Very Large Databases, VLDB 1994, Santiago, Chile, pp. 487\u2013499 (1994)"},{"issue":"1","key":"10_CR3","first-page":"307","volume":"12","author":"R Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H.: Fast discovery of association rules. Adv. Knowl. Discov. Data Min. 12(1), 307\u2013328 (1996). AAAI MIT Press","journal-title":"Adv. Knowl. Discov. Data Min."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, H., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD International Conference on Management of Data, SIGMOD 2000, Dallas, TX, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"issue":"3","key":"10_CR5","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372\u2013390 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Borgelt, C.: Keeping things simple: finding frequent item sets by recursive elimination. In: Open Source Data Mining Workshop, OSDM 2005, Chicago, IL, pp. 66\u201370. ACM Press, New York (2005)","DOI":"10.1145\/1133905.1133914"},{"issue":"6","key":"10_CR7","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1080\/07408170600897460","volume":"39","author":"J Pei","year":"2007","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-mine: fast and space-preserving frequent pattern mining in large databases. IIE Trans. 39(6), 593\u2013605 (2007)","journal-title":"IIE Trans."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Workshop on Frequent Itemset Mining Implementations, FIMI 2004, Brighton, UK (2004)","DOI":"10.1145\/1133905.1133916"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining. In: Open Source Data Mining Workshop, OSDM 2005, Chicago, IL, pp. 77\u201386. ACM Press, New York (2005)","DOI":"10.1145\/1133905.1133916"},{"issue":"9","key":"10_CR10","doi-asserted-by":"crossref","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"ZH Deng","year":"2012","unstructured":"Deng, Z.H., Wang, Z., Jiang, J.: A new algorithm for fast mining frequent itemsets using N-lists. Sci. China Inf. Sci. 55(9), 2008\u20132030 (2012)","journal-title":"Sci. China Inf. Sci."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, Washington, DC, pp. 326\u2013335. ACM Press, New York (2003)","DOI":"10.1145\/956750.956788"},{"issue":"6","key":"10_CR12","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1080\/18756891.2010.9727736","volume":"3","author":"ZH Deng","year":"2010","unstructured":"Deng, Z.H., Wang, Z.: A new fast vertical method for mining frequent patterns. Int. J. Comput. Intell. Syst. 3(6), 733\u2013744 (2010)","journal-title":"Int. J. Comput. Intell. Syst."},{"issue":"10","key":"10_CR13","doi-asserted-by":"crossref","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"ZH Deng","year":"2014","unstructured":"Deng, Z.H., Lv, S.L.: Fast mining frequent itemsets using Nodesets. Expert Syst. Appl. 41(10), 4505\u20134512 (2014)","journal-title":"Expert Syst. Appl."},{"issue":"10","key":"10_CR14","doi-asserted-by":"crossref","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"ZH Deng","year":"2015","unstructured":"Deng, Z.H., Lv, S.L.: PrePost+: an efficient N-lists-based algorithm for mining frequent itemsets via Children-Parent Equivalence pruning. Expert Syst. Appl. 42(10), 5424\u20135432 (2015)","journal-title":"Expert Syst. Appl."}],"container-title":["Communications in Computer and Information Science","Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40180-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:03:39Z","timestamp":1568073819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40180-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401799","9783319401805"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40180-5_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}