{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:34:48Z","timestamp":1743014088325,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319957852"},{"type":"electronic","value":"9783319957869"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-95786-9_21","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T17:55:52Z","timestamp":1530640552000},"page":"272-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Novel Parallel Algorithm for Frequent Itemsets Mining in Large Transactional Databases"],"prefix":"10.1007","author":[{"given":"Huan","family":"Phan","sequence":"first","affiliation":[]},{"given":"Bac","family":"Le","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R Agrawal","year":"1996","unstructured":"Agrawal, R., Shafer, J.: Parallel mining of association rules. IEEE Trans. Knowl. Data Eng. 8, 962\u2013969 (1996)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.knosys.2006.08.005","volume":"20","author":"J Dong","year":"2007","unstructured":"Dong, J., Han, M.: BitTableFI: an efficient mining frequent itemsets algorithm. Knowl. Based Syst. 20(4), 329\u2013335 (2007)","journal-title":"Knowl. Based Syst."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.knosys.2008.03.011","volume":"21","author":"W Song","year":"2008","unstructured":"Song, W., Yang, B.: Index-BitTableFI: an improved algorithm for mining frequent itemsets. Knowl. Based Syst. 21, 507\u2013513 (2008)","journal-title":"Knowl. Based Syst."},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"e1207","DOI":"10.1002\/widm.1207","volume":"7","author":"P Fournier\u2010Viger","year":"2017","unstructured":"Fournier\u2010Viger, P., Lin, J.C.-W., Vo, B., Chi, T.T., Zhang, J., Le, H.B.: A survey of itemset mining. WIREs Data Min. Knowl. Discov. 7(4), e1207 (2017). https:\/\/doi.org\/10.1002\/widm.1207","journal-title":"WIREs Data Min. Knowl. Discov."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imilienski, T., Swami, A.: Mining association rules between sets of large databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, DC, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"Jiawei Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM-SIGMOD International Conference Management of Data (SIGMOD 2000), Dallas, TX, pp. 1\u201312 (2000)","journal-title":"ACM SIGMOD Record"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Lin, M.Y., Lee, P.Y., Hsueh, S.C.: Apriori-based frequent itemset mining algorithms on MapReduce. In: Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication, New York, NY, USA, p. 76 (2012)","DOI":"10.1145\/2184751.2184842"},{"key":"21_CR8","unstructured":"Moonesinghe, H.D.K., Chung, M.J., Tan, P.N.: Fast parallel mining of frequent itemsets. Technical report no. 2, Department of Computer Science and Engineering, Michigan State University (2006)"},{"issue":"9","key":"21_CR9","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"ZH Deng","year":"2012","unstructured":"Deng, Z.H., Wang, Z.H., Jiang, J.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":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-319-32149-3_25","volume-title":"Parallel Processing and Applied Mathematics","author":"Y Djenouri","year":"2016","unstructured":"Djenouri, Y., Bendjoudi, A., Djenouri, D., Habbas, Z.: Parallel BSO algorithm for association rules mining using master\/worker paradigm. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K., Kitowski, J., Wiatr, K. (eds.) PPAM 2015. LNCS, vol. 9573, pp. 258\u2013268. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32149-3_25"}],"container-title":["Lecture Notes in Computer Science","Advances in Data Mining. Applications and Theoretical Aspects"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95786-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:25:12Z","timestamp":1710260712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95786-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319957852","9783319957869"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95786-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"4 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Industrial Conference on Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"incdm2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.data-mining-forum.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}