{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:49:51Z","timestamp":1760708991685,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,1,25]],"date-time":"2016-01-25T00:00:00Z","timestamp":1453680000000},"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":["Appl Intell"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10489-015-0740-4","type":"journal-article","created":{"date-parts":[[2016,1,24]],"date-time":"2016-01-24T20:46:18Z","timestamp":1453668378000},"page":"44-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["An efficient fast algorithm for discovering closed+ high utility itemsets"],"prefix":"10.1007","volume":"45","author":[{"given":"Jayakrushna","family":"Sahoo","sequence":"first","affiliation":[]},{"given":"Ashok Kumar","family":"Das","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4420-0077","authenticated-orcid":false,"given":"A.","family":"Goswami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,25]]},"reference":[{"key":"740_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large data bases (VLDB \u201994), pp 487\u2013499"},{"key":"740_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proceedings of the eleventh international conference on data engineering, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"issue":"2","key":"740_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10489-009-0188-5","volume":"34","author":"CF Ahmed","year":"2011","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Lee YK (2011) HUC-prune: an efficient candidate pruning technique to mine high utility patterns. Appl Intell 34(2):181\u2013198","journal-title":"Appl Intell"},{"issue":"2","key":"740_CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1022419032620","volume":"7","author":"B Barber","year":"2003","unstructured":"Barber B, Hamilton HJ (2003) Extracting share frequent itemsets with infrequent subsets. Data Min Knowl Disc 7(2):153\u2013 185","journal-title":"Data Min Knowl Disc"},{"issue":"1","key":"740_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"JF Boulicaut","year":"2003","unstructured":"Boulicaut JF, Bykowski A, Rigotti C (2003) Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Min Knowl Disc 7(1):5\u2013 22","journal-title":"Data Min Knowl Disc"},{"key":"740_CR6","doi-asserted-by":"crossref","unstructured":"Burdick D, Calimlim M, Gehrke J (2001) Mafia: A maximal frequent itemset algorithm for transactional databases. In: Proceedings of 17th international conference on data engineering, vol 2001, pp 443\u2013452","DOI":"10.1109\/ICDE.2001.914857"},{"key":"740_CR7","doi-asserted-by":"crossref","unstructured":"Cai CH, Fu AC, Cheng C, Kwong WW (1998) Mining association rules with weighted items. In: Proceedings of international database engineering and applications symposium (IDEAS\u201998), vol 1998, pp 68\u201377","DOI":"10.1109\/IDEAS.1998.694360"},{"issue":"1","key":"740_CR8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10618-006-0054-6","volume":"14","author":"T Calders","year":"2007","unstructured":"Calders T, Goethals B (2007) Non-derivable itemset mining. Data Min Knowl Disc 14(1):171\u2013206","journal-title":"Data Min Knowl Disc"},{"key":"740_CR9","doi-asserted-by":"crossref","unstructured":"Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In: 3rd IEEE international conference on data mining (ICDM\u201903), 2003, pp 19\u201326","DOI":"10.1109\/ICDM.2003.1250893"},{"key":"740_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.knosys.2012.06.004","volume":"36","author":"CH Chen","year":"2012","unstructured":"Chen CH, Chiang RD, Lee CM, Chen CY (2012) Improving the performance of association classifiers by rule prioritization. Knowl-Based Syst 36:59\u201367","journal-title":"Knowl-Based Syst"},{"key":"740_CR11","doi-asserted-by":"crossref","unstructured":"Chen Y, Zhao Y, Yao Y (2007) A profit-based business model for evaluating rule interestingness. In: Advances in Artificial Intelligence, LNCS, vol 4509, pp 296\u2013 307","DOI":"10.1007\/978-3-540-72665-4_26"},{"issue":"5","key":"740_CR12","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1007\/s00778-007-0078-6","volume":"17","author":"KT Chuang","year":"2008","unstructured":"Chuang KT, Huang JL, Chen MS (2008) Mining top-k frequent patterns in the presence of the memory constraint. VLDB J 17(5):1321\u20131344","journal-title":"VLDB J"},{"key":"740_CR13","unstructured":"IBM Quest Synthetic Data Generator, http:\/\/www.cs.loyola.edu\/cgiannel\/assoc_gen.html , accessed on August 2011"},{"key":"740_CR14","unstructured":"FIMI (2003) FIMI: The frequent itemset mining dataset repository. http:\/\/fimi.cs.helsinki.fi\/data\/ , accessed on February 2012"},{"key":"740_CR15","unstructured":"Fournier-Viger P, Gomariz A, Soltani A, Gueniche T (2014) SPMF: Open-Source Data Mining Library. http:\/\/www.philippe-fournier-viger.com\/spmf\/ , accessed on August 2014"},{"key":"740_CR16","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu C, Tseng VS (2014) Novel concise representations of high utility itemsets using generator patterns. In: Advanced Data Mining and Applications, LNCS, vol 8933 , pp 30\u201343","DOI":"10.1007\/978-3-319-14717-8_3"},{"key":"740_CR17","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu C, Zida S, Tseng VS (2014) FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Foundations of Intelligent Systems, LNCS, vol 8502, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"issue":"2","key":"740_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1142\/S0218213098000111","volume":"7","author":"RJ Hilderman","year":"1998","unstructured":"Hilderman RJ, Hamiliton HJ, Carter CL, Cercone N (1998) Mining association rules from market basket data using share measures and characterized itemsets. Int J Artif Intell Tools 7(2): 189\u2013220","journal-title":"Int J Artif Intell Tools"},{"key":"740_CR19","doi-asserted-by":"crossref","unstructured":"Koh Y, Pears R, Yeap W (2010) Valency based weighted association rule mining. In: Advances in Knowledge Discovery and Data Mining, LNCS, vol 6118, pp 274\u2013285","DOI":"10.1007\/978-3-642-13657-3_31"},{"issue":"19","key":"740_CR20","doi-asserted-by":"crossref","first-page":"6648","DOI":"10.1016\/j.eswa.2015.04.048","volume":"42","author":"T Le","year":"2015","unstructured":"Le T, Vo B (2015) An n-list-based algorithm for mining frequent closed patterns. Expert Syst with Appl 42(19):6648\u2013 6657","journal-title":"Expert Syst with Appl"},{"issue":"7","key":"740_CR21","doi-asserted-by":"crossref","first-page":"2715","DOI":"10.1016\/j.eswa.2012.11.021","volume":"40","author":"D Lee","year":"2013","unstructured":"Lee D, Park SH, Moon S (2013) Utility-based association rule mining: A marketing solution for cross-selling. Expert Syst with Appl 40(7):2715\u20132725","journal-title":"Expert Syst with Appl"},{"issue":"1","key":"740_CR22","doi-asserted-by":"crossref","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","journal-title":"Data Knowl Eng"},{"issue":"12","key":"740_CR23","doi-asserted-by":"crossref","first-page":"5303","DOI":"10.1016\/j.eswa.2015.02.022","volume":"42","author":"YF Lin","year":"2015","unstructured":"Lin YF, Wu CW, Huang CF, Tseng VS (2015) Discovering utility-based episode rules in complex event sequences. Expert Syst with Appl 42(12):5303\u20135314","journal-title":"Expert Syst with Appl"},{"key":"740_CR24","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM international conference on information and knowledge management (CIKM \u201912), pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"740_CR25","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A fast high utility itemsets mining algorithm. In: Proceedings of 1st international workshop on Utility-based data mining (UBDM \u201905), pp 90\u201399","DOI":"10.1145\/1089827.1089839"},{"issue":"1","key":"740_CR26","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2006","unstructured":"Lucchese C, Orlando S, Perego R (2006) Fast and memory efficient mining of frequent closed itemsets. IEEE Trans Knowl Data Eng 18(1):21\u201336","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"740_CR27","doi-asserted-by":"crossref","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 (1999) Efficient mining of association rules using closed itemset lattices. Inf Syst 24(1):25\u201346","journal-title":"Inf Syst"},{"key":"740_CR28","first-page":"61","volume":"218","author":"R Pears","year":"2013","unstructured":"Pears R, Koh Y S, Dobbie G, Yeap W (2013) Weighted association rule mining via a graph based connectivity model. Inf Syst 218:61\u201384","journal-title":"Inf Syst"},{"key":"740_CR29","unstructured":"Pisharath J, Liu Y, Liao WK, Choudhary A, Memik G, Parhi J (2005) Nu-minebench version 2.0 dataset and technical report, http:\/\/cucis.ece.northwestern.edu\/projects\/DMS\/MineBench.html , accessed on June 2013"},{"key":"740_CR30","unstructured":"Ramkumar GD, Ramkumar S, Shalom T (1998) Weighted association rules: Model and algorithm. In: Proceedings of 4th ACM international conference on knowledge discovery and data mining"},{"key":"740_CR31","unstructured":"Rymon R (1992) Search through systematic set enumeration. In: Proceedings of 3rd international conference on principles of knowledge representation and reasoning, pp 539\u2013550"},{"issue":"1","key":"740_CR32","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10115-014-0732-4","volume":"43","author":"J Sahoo","year":"2015","unstructured":"Sahoo J, Das AK, Goswami A (2015) An effective association rule mining scheme using a new generic basis. Knowl Inf Syst 43(1):127\u2013156","journal-title":"Knowl Inf Syst"},{"key":"740_CR33","doi-asserted-by":"crossref","unstructured":"Shie BE, Tseng VS, Yu PS (2010) Online mining of temporal maximal utility itemsets from data streams. In: Proceedings of the 2010 ACM symposium on applied computing (SAC \u201910), pp 1622\u20131626","DOI":"10.1145\/1774088.1774436"},{"issue":"17","key":"740_CR34","doi-asserted-by":"crossref","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 with Appl 39(17):12,947\u201312,960","journal-title":"Expert Syst with Appl"},{"issue":"3","key":"740_CR35","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/s10489-012-0379-3","volume":"38","author":"BE Shie","year":"2013","unstructured":"Shie BE, Yu PS, Tseng VS (2013) Mining interesting user behavior patterns in mobile commerce environments. Appl Intell 38(3):418\u2013435","journal-title":"Appl Intell"},{"issue":"1","key":"740_CR36","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10489-013-0443-7","volume":"40","author":"W Song","year":"2014","unstructured":"Song W, Liu Y, Li J (2014) Mining high utility itemsets by dynamically pruning the tree structure. Appl Intell 40 (1):29\u201343","journal-title":"Appl Intell"},{"key":"740_CR37","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TKDE.2007.190723","volume":"20","author":"K Sun","year":"2008","unstructured":"Sun K, Bai F (2008) Mining weighted association rules without preassigned weights. IEEE Trans Knowl Data Eng 20:489\u2013495","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"740_CR38","doi-asserted-by":"crossref","unstructured":"Tao F, Murtagh F, Farid M (2003) Weighted association rule mining using weighted support and significance framework. In: Proceedings of the Ninth ACM SIGKDD international conference on knowledge discovery and data mining (KDD \u201903) , pp 661\u2013666","DOI":"10.1145\/956750.956836"},{"issue":"3","key":"740_CR39","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"V Tseng","year":"2015","unstructured":"Tseng V, Wu C W, Fournier-Viger P, Yu P (2015) Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Trans Knowl Data Eng 27(3): 726\u2013739","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"740_CR40","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu CW, Shie BE, Yu PS (2010) 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 (KDD \u201910), pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"issue":"8","key":"740_CR41","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng VS, Shie BE, Wu CW, Yu PS (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8): 1772\u20131786","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"740_CR42","doi-asserted-by":"crossref","first-page":"7196","DOI":"10.1016\/j.eswa.2012.01.062","volume":"39","author":"B Vo","year":"2012","unstructured":"Vo B, Hong TP, Le B (2012) Dbv-miner: A dynamic bit-vector approach for fast mining frequent closed itemsets. Expert Syst with Appl 39(8):7196\u20137206","journal-title":"Expert Syst with Appl"},{"key":"740_CR43","doi-asserted-by":"crossref","unstructured":"Wang K, Zhou S, Han J (2002) Profit mining: From patterns to actions. In: Advances in Database Technology - EDBT 2002, LNCS, vol 2287, pp 70\u201387","DOI":"10.1007\/3-540-45876-X_7"},{"key":"740_CR44","doi-asserted-by":"crossref","unstructured":"Wang W, Yang J, Yu P S (2000) Efficient mining of weighted association rules (war). In: Proceedings of the Sixth ACM SIGKDD international conference on knowledge discovery and data mining (KDD 2000), pp 270\u2013274","DOI":"10.1145\/347090.347149"},{"key":"740_CR45","doi-asserted-by":"crossref","unstructured":"Wu CW, Fournier-Viger P, Yu PS, Tseng VS (2011) Efficient mining of a concise and lossless representation of high utility itemsets. In: Proceedings of the 2011 IEEE 11th international conference on data mining (ICDM \u201911) , pp 824\u2013833","DOI":"10.1109\/ICDM.2011.60"},{"key":"740_CR46","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: Proceedings of the Third SIAM international conference on data mining , pp 482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"issue":"17","key":"740_CR47","doi-asserted-by":"crossref","first-page":"3477","DOI":"10.1016\/j.ins.2007.03.018","volume":"177","author":"U Yun","year":"2007","unstructured":"Yun U (2007) Efficient mining of weighted interesting patterns with a strong weight and\/or support affinity. Inf Sci 177(17): 3477\u20133499","journal-title":"Inf Sci"},{"issue":"1","key":"740_CR48","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.knosys.2006.07.007","volume":"20","author":"U Yun","year":"2007","unstructured":"Yun U (2007) Mining lossless closed frequent patterns with weight constraints. Knowl-Based Syst 20(1):86\u201397","journal-title":"Knowl-Based Syst"},{"key":"740_CR49","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.knosys.2012.02.002","volume":"33","author":"U Yun","year":"2012","unstructured":"Yun U, Shin H, Ryu KH, Yoon EC (2012) An efficient mining algorithm for maximal weighted frequent patterns in transactional databases. Knowl-Based Syst 33:53\u201364","journal-title":"Knowl-Based Syst"},{"issue":"8","key":"740_CR50","doi-asserted-by":"crossref","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 with Appl 41(8):3861\u2013 3878","journal-title":"Expert Syst with Appl"},{"issue":"4","key":"740_CR51","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"M Zaki","year":"2005","unstructured":"Zaki M, Hsiao CJ (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17(4):462\u2013478","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-015-0740-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-015-0740-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-015-0740-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:25:57Z","timestamp":1559139957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-015-0740-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,25]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["740"],"URL":"https:\/\/doi.org\/10.1007\/s10489-015-0740-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2016,1,25]]}}}