{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:11:27Z","timestamp":1743124287255,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030954079"},{"type":"electronic","value":"9783030954086"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95408-6_1","type":"book-chapter","created":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:04:07Z","timestamp":1643587447000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SMIM Framework to Generalize High-Utility Itemset Mining"],"prefix":"10.1007","author":[{"given":"Siddharth","family":"Dawar","sequence":"first","affiliation":[]},{"given":"Vikram","family":"Goyal","sequence":"additional","affiliation":[]},{"given":"Debajyoti","family":"Bera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,31]]},"reference":[{"issue":"12","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed, C.F., Tanbeer, S.K., Jeong, B., Lee, Y.: Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans. Knowl. Data Eng. 21(12), 1708\u20131721 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-27057-9_6","volume-title":"Big Data Analytics","author":"R Bansal","year":"2015","unstructured":"Bansal, R., Dawar, S., Goyal, V.: An efficient algorithm for mining high-utility itemsets with discount notion. In: Kumar, N., Bhatnagar, V. (eds.) BDA 2015. LNCS, vol. 9498, pp. 84\u201398. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27057-9_6"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Cerf, L., Meira, W.: Complete discovery of high-quality patterns in large numerical tensors. In: 2014 IEEE 30th International Conference on Data Engineering (2014)","DOI":"10.1109\/ICDE.2014.6816672"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.procs.2018.07.274","volume":"126","author":"A Coussat","year":"2018","unstructured":"Coussat, A., Nadisic, N., Cerf, L.: Mining high-utility patterns in uncertain tensors. Procedia Comput. Sci. 126, 404\u2013412 (2018)","journal-title":"Procedia Comput. Sci."},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s10489-017-0932-1","volume":"47","author":"S Dawar","year":"2017","unstructured":"Dawar, S., Goyal, V., Bera, D.: A hybrid framework for mining high-utility itemsets in a sparse transaction database. Appl. Intell. 47(3), 809\u2013827 (2017). https:\/\/doi.org\/10.1007\/s10489-017-0932-1","journal-title":"Appl. Intell."},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-08326-1_9","volume-title":"Foundations of Intelligent Systems","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Andreasen, T., Christiansen, H., Cubero, J.-C., Ra\u015b, Z.W. (eds.) ISMIS 2014. LNCS (LNAI), vol. 8502, pp. 83\u201392. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08326-1_9"},{"key":"1_CR7","series-title":"Studies in Big Data","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-04921-8_1","volume-title":"High-Utility Pattern Mining","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger, P., Chun-Wei Lin, J., Truong-Chi, T., Nkambou, R.: A survey of high utility itemset mining. In: Fournier-Viger, P., Lin, J.C.-W., Nkambou, R., Vo, B., Tseng, V.S. (eds.) High-Utility Pattern Mining. SBD, vol. 51, pp. 1\u201345. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-04921-8_1"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-46131-1_8","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger, P., et al.: The SPMF open-source data mining library version 2. In: Berendt, B., et al. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9853, pp. 36\u201340. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46131-1_8"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.artint.2015.09.007","volume":"244","author":"T Guns","year":"2017","unstructured":"Guns, T., Dries, A., Nijssen, S., Tack, G., Raedt, L.D.: MiningZinc: a declarative framework for constraint-based mining. Artif. Intell. 244, 6\u201329 (2017)","journal-title":"Artif. Intell."},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10115-018-1207-9","volume":"59","author":"BP Jaysawal","year":"2019","unstructured":"Jaysawal, B.P., Huang, J.W.: DMHUPS: discovering multiple high utility patterns simultaneously. Knowl. Inf. Syst. 59(2), 337\u2013359 (2019). https:\/\/doi.org\/10.1007\/s10115-018-1207-9","journal-title":"Knowl. Inf. Syst."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Lin, J.C., Gan, W., Fournier-Viger, P., Hong, T., Tseng, V.S.: Mining high-utility itemsets with various discount strategies. In: 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA) (2015)","DOI":"10.1109\/DSAA.2015.7344861"},{"issue":"5","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1109\/TKDE.2015.2510012","volume":"28","author":"J Liu","year":"2016","unstructured":"Liu, J., Wang, K., Fung, B.C.M.: Mining high utility patterns in one phase without generating candidates. IEEE Trans. Knowl. Data Eng. 28(5), 1245\u20131257 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of the $$21^{st}$$ ACM International Conference on Information and Knowledge Management (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liao, W.k., Choudhary, A.: A fast high utility itemsets mining algorithm. In: Proceedings of the 1st International Workshop on Utility-based Data Mining (2005)","DOI":"10.1145\/1089827.1089839"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y Liu","year":"2005","unstructured":"Liu, Y., Liao, W., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 689\u2013695. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11430919_79"},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10115-015-0860-5","volume":"47","author":"A Silva","year":"2015","unstructured":"Silva, A., Antunes, C.: Constrained pattern mining in the new era. Knowl. Inf. Syst. 47(3), 489\u2013516 (2015). https:\/\/doi.org\/10.1007\/s10115-015-0860-5","journal-title":"Knowl. Inf. Syst."},{"issue":"11","key":"1_CR17","doi-asserted-by":"publisher","first-page":"4141","DOI":"10.1007\/s10115-020-01485-w","volume":"62","author":"MK Sohrabi","year":"2020","unstructured":"Sohrabi, M.K.: An efficient projection-based method for high utility itemset mining using a novel pruning approach on the utility matrix. Knowl. Inf. Syst. 62(11), 4141\u20134167 (2020). https:\/\/doi.org\/10.1007\/s10115-020-01485-w","journal-title":"Knowl. Inf. Syst."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Tschiatschek, S., Singla, A., Krause, A.: Selecting sequences of items via submodular maximization. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (2017)","DOI":"10.24963\/ijcai.2018\/379"},{"issue":"8","key":"1_CR19","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng, V.S., Shie, B., Wu, C., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772\u20131786 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Tseng, V.S., Wu, C.W., Shie, B.E., Yu, P.S.: UP-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2010)","DOI":"10.1145\/1835804.1835839"},{"key":"1_CR21","unstructured":"Yao, H., Hamilton, H., Geng, L.: A unified framework for utility based measures for mining itemsets. In: 2nd International Workshop on Utility-Based Data Mining (2006)"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"55798","DOI":"10.1109\/ACCESS.2020.2981962","volume":"8","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Han, M., Sun, R., Du, S., Shen, M.: A survey of key technologies for high utility patterns mining. IEEE Access 8, 55798\u201355814 (2020)","journal-title":"IEEE Access"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","volume":"51","author":"S Zida","year":"2016","unstructured":"Zida, S., Fournier-Viger, P., Lin, J.C.-W., Wu, C.-W., Tseng, V.S.: EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl. Inf. Syst. 51(2), 595\u2013625 (2016). https:\/\/doi.org\/10.1007\/s10115-016-0986-0","journal-title":"Knowl. Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95408-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:06:58Z","timestamp":1643587618000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95408-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030954079","9783030954086"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95408-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"31 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/adma2021.net\/","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":"CMT3","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"116","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":"26","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":"35","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":"22% - 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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}