{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:17:51Z","timestamp":1743049071484,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959290"},{"type":"electronic","value":"9783319959306"}],"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-95930-6_39","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T06:12:40Z","timestamp":1530771160000},"page":"425-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["GridWall: A Novel Condensed Representation of Frequent Itemsets"],"prefix":"10.1007","author":[{"given":"Weidong","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianqiang","family":"Mei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongjuan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongqiu","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Moens, S., Aksehirli, E., Goethals, B.: Frequent itemset mining for big data. In: IEEE International Conference on Big Data, pp. 111\u2013118 (2013)","DOI":"10.1109\/BigData.2013.6691742"},{"issue":"1","key":"39_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10115-007-0111-5","volume":"17","author":"G Liu","year":"2008","unstructured":"Liu, G., Li, J., Wong, L.: A new concise representation of frequent itemsets using generators and a positive border. Knowl. Inf. Syst. 17(1), 35\u201356 (2008)","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"39_CR3","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"VS Tseng","year":"2015","unstructured":"Tseng, V.S., Wu, C., Fournier-Viger, P., Yu, P.S.: Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Trans. Knowl. Data Eng. 27(3), 726\u2013739 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1137\/1.9781611972764.42","volume-title":"Proceedings of the 2006 SIAM International Conference on Data Mining","author":"Guimei Liu","year":"2006","unstructured":"Liu, G., Li, J., Wong, L., et al.: Positive borders or negative borders: how to make lossless generator-based representations concise. In: SIAM International Conference on Data Mining \u2013 SDM (2006)"},{"key":"39_CR5","first-page":"61","volume":"2","author":"P Hui-ling","year":"2012","unstructured":"Hui-ling, P., Yun-xing, S.: A new FP-tree-based algorithm MMFI for mining the maximal frequent itemsets. IEEE Int. Conf. Comput. Sci. Autom. Eng. (CSAE) 2, 61\u201365 (2012)","journal-title":"IEEE Int. Conf. Comput. Sci. Autom. Eng. (CSAE)"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Bayardo Jr., R.J.: Efficiently mining long patterns from databases. In: ACM-SIGMOD International Conference on Management of Data, vol. 27, no. 2, pp. 85\u201393 (1998)","DOI":"10.1145\/276305.276313"},{"issue":"11","key":"39_CR7","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., Flannick, J., et al.: MAFIA: a maximal frequent itemset algorithm. IEEE Trans. Knowl. Data Eng. 17(11), 1490\u20131504 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Lee, G., Yun, U.: Analysis of recent maximal frequent pattern mining approaches. In: International Conference on Computer Science & Its applications, pp. 873\u2013877 (2016)","DOI":"10.1007\/978-981-10-3023-9_135"},{"key":"39_CR9","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB 1994), pp. 487\u2013499 (1994)"},{"issue":"2","key":"39_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., et al.: Mining frequent patterns with counting inference. SIGKDD Explor. 2(2), 66\u201375 (2000)","journal-title":"SIGKDD Explor."},{"key":"39_CR11","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (2000)"},{"key":"39_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic \u2014 CL 2000","author":"Y Bastide","year":"2000","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972\u2013986. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44957-4_65"},{"issue":"01","key":"39_CR13","first-page":"3491","volume":"03","author":"A Kumar","year":"2016","unstructured":"Kumar, A., Upadhyay, A.: An efficient algorithm to mine non redundant top K association rules. Int. J. Emerg. Trends Sci. Technol. 03(01), 3491\u20133500 (2016)","journal-title":"Int. J. Emerg. Trends Sci. Technol."},{"key":"39_CR14","unstructured":"Hamrouni, T., Denden, I., et al.: A new concise representation of frequent patterns through disjunctive search space. In: International Conference on Concept Lattices and their Applications (CLA 2007) (2007)"},{"issue":"23","key":"39_CR15","first-page":"315","volume":"23","author":"T Hamrouni","year":"2014","unstructured":"Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Towards faster mining of disjunction-based concise representations of frequent patterns. Int. J. Artif. Intell. Tools 23(23), 315\u2013335 (2014)","journal-title":"Int. J. Artif. Intell. Tools"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95930-6_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:19:24Z","timestamp":1710245964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95930-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959290","9783319959306"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95930-6_39","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":"6 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2018\/index.htm","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":"LOD","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"632","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":"275","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":"72","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":"44% - 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.46","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)"}}]}}