{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:30:53Z","timestamp":1775010653526,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,4,25]],"date-time":"2017-04-25T00:00:00Z","timestamp":1493078400000},"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":["Appl Intell"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10489-017-0932-1","type":"journal-article","created":{"date-parts":[[2017,4,25]],"date-time":"2017-04-25T07:30:08Z","timestamp":1493105408000},"page":"809-827","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["A hybrid framework for mining high-utility itemsets in a sparse transaction database"],"prefix":"10.1007","volume":"47","author":[{"given":"Siddharth","family":"Dawar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vikram","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debajyoti","family":"Bera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,25]]},"reference":[{"key":"932_CR1","unstructured":"Agrawal R, Srikant R et al (1994) Fast algorithms for mining association rules Proceeding 20th international conference on very large data bases, VLDB, vol 1215, pp 487\u2013499"},{"issue":"12","key":"932_CR2","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 S, Lee Y K (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708\u20131721. doi: 10.1109\/TKDE.2009.46","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"932_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10489-009-0188-5","volume":"34","author":"CF Ahmed","year":"2011","unstructured":"Ahmed C F, Tanbeer S K, Jeong B S, Lee Y K (2011) Huc-prune: an efficient candidate pruning technique tomine high utility patterns. Appl Intell 34(2):181\u2013198. doi: 10.1007\/s10489-009-0188-5","journal-title":"Appl Intell"},{"issue":"15","key":"932_CR4","doi-asserted-by":"publisher","first-page":"11,979","DOI":"10.1016\/j.eswa.2012.03.062","volume":"39","author":"CF Ahmed","year":"2012","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Choi HJ (2012) Interactive mining of high utility patterns over data streams. Expert Syst Appl 39(15):11,979\u201311,991. doi: 10.1016\/j.eswa.2012.03.062 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417412005854","journal-title":"Expert Syst Appl"},{"key":"932_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-27057-9_6","volume-title":"An efficient algorithm for mining high-utility itemsets with discount notion","author":"R Bansal","year":"2015","unstructured":"Bansal R, Dawar S, Goyal V (2015) An efficient algorithm for mining high-utility itemsets with discount notion. Springer International Publishing, Cham, pp 84\u201398. doi: 10.1007\/978-3-319-27057-9_6"},{"key":"932_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/ICDM.2003.1250893","volume-title":"Third IEEE international conference on data mining, 2003. ICDM 2003","author":"R Chan","year":"2003","unstructured":"Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets Third IEEE international conference on data mining, 2003. ICDM 2003. doi: 10.1109\/ICDM.2003.1250893 , pp 19\u201326"},{"key":"932_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/2790755.2790771","volume-title":"Proceedings of the 19th international database engineering & applications symposium, ACM, New York, NY, USA, IDEAS \u201915","author":"S Dawar","year":"2014","unstructured":"Dawar S, Goyal V (2014) Up-hist tree: an efficient data structure for mining high utility patterns from transaction databases Proceedings of the 19th international database engineering & applications symposium, ACM, New York, NY, USA, IDEAS \u201915. doi: 10.1145\/2790755.2790771 , pp 56\u201361"},{"key":"932_CR8","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-68125-0_50","volume-title":"Efficient mining of high utility itemsets from large datasets","author":"A Erwin","year":"2008","unstructured":"Erwin A, Gopalan RP, Achuthan NR (2008) Efficient mining of high utility itemsets from large datasets. Springer, Berlin, pp 554\u2013561. doi: 10.1007\/978-3-540-68125-0_50"},{"issue":"1","key":"932_CR9","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu C W, Tseng V S (2014) Spmf: a java open-source pattern mining library. J Mach Learn Res 15(1):3389\u20133393","journal-title":"J Mach Learn Res"},{"key":"932_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-08326-1_9","volume-title":"FHM: Faster High-utility itemset mining using estimated utility co-occurrence pruning","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Wu CW, Zida S, Tseng VS (2014) FHM: Faster High-utility itemset mining using estimated utility co-occurrence pruning. Springer International Publishing, Cham, pp 83\u201392. doi: 10.1007\/978-3-319-08326-1_9"},{"key":"932_CR11","doi-asserted-by":"crossref","unstructured":"Goethals B, Zaki M (2003) The frequent itemset mining implementations repository. http:\/\/fimi.ua.ac.be\/","DOI":"10.1145\/1007730.1007744"},{"key":"932_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-16313-0_3","volume-title":"High utility rare itemset mining over transaction databases","author":"V Goyal","year":"2015","unstructured":"Goyal V, Dawar S, Sureka A (2015) High utility rare itemset mining over transaction databases. Springer International Publishing, Cham, pp 27\u201340. doi: 10.1007\/978-3-319-16313-0_3"},{"key":"932_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/342009.335372","volume-title":"Proceedings of the 2000 ACM SIGMOD international conference on management of data, ACM, New York, NY, USA, SIGMOD \u201900","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation Proceedings of the 2000 ACM SIGMOD international conference on management of data, ACM, New York, NY, USA, SIGMOD \u201900. doi: 10.1145\/342009.335372 , pp 1\u201312"},{"issue":"1","key":"932_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","volume":"38","author":"GC Lan","year":"2014","unstructured":"Lan G C, Hong T P, Tseng V S (2014) An efficient projection-based indexing approach for mining high utility itemsets. Knowl Inf Syst 38(1):85\u2013107. doi: 10.1007\/s10115-012-0492-y","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"932_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"CKS Leung","year":"2007","unstructured":"Leung C K S, Khan Q I, Li Z, Hoque T (2007) Cantree: a canonical-order tree for incremental frequent-pattern mining. Knowl Inf Syst 11(3):287\u2013311. doi: 10.1007\/s10115-006-0032-8","journal-title":"Knowl Inf Syst"},{"key":"932_CR16","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/ICDM.2008.107","volume-title":"2008 8th IEEE international conference on data mining","author":"HF Li","year":"2008","unstructured":"Li HF, Huang HY, Chen YC, Liu YJ, Lee SY (2008) Fast and memory efficient mining of high utility itemsets in data streams 2008 8th IEEE international conference on data mining. doi: 10.1109\/ICDM.2008.107 , pp 881\u2013886"},{"issue":"1","key":"932_CR17","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"YC Li","year":"2008","unstructured":"Li YC, Yeh JS, Chang CC (2008) Isolated items discarding strategy for discovering high utility itemsets. Data & Knowledge Engineering 64(1):198\u2013217. doi: 10.1016\/j.datak.2007.06.009 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0169023X07001218","journal-title":"Data & Knowledge Engineering"},{"issue":"1","key":"932_CR18","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"YC Li","year":"2008","unstructured":"Li YC, Yeh JS, Chang CC (2008) Isolated items discarding strategy for discovering high utility itemsets. Data Knowl Eng 64(1):198\u2013217. doi: 10.1016\/j.datak.2007.06.009 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0169023X07001218","journal-title":"Data Knowl Eng"},{"key":"932_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/2396761.2396773","volume-title":"Proceedings of the 21st ACM international conference on information and knowledge management, ACM, New York, NY, USA, CIKM \u201912","author":"M Liu","year":"2012","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation Proceedings of the 21st ACM international conference on information and knowledge management, ACM, New York, NY, USA, CIKM \u201912. doi: 10.1145\/2396761.2396773 , pp 55\u201364"},{"key":"932_CR20","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1089827.1089839","volume-title":"Proceedings of the 1st international workshop on utility-based data mining, ACM, New York, NY, USA, UBDM \u201905","author":"Y Liu","year":"2005","unstructured":"Liu Y, Liao Wk, Choudhary A (2005) A fast high utility itemsets mining algorithm Proceedings of the 1st international workshop on utility-based data mining, ACM, New York, NY, USA, UBDM \u201905. doi: 10.1145\/1089827.1089839 , pp 90\u201399"},{"key":"932_CR21","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"A two-phase algorithm for fast discovery of high utility itemsets","author":"Y Liu","year":"2005","unstructured":"Liu Y, Liao Wk, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. Springer, Berlin, pp 689\u2013695. doi: 10.1007\/11430919_79"},{"key":"932_CR22","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/223784.223813","volume-title":"Proceedings of the 1995 ACM SIGMOD international conference on management of data, ACM, New York, NY, USA, SIGMOD \u201995","author":"JS Park","year":"1995","unstructured":"Park JS, Chen MS, Yu PS (1995) An effective hash-based algorithm for mining association rules Proceedings of the 1995 ACM SIGMOD international conference on management of data, ACM, New York, NY, USA, SIGMOD \u201995. doi: 10.1145\/223784.223813 , pp 175\u2013186"},{"key":"932_CR23","unstructured":"Pisharath J, Liu Y, Wk Liao, Choudhary A, Memik G, Parhi J (2005) Nu-minebench 2.0. Department of Electrical and Computer Engineering, Northwestern University, Tech Rep"},{"key":"932_CR24","first-page":"56","volume-title":"21St international conference on management of data, COMAD 2016, Pune, India, March 11\u201313, 2016","author":"S Rathore","year":"2016","unstructured":"Rathore S, Dawar S, Goyal V, Patel D (2016) Top-k high utility episode mining from a complex event sequence 21St international conference on management of data, COMAD 2016, Pune, India, March 11\u201313, 2016. http:\/\/comad.in\/comad2016\/proceedings\/paper_19.pdf , pp 56\u201363"},{"key":"932_CR25","doi-asserted-by":"publisher","first-page":"1622","DOI":"10.1145\/1774088.1774436","volume-title":"Proceedings of the 2010 ACM symposium on applied computing, ACM, New York, NY, USA, SAC \u201910","author":"BE Shie","year":"2010","unstructured":"Shie BE, Tseng VS, Yu PS (2010) Online mining of temporal maximal utility itemsets from data streams Proceedings of the 2010 ACM symposium on applied computing, ACM, New York, NY, USA, SAC \u201910. doi: 10.1145\/1774088.1774436 , pp 1622\u20131626"},{"key":"932_CR26","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-20149-3_18","volume-title":"Mining high utility mobile sequential patterns in mobile commerce environments","author":"BE Shie","year":"2011","unstructured":"Shie BE, Hsiao HF, Tseng VS, Yu PS (2011) Mining high utility mobile sequential patterns in mobile commerce environments. Springer, Berlin, pp 224\u2013238. doi: 10.1007\/978-3-642-20149-3_18"},{"issue":"17","key":"932_CR27","doi-asserted-by":"publisher","first-page":"12,947","DOI":"10.1016\/j.eswa.2012.05.035","volume":"39","author":"BE Shie","year":"2012","unstructured":"Shie BE, Yu PS, Tseng VS (2012) Efficient algorithms for mining maximal high utility itemsets from data streams with different models. Expert Syst Appl 39(17):12,947\u201312,960. doi: 10.1016\/j.eswa.2012.05.035 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S095741741200749X","journal-title":"Expert Syst Appl"},{"key":"932_CR28","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/1835804.1835839","volume-title":"Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201910","author":"VS Tseng","year":"2010","unstructured":"Tseng VS, Wu CW, Shie BE, Yu PS (2010) Up-growth: an efficient algorithm for high utility itemset mining Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201910. doi: 10.1145\/1835804.1835839 , pp 253\u2013262"},{"issue":"8","key":"932_CR29","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 E, Wu C W, Yu P S (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8):1772\u20131786. doi: 10.1109\/TKDE.2012.59","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"932_CR30","first-page":"472","volume-title":"Proceedings of information and knowledge engineering","author":"L Vu","year":"2011","unstructured":"Vu L, Alaghband G (2011) A fast algorithm combining fp-tree and tid-list for frequent pattern mining Proceedings of information and knowledge engineering, pp 472\u2013477"},{"key":"932_CR31","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1145\/2487575.2487654","volume-title":"Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201913","author":"CW Wu","year":"2013","unstructured":"Wu CW, Lin YF, Yu PS, Tseng VS (2013) Mining high utility episodes in complex event sequences Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201913. doi: 10.1145\/2487575.2487654 , pp 536\u2013544"},{"key":"932_CR32","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1145\/2339530.2339636","volume-title":"Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201912","author":"J Yin","year":"2012","unstructured":"Yin J, Zheng Z, Cao L (2012) Uspan: an efficient algorithm for mining high utility sequential patterns Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201912. doi: 10.1145\/2339530.2339636 , pp 660\u2013668"},{"key":"932_CR33","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1109\/ICDM.2013.148","volume-title":"2013 IEEE 13th international conference on data mining","author":"J Yin","year":"2013","unstructured":"Yin J, Zheng Z, Cao L, Song Y, Wei W (2013) Efficiently mining top-k high utility sequential patterns 2013 IEEE 13th international conference on data mining. doi: 10.1109\/ICDM.2013.148 , pp 1259\u20131264"},{"issue":"8","key":"932_CR34","doi-asserted-by":"publisher","first-page":"3861","DOI":"10.1016\/j.eswa.2013.11.038","volume":"41","author":"U Yun","year":"2014","unstructured":"Yun U, Ryang H, Ryu KH (2014) High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst Appl 41(8):3861\u20133878. doi: 10.1016\/j.eswa.2013.11.038 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417413009585","journal-title":"Expert Syst Appl"},{"key":"932_CR35","doi-asserted-by":"crossref","unstructured":"Zaki M J, Parthasarathy S, Ogihara M, Li W, et al. (1997) New algorithms for fast discovery of association rules KDD, vol 97, pp 283\u2013286","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"932_CR36","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-319-27060-9_44","volume-title":"EFIM: A highly efficient algorithm for high-utility itemset mining","author":"S Zida","year":"2015","unstructured":"Zida S, Fournier-Viger P, Lin JCW, Wu CW, Tseng VS (2015) EFIM: A highly efficient algorithm for high-utility itemset mining. Springer International Publishing, Cham, pp 530\u2013546. doi: 10.1007\/978-3-319-27060-9_44"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-0932-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0932-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0932-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T07:50:56Z","timestamp":1692777056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-0932-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,25]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["932"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-0932-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,25]]}}}