{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:52:10Z","timestamp":1743054730667,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030229986"},{"type":"electronic","value":"9783030229993"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-22999-3_20","type":"book-chapter","created":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T23:04:56Z","timestamp":1561676696000},"page":"216-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Algorithm for Deriving Frequent Itemsets from Lossless Condensed Representation"],"prefix":"10.1007","author":[{"given":"JianTao","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Pei","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chieh","family":"Lo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Wei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"20_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of International Conference on Very Large Data Bases, pp. 487\u2013499 (1994)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45372-5_8","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"J-F Boulicaut","year":"2000","unstructured":"Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Approximation of frequency queries by means of free-sets. In: Zighed, D.A., Komorowski, J., \u017bytkow, J. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 75\u201385. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45372-5_8"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45681-3_7","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"T Calders","year":"2002","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS, vol. 2431, pp. 74\u201386. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45681-3_7"},{"key":"20_CR4","first-page":"3569","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Gomariz, A., Gueniche, T., Soltani, A., Wu, C., Tseng, V.S.: SPMF: a Java open-source pattern mining library. J. Mach. Learn. Res. 15, 3569\u20133573 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"20_CR5","first-page":"409","volume":"4","author":"S Gupta","year":"2014","unstructured":"Gupta, S., Mamtora, R.: A survey on association rule mining in market basket analysis. Int. J. Inf. Comput. Technol. 4(4), 409\u2013414 (2014)","journal-title":"Int. J. Inf. Comput. Technol."},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K Gouda","year":"2005","unstructured":"Gouda, K., Zaki, M.: GenMax: an efficient algorithm for mining maximal frequent itemsets. Data Min. Knowl. Discov. 11(3), 223\u2013242 (2005)","journal-title":"Data Min. Knowl. Discov."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2006","unstructured":"Lucchese, C., Orlando, S., Perego, R.: Fast and memory efficient mining of frequent closed itemsets. IEEE Trans. Knowl. Data Eng. 18(1), 21\u201336 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Liu, J., Shang, J., Wang, C., Ren, X., Han, J.: Mining quality phrases from massive text corpora. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 1729\u20131744 (2015)","DOI":"10.1145\/2723372.2751523"},{"key":"20_CR10","unstructured":"Mohammed, E.H., Zaiane, O.R.: COFI-tree mining: a new approach to pattern growth with reduced candidacy generation. In: Proceedings of IEEE International Conference on Data Mining (2003)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proceedings of 7th International Conference on Database Theory, pp. 398\u2013416 (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Inf. Syst. 24(1), 25\u201346 (1999)","journal-title":"Inf. Syst."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: An effective hash-based algorithm for mining association rules. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 175\u2013186 (1995)","DOI":"10.1145\/568271.223813"},{"key":"20_CR14","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, D., Yang, S.: H-Mine: hyper-structure mining of frequent patterns in large databases. In: Proceedings of IEEE International Conference on Data Mining, pp. 441\u2013448 (2001)"},{"issue":"14","key":"20_CR15","first-page":"47","volume":"63","author":"S Prabha","year":"2013","unstructured":"Prabha, S., Shanmugapriya, S., Duraiswamy, K.: A survey on closed frequent pattern mining. Int. J. Comput. Appl. 63(14), 47\u201352 (2013)","journal-title":"Int. J. Comput. Appl."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Ting, S.L., Shum, C.C., Kwok, S.K., Tsang, A.H.C., Lee, W.B.: Data mining in biomedicine: current applications and further directions for research. J. Softw. Eng. Appl. 150\u2013159 (2009)","DOI":"10.4236\/jsea.2009.23022"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: Proceedings of 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 236\u2013245 (2003)","DOI":"10.1145\/956750.956779"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","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":"20_CR19","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.J.: CHARM: an efficient algorithm for closed itemset mining. In: Proceedings of SIAM International Conference on Data Mining, pp. 457\u2013473 (2002)","DOI":"10.1137\/1.9781611972726.27"},{"issue":"4","key":"20_CR20","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1142\/S0219622008003150","volume":"7","author":"Q Zhang","year":"2008","unstructured":"Zhang, Q., Segall, R.: Web mining: a survey of current research, techniques, and software. Int. J. Inf. Technol. Decis. Making 7(4), 683\u2013720 (2008)","journal-title":"Int. J. Inf. Technol. Decis. Making"},{"key":"20_CR21","unstructured":"Source code of the implemented LevelWise algorithm released in SPMF. http:\/\/www.philippe-fournier-viger.com\/spmf\/LevelWise"},{"key":"20_CR22","unstructured":"Source code of the proposed DFI-Growth algorithm released in SPMF. http:\/\/www.philippe-fournier-viger.com\/spmf\/DFI-Growth"}],"container-title":["Lecture Notes in Computer Science","Advances and Trends in Artificial Intelligence. From Theory to Practice"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22999-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T22:08:00Z","timestamp":1620770880000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22999-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030229986","9783030229993"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22999-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IEA\/AIE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Graz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ieaaie2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ieaaie2019.ist.tugraz.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"151","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":"41","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":"32","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":"27% - 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":"3","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":"4","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)"}}]}}