{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:12:22Z","timestamp":1742955142595,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030185787"},{"type":"electronic","value":"9783030185794"}],"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-18579-4_12","type":"book-chapter","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T15:05:36Z","timestamp":1556031936000},"page":"191-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficiently Mining Maximal Diverse Frequent Itemsets"],"prefix":"10.1007","author":[{"given":"Dingming","family":"Wu","sequence":"first","affiliation":[]},{"given":"Dexin","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"Joshua Zhexue","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, R.C., Aggarwal, C.C., Prasad, V.V.V.: Depth first generation of long patterns. In: KDD, pp. 108\u2013118 (2000)","DOI":"10.1145\/347090.347114"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: SIGMOD, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/276305.276313","volume":"27","author":"RJ Bayardo Jr","year":"1998","unstructured":"Bayardo Jr., R.J.: Efficiently mining long patterns from databases. SIGMOD Rec. 27(2), 85\u201393 (1998)","journal-title":"SIGMOD Rec."},{"issue":"11","key":"12_CR4","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., Gehrke, J., Yiu, T.: MAFIA: a maximal frequent itemset algorithm. IEEE Trans. Knowl. Data Eng. 17(11), 1490\u20131504 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR5","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: a maximal frequent itemset algorithm for transactional databases. In: ICDE, pp. 443\u2013452 (2001)"},{"issue":"3","key":"12_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.J.: 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":"12_CR7","unstructured":"Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: ICDM, pp. 163\u2013170 (2001)"},{"key":"12_CR8","unstructured":"Grahne, G., Zhu, J.: High performance mining of maximal frequent itemsets. In: HPDM (2003)"},{"issue":"2","key":"12_CR9","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: SIGMOD, pp. 1\u201312 (2000)","journal-title":"ACM SIGMOD Record"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.ins.2007.08.006","volume":"178","author":"T Hu","year":"2008","unstructured":"Hu, T., Sung, S.Y., Xiong, H., Fu, Q.: Discovery of maximum length frequent itemsets. Inf. Sci. 178(1), 69\u201387 (2008)","journal-title":"Inf. Sci."},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/TKDE.2002.1000342","volume":"14","author":"DI Lin","year":"2002","unstructured":"Lin, D.I., Kedem, Z.M.: Pincer-search: an efficient algorithm for discovering the maximum frequent set. IEEE Trans. Knowl. Data Eng. 14(3), 553\u2013566 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"507","DOI":"10.3233\/IDA-130591","volume":"17","author":"B Mallick","year":"2013","unstructured":"Mallick, B., Garg, D., Grover, P.S.: Incremental mining of sequential patterns: progress and challenges. Intell. Data Anal. 17(3), 507\u2013530 (2013)","journal-title":"Intell. Data Anal."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory \u2014 ICDT\u201999","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Buneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398\u2013416. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49257-7_25"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s10489-013-0506-9","volume":"41","author":"G Pyun","year":"2014","unstructured":"Pyun, G., Yun, U.: Mining top-k frequent patterns with combination reducing techniques. Appl. Intell. 41(1), 76\u201398 (2014)","journal-title":"Appl. Intell."},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.3233\/IDA-160811","volume":"20","author":"H Ryang","year":"2016","unstructured":"Ryang, H., Yun, U., Ryu, K.H.: Fast algorithm for high utility pattern mining with the sum of item quantities. Intell. Data Anal. 20(2), 395\u2013415 (2016)","journal-title":"Intell. Data Anal."},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.3233\/IDA-2004-8205","volume":"8","author":"K Srikumar","year":"2004","unstructured":"Srikumar, K., Bhasker, B.: Efficiently mining maximal frequent sets in dense databases for discovering association rules. Intell. Data Anal. 8(2), 171\u2013182 (2004)","journal-title":"Intell. Data Anal."},{"key":"12_CR17","unstructured":"Srivastava, S., Kiran, R.U., Reddy, P.K.: Discovering diverse-frequent patterns in transactional databases. In: COMAD, pp. 69\u201378 (2011)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-06608-0_2","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M Kumara Swamy","year":"2014","unstructured":"Kumara Swamy, M., Reddy, P.K., Srivastava, S.: Extracting diverse patterns with unbalanced concept hierarchy. In: Tseng, V.S., Ho, T.B., Zhou, Z.-H., Chen, A.L.P., Kao, H.-Y. (eds.) PAKDD 2014. LNCS (LNAI), vol. 8443, pp. 15\u201327. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06608-0_2"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-01307-2_24","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"SK Tanbeer","year":"2009","unstructured":"Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: Discovering periodic-frequent patterns in transactional databases. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS (LNAI), vol. 5476, pp. 242\u2013253. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01307-2_24"},{"issue":"4","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1016\/j.eswa.2012.08.065","volume":"40","author":"B Vo","year":"2013","unstructured":"Vo, B., Coenen, F., Le, B.: A new method for mining frequent weighted itemsets based on WIT-trees. Expert Syst. Appl. 40(4), 1256\u20131264 (2013)","journal-title":"Expert Syst. Appl."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Wang, H., Li, Q., Ma, C., Li, K.: A maximal frequent itemset algorithm. In: RSFDGrC, pp. 484\u2013490 (2003)","DOI":"10.1007\/3-540-39205-X_82"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-540-30549-1_42","volume-title":"AI 2004: Advances in Artificial Intelligence","author":"Y Yan","year":"2004","unstructured":"Yan, Y., Li, Z., Wang, T., Chen, Y., Chen, H.: Mining maximal frequent itemsets using combined FP-tree. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 475\u2013487. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30549-1_42"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Yang, G.: The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: KDD, pp. 344\u2013353 (2004)","DOI":"10.1145\/1014052.1014091"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18579-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:49:53Z","timestamp":1710233393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18579-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030185787","9783030185794"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18579-4_12","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":"24 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chiang Mai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","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":"22 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2019.eng.cmu.ac.th\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"501","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":"92","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":"64","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":"18% - 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":"3","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)"}},{"value":"13 demo papers, 6 tutorial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}