{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T18:18:21Z","timestamp":1763057901757},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T00:00:00Z","timestamp":1449619200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61105045"],"award-info":[{"award-number":["61105045"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100009546","name":"North China University of Technology","doi-asserted-by":"crossref","award":["CCXZ201303"],"award-info":[{"award-number":["CCXZ201303"]}],"id":[{"id":"10.13039\/501100009546","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10115-015-0900-1","type":"journal-article","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T17:49:25Z","timestamp":1449683365000},"page":"315-340","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["A high utility itemset mining algorithm based on subsume index"],"prefix":"10.1007","volume":"49","author":[{"given":"Wei","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"issue":"2","key":"900_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10115-011-0408-2","volume":"31","author":"A Achar","year":"2012","unstructured":"Achar A, Laxman S, Sastry PS (2012) A unified view of the apriori-based algorithms for frequent episode discovery. Knowl Inf Syst 31(2):223\u2013250","journal-title":"Knowl Inf Syst"},{"key":"900_CR2","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining associations between sets of items in massive databases. In: Proceedings of the ACM SIGMOD international conference on management of data, ACM, Washington DC, May 1993, pp 207\u2013216"},{"key":"900_CR3","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings 20th international conference on very large data bases, Morgan Kaufmann, Santiago de Chile, Chile, September 1994, pp\u00a0487\u2013499"},{"issue":"12","key":"900_CR4","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, 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","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"900_CR5","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 B-S, Lee Y-K (2011) HUC-Prune: an efficient candidate pruning technique to mine high utility patterns. Appl Intell 34(2):181\u2013198","journal-title":"Appl Intell"},{"issue":"1","key":"900_CR6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10618-010-0173-y","volume":"21","author":"PJ Azevedo","year":"2010","unstructured":"Azevedo PJ, Jorge AM (2010) Ensembles of jittered association rule classifiers. Data Min Knowl Discov 21(1):91\u2013129","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"900_CR7","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 Discov 7(2):153\u2013185","journal-title":"Data Min Knowl Discov"},{"key":"900_CR8","doi-asserted-by":"crossref","unstructured":"Chan R, Yang Q, Shen Y-D (2003) Mining high utility itemsets. In: Proceedings of the 3rd IEEE international conference on data mining, IEEE Computer Society, Melbourne, Florida, USA, December 2003, pp\u00a019\u201326","DOI":"10.1109\/ICDM.2003.1250893"},{"key":"900_CR9","doi-asserted-by":"publisher","unstructured":"Chen J, Xiao K (2010) BISC: a bitmap itemset support counting approach for efficient frequent itemset mining. ACM Trans Knowl Discov Data 4(3). doi: 10.1145\/1839490.1839493","DOI":"10.1145\/1839490.1839493"},{"key":"900_CR10","doi-asserted-by":"crossref","unstructured":"Erwin A, Gopalan RP, Achuthan NR (2007) CTU-Mine: An efficient high utility itemset mining algorithm using the pattern growth approach. In: Proceedings of the 7th IEEE international conference on computer and information technology, IEEE Computer Society, University of Aizu, Fukushima, Japan, October 2007, pp\u00a071\u201376","DOI":"10.1109\/CIT.2007.120"},{"issue":"1","key":"900_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"900_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 8(1):53\u201387","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"900_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","volume":"38","author":"G-C Lan","year":"2014","unstructured":"Lan G-C, Hong T-P, Tseng VS (2014) An efficient projection-based indexing approach for mining high utility itemsets. Knowl Inf Syst 38(1):85\u2013107","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"900_CR14","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10115-010-0330-z","volume":"28","author":"H-F Li","year":"2011","unstructured":"Li H-F, Huang H-Y, Lee S-Y (2011) Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits. Knowl Inf Syst 28(3):495\u2013522","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"900_CR15","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"Y-C Li","year":"2008","unstructured":"Li Y-C, Yeh J-S, Chang C-C (2008) Isolated items discarding strategy for discovering high utility itemsets. Data Knowl Eng 64(1):198\u2013217","journal-title":"Data Knowl Eng"},{"key":"900_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2012.05.015","volume":"215","author":"M-Y Lin","year":"2012","unstructured":"Lin M-Y, Tu T-F, Hsueh S-C (2012) High utility pattern mining using the maximal itemset property and lexicographic tree structures. Inf Sci 215:1\u201314","journal-title":"Inf Sci"},{"key":"900_CR17","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W-K, Choudhary AN (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, Hanoi, Vietnam, May 2005. Lecture Notes in Computer Science 3518, Springer, Berlin, pp\u00a0689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"900_CR18","unstructured":"Pisharath J, Liu Y, Ozisikyilmaz B, Narayanan R, Liao WK, Choudhary A, Memik G (2015) NU-MineBench version 2.0 data set and technical report. http:\/\/cucis.ece.northwestern.edu\/projects\/DMS\/MineBenchDownload.html"},{"key":"900_CR19","doi-asserted-by":"publisher","unstructured":"Qiao M, Zhang D (2012) Efficiently matching frequent patterns based on bitmap inverted files built from closed Itemsets. Int J Artif Intell Tools 21(3). doi: 10.1142\/S021821301250011X","DOI":"10.1142\/S021821301250011X"},{"issue":"1","key":"900_CR20","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10115-011-0452-y","volume":"34","author":"P Shelokar","year":"2013","unstructured":"Shelokar P, Quirin A, Cord\u00f3n O (2013) MOSubdue: a Pareto dominance-based multiobjective Subdue algorithm for frequent subgraph mining. Knowl Inf Syst 34(1):75\u2013108","journal-title":"Knowl Inf Syst"},{"key":"900_CR21","doi-asserted-by":"crossref","unstructured":"Song W, Liu Y, Li JH (2012) Vertical mining for high utility itemsets. In: Proceedings of 2012 IEEE international conference on granular computing, IEEE Computer Society, Hangzhou, China, August 2012, pp\u00a0512\u2013517","DOI":"10.1109\/GrC.2012.6468563"},{"issue":"6","key":"900_CR22","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.knosys.2008.03.011","volume":"21","author":"W Song","year":"2008","unstructured":"Song W, Yang BR, Xu ZY (2008) Index-BitTableFI: an improved algorithm for mining frequent itemsets. Knowl Based Syst 21(6):507\u2013513","journal-title":"Knowl Based Syst"},{"issue":"8","key":"900_CR23","doi-asserted-by":"crossref","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 Knowl Data Eng 25(8):1772\u20131786","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"900_CR24","doi-asserted-by":"crossref","unstructured":"Vo B, Coenen F, Le T, Hong T-P (2013) A hybrid approach for mining frequent itemsets. In: Proceedings of 2013 IEEE international conference on systems, man and cybernetics, Manchester, UK, October 2013, pp\u00a04647\u20134651","DOI":"10.1109\/SMC.2013.791"},{"issue":"1","key":"900_CR25","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TKDE.2013.109","volume":"26","author":"X Wu","year":"2014","unstructured":"Wu X, Zhu X, Wu G-Q, Ding W (2014) Data mining with big data. IEEE Trans Knowl Data Eng 26(1):97\u2013107","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"900_CR26","doi-asserted-by":"crossref","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":"900_CR27","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 4th SIAM international conference on data mining, SIAM, Lake Buena Vista, Florida, USA, April 2004, pp\u00a0482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"issue":"4","key":"900_CR28","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/s10489-013-0426-8","volume":"39","author":"S-J Yen","year":"2013","unstructured":"Yen S-J, Lee Y-S (2013) Mining non-redundant time-gap sequential patterns. Appl Intell 39(4):727\u2013738","journal-title":"Appl Intell"},{"key":"900_CR29","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810114","volume-title":"Data Mining and Analysis: Fundamental Concepts and Algorithms","author":"MJ Zaki","year":"2014","unstructured":"Zaki MJ (2014) Data Mining and Analysis: Fundamental Concepts and Algorithms. Cambridge University Press, Cambridge"},{"key":"900_CR30","doi-asserted-by":"crossref","unstructured":"Zhang S, Zhang J, Zhu X, Huang Z (2006) Identifying follow-correlation itemset-pairs. In: Proceedings of the 6th IEEE international conference on data mining, IEEE Computer Society, Hong Kong, China, December 2006, pp\u00a0765\u2013774","DOI":"10.1109\/ICDM.2006.84"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0900-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0900-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0900-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0900-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T05:41:15Z","timestamp":1589607675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0900-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,9]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["900"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0900-1","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,9]]}}}