{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:21:13Z","timestamp":1783984873498,"version":"3.55.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T00:00:00Z","timestamp":1540425600000},"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":[[2019,3]]},"DOI":"10.1007\/s10489-018-1316-x","type":"journal-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T04:04:49Z","timestamp":1540440289000},"page":"1078-1097","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["TKEH: an efficient algorithm for mining top-k high utility itemsets"],"prefix":"10.1007","volume":"49","author":[{"given":"Kuldeep","family":"Singh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shashank Sheshar","family":"Singh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ajay","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bhaskar","family":"Biswas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,10,25]]},"reference":[{"key":"1316_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. Morgan Kaufmann Publishers Inc, San Francisco, pp 487\u2013 499"},{"issue":"15","key":"1316_CR2","doi-asserted-by":"publisher","first-page":"11979","DOI":"10.1016\/j.eswa.2012.03.062","volume":"39","author":"CF Ahmed","year":"2012","unstructured":"Ahmed CF, Tanbeer SK, Jeong B-S, Choi H -J (2012) Interactive mining of high utility patterns over data streams. Expert Syst Appl 39(15):11979\u201311991","journal-title":"Expert Syst Appl"},{"issue":"7","key":"1316_CR3","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1016\/j.jss.2007.07.026","volume":"81","author":"C-J Chu","year":"2008","unstructured":"Chu C-J, Tseng VS, Liang T (2008) An efficient algorithm for mining temporal high utility itemsets from data streams. J Syst Softw 81(7):1105\u20131117","journal-title":"J Syst Softw"},{"issue":"3","key":"1316_CR4","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s10115-016-1020-2","volume":"52","author":"T-L Dam","year":"2017","unstructured":"Dam T-L, Li K, Fournier-Viger P, Duong Q-H (2017) An efficient algorithm for mining top-k on-shelf high utility itemsets. Knowl Inf Syst 52(3):621\u2013655","journal-title":"Knowl Inf Syst"},{"key":"1316_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","volume":"104","author":"Q-H Duong","year":"2016","unstructured":"Duong Q-H, Liao B, Fournier-Viger P, Dam T-L (2016) An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies. Knowl-Based Syst 104:106\u2013122","journal-title":"Knowl-Based Syst"},{"key":"1316_CR6","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu C-W, Tseng VS (2014a) Spmf: a java open-source pattern mining library. J Mach Learn Res 15(1):3389\u20133393"},{"key":"1316_CR7","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu C-W, Zida S, Tseng VS (2014b) 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":"1316_CR8","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zida S (2015) Foshu: faster on-shelf high utility itemset mining \u2013 with or without negative unit profit. In: Proceedings of the 30th annual ACM symposium on applied computing, SAC \u201915. ACM, New York, pp 857\u2013864","DOI":"10.1145\/2695664.2695823"},{"issue":"5","key":"1316_CR9","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","volume":"42","author":"S Krishnamoorthy","year":"2015","unstructured":"Krishnamoorthy S (2015) Pruning strategies for mining high utility itemsets. Expert Syst Appl 42(5):2371\u20132381","journal-title":"Expert Syst Appl"},{"issue":"Supplement C","key":"1316_CR10","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","volume":"90","author":"S Krishnamoorthy","year":"2017","unstructured":"Krishnamoorthy S (2017) Hminer: efficiently mining high utility itemsets. Expert Syst Appl 90(Supplement C):168\u2013183","journal-title":"Expert Syst Appl"},{"key":"1316_CR11","doi-asserted-by":"crossref","unstructured":"Lee S, Park JS (2016) Top-k high utility itemset mining based on utility-list structures. In: 2016 International conference on big data and smart computing (BigComp), pp 101\u2013108","DOI":"10.1109\/BIGCOMP.2016.7425807"},{"key":"1316_CR12","unstructured":"Li HF, Huang HY, Chen YC, Liu YJ, Lee SY (2008) Fast and memory efficient mining of high utility itemsets in data streams. In: 2008 Eighth IEEE International conference on data mining, pp 881\u2013886"},{"key":"1316_CR13","doi-asserted-by":"crossref","unstructured":"Liu J, Wang K, Fung BCM (2012) Direct discovery of high utility itemsets without candidate generation. In: 2012 IEEE 12th International conference on data mining. Brussels, pp 984\u2013989","DOI":"10.1109\/ICDM.2012.20"},{"key":"1316_CR14","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. ACM, New York, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"1316_CR15","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W -k, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Proceedings of the 9th Pacific-Asia conference on advances in knowledge discovery and data mining, PAKDD\u201905. Springer, Berlin, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"1316_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.knosys.2014.12.010","volume":"76","author":"H Ryang","year":"2015","unstructured":"Ryang H, Yun U (2015) Top-k high utility pattern mining with effective threshold raising strategies. Knowl-Based Syst 76:109\u2013126","journal-title":"Knowl-Based Syst"},{"key":"1316_CR17","first-page":"224","volume-title":"Mining high utility mobile sequential patterns in mobile commerce environments","author":"B-E Shie","year":"2011","unstructured":"Shie B-E, Hsiao H-F, Tseng VS, Yu PS (2011) Mining high utility mobile sequential patterns in mobile commerce environments. Springer, Berlin, pp 224\u2013238"},{"issue":"3","key":"1316_CR18","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/s10489-012-0379-3","volume":"38","author":"B-E Shie","year":"2013","unstructured":"Shie B-E, 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":"8","key":"1316_CR19","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng VS, Shie B-E, Wu C-W, Yu PS (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans on Knowl and Data Eng 25(8):1772\u20131786","journal-title":"IEEE Trans on Knowl and Data Eng"},{"issue":"1","key":"1316_CR20","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","volume":"28","author":"VS Tseng","year":"2016","unstructured":"Tseng VS, Wu CW, Fournier-Viger P, Yu PS (2016) Efficient algorithms for mining top-k high utility itemsets. IEEE Trans Knowl Data Eng 28(1):54\u201367","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1316_CR21","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu C -W, Shie B -E, 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. ACM, New York, pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"key":"1316_CR22","unstructured":"Wu CW, Shie B-E, Tseng VS, Yu PS (2012) Mining top-k high utility itemsets. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201912. ACM, New York, pp 78\u201386"},{"issue":"3","key":"1316_CR23","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","volume":"59","author":"H Yao","year":"2006","unstructured":"Yao H, Hamilton HJ (2006) Mining itemset utilities from transaction databases. Data Knowl Eng 59 (3):603\u2013626","journal-title":"Data Knowl Eng"},{"key":"1316_CR24","first-page":"283","volume-title":"Mining high utility quantitative association rules","author":"S-J Yen","year":"2007","unstructured":"Yen S-J, Lee Y-S (2007) Mining high utility quantitative association rules. Springer, Berlin, pp 283\u2013292"},{"key":"1316_CR25","doi-asserted-by":"crossref","unstructured":"Yin J, Zheng Z, Cao L, Song Y, Wei W (2013) Efficiently mining top-k high utility sequential patterns. In: 2013 IEEE 13th International conference on data mining, pp 1259\u20131264","DOI":"10.1109\/ICDM.2013.148"},{"issue":"8","key":"1316_CR26","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","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1316_CR27","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","volume":"51","author":"S Zida","year":"2017","unstructured":"Zida S, Fournier-Viger P, Lin JC -W, Wu C -W, Tseng VS (2017) Efim: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51(2):595\u2013625","journal-title":"Knowl Inf Syst"},{"key":"1316_CR28","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ins.2014.01.045","volume":"285","author":"M Zihayat","year":"2014","unstructured":"Zihayat M, An A (2014) Mining top-k high utility patterns over data streams. Inf Sci 285:138\u2013161. Processing and Mining Complex Data Streams","journal-title":"Inf Sci"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-018-1316-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1316-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1316-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T21:05:09Z","timestamp":1572037509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-018-1316-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,25]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["1316"],"URL":"https:\/\/doi.org\/10.1007\/s10489-018-1316-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,25]]},"assertion":[{"value":"25 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The article uses threshold raising and memory reduction techniques to mine the top-k high utility itemsets mining.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interests"}}]}}