{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:33:36Z","timestamp":1777455216103,"version":"3.51.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,29]],"date-time":"2013-05-29T00:00:00Z","timestamp":1369785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10489-013-0443-7","type":"journal-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T02:27:49Z","timestamp":1369708069000},"page":"29-43","source":"Crossref","is-referenced-by-count":58,"title":["Mining high utility itemsets by dynamically pruning the tree structure"],"prefix":"10.1007","volume":"40","author":[{"given":"Wei","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Liu","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":[[2013,5,29]]},"reference":[{"issue":"2","key":"443_CR1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/s10489-007-0099-2","volume":"30","author":"M Adnan","year":"2009","unstructured":"Adnan\u00a0M, Alhajj\u00a0R (2009) DRFP-tree: disk-resident frequent pattern tree. Appl Intell 30(2):84\u201397","journal-title":"Appl Intell"},{"key":"443_CR2","first-page":"487","volume-title":"Proceedings 20th international conference very large data bases (VLDB\u201994)","author":"R Agrawal","year":"1994","unstructured":"Agrawal\u00a0R, Srikant\u00a0R (1994) Fast algorithms for mining association rules. In: Proceedings 20th international conference very large data bases (VLDB\u201994), pp 487\u2013499"},{"issue":"12","key":"443_CR3","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. IEEE Trans Knowl Data Eng 21(12):1708\u20131721","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"443_CR4","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":"2","key":"443_CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1022419032620","volume":"7","author":"B Barber","year":"2003","unstructured":"Barber\u00a0B, 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":"443_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/ICDM.2003.1250893","volume-title":"Proceedings of the 3rd IEEE international conference on data mining (ICDM\u201903)","author":"R Chan","year":"2003","unstructured":"Chan\u00a0R, Yang\u00a0Q, Shen Y-D (2003) Mining high utility itemsets. In: Proceedings of the 3rd IEEE international conference on data mining (ICDM\u201903), pp 19\u201326"},{"key":"443_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/CIT.2007.120","volume-title":"Proceedings of the 7th IEEE international conference on computer and information technology (CIT\u201907)","author":"A Erwin","year":"2007","unstructured":"Erwin\u00a0A, 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 (CIT\u201907), pp 71\u201376"},{"key":"443_CR8","first-page":"3","volume-title":"Proceedings of the 2nd international workshop on integrating artificial intelligence and data mining (AIDM\u201907)","author":"A Erwin","year":"2007","unstructured":"Erwin\u00a0A, Gopalan RP, Achuthan NR (2007) A\u00a0bottom-up projection based algorithm for mining high utility itemsets. In: Proceedings of the 2nd international workshop on integrating artificial intelligence and data mining (AIDM\u201907), pp 3\u201310"},{"key":"443_CR9","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-540-68125-0_50","volume-title":"Proceedings of the 12th Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD\u201908)","author":"A Erwin","year":"2008","unstructured":"Erwin\u00a0A, Gopalan RP, Achuthan NR (2008) Efficient mining of high utility itemsets from large datasets. In: Proceedings of the 12th Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD\u201908), pp 554\u2013561"},{"issue":"10","key":"443_CR10","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne\u00a0G, Zhu\u00a0J (2005) Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans Knowl Data Eng 17(10):1347\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"443_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han\u00a0J, Cheng\u00a0H, Xin\u00a0D, Yan\u00a0X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"key":"443_CR12","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2006","unstructured":"Han\u00a0J, Kamber\u00a0M (2006) Data mining: concepts and techniques, 2nd edn. Morgan Kaufmann, San Francisco","edition":"2"},{"issue":"1","key":"443_CR13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han\u00a0J, Pei\u00a0J, Yin\u00a0Y, Mao\u00a0R (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":"11","key":"443_CR14","doi-asserted-by":"crossref","first-page":"3317","DOI":"10.1016\/j.patcog.2007.02.003","volume":"40","author":"J Hu","year":"2007","unstructured":"Hu\u00a0J, Mojsilovic\u00a0A (2007) High-utility pattern mining: a method for discovery of high-utility item sets. Pattern Recognit 40(11):3317\u20133324","journal-title":"Pattern Recognit"},{"issue":"1","key":"443_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s10489-007-0078-7","volume":"29","author":"M Kaya","year":"2008","unstructured":"Kaya\u00a0M, Alhajj\u00a0R (2008) Online mining of fuzzy multidimensional weighted association rules. Appl Intell 29(1):13\u201334","journal-title":"Appl Intell"},{"issue":"3","key":"443_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10489-006-0016-0","volume":"26","author":"C-H Lee","year":"2007","unstructured":"Lee C-H (2007) IMSP: an information theoretic approach for multi-dimensional sequential pattern mining. Appl Intell 26(3):231\u2013242","journal-title":"Appl Intell"},{"issue":"1","key":"443_CR17","first-page":"193","volume":"28","author":"G-C Lan","year":"2012","unstructured":"Lan G-C, Hong T-P, Tseng VS (2012) A\u00a0projection-based approach for discovering high average-utility itemsets. J Inf Sci Eng 28(1):193\u2013209","journal-title":"J Inf Sci Eng"},{"issue":"3","key":"443_CR18","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":"5","key":"443_CR19","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1177\/0165551511416436","volume":"37","author":"H-F Li","year":"2011","unstructured":"Li H-F (2011) MHUI-max: an efficient algorithm for discovering high-utility itemsets from data streams. J Inf Sci 37(5):532\u2013545","journal-title":"J Inf Sci"},{"issue":"1","key":"443_CR20","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"},{"issue":"6","key":"443_CR21","doi-asserted-by":"crossref","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","volume":"38","author":"C-W Lin","year":"2011","unstructured":"Lin C-W, Hong T-P, Lu W-H (2011) An effective tree structure for mining high utility itemsets. Expert Syst Appl 38(6):7419\u20137424","journal-title":"Expert Syst Appl"},{"key":"443_CR22","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Proceedings of the 9th Pacific-Asia conference on knowledge discovery and data mining (PAKDD\u201905)","author":"Y Liu","year":"2005","unstructured":"Liu\u00a0Y, Liao W-K, Choudhary AN (2005) A\u00a0two phase algorithm for fast discovery of high utility of itemsets. In: Proceedings of the 9th Pacific-Asia conference on knowledge discovery and data mining (PAKDD\u201905), pp 689\u2013695"},{"issue":"2","key":"443_CR23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10994-010-5187-6","volume":"83","author":"A Maunz","year":"2011","unstructured":"Maunz\u00a0A, Helma\u00a0C, Kramer\u00a0S (2011) Efficient mining for structurally diverse subgraph patterns in large molecular databases. Mach Learn 83(2):193\u2013218","journal-title":"Mach Learn"},{"issue":"1","key":"443_CR24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10618-006-0058-2","volume":"15","author":"G Piatetsky-Shapiro","year":"2007","unstructured":"Piatetsky-Shapiro\u00a0G (2007) Data mining and knowledge discovery 1996 to 2005: overcoming the hype and moving from \u201cuniversity\u201d to \u201cbusiness\u201d and \u201canalytics\u201d. Data Min Knowl Discov 15(1):99\u2013105","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"443_CR25","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/B:APIN.0000047380.15356.7a","volume":"22","author":"J Rauch","year":"2005","unstructured":"Rauch\u00a0J (2005) Logic of association rules. Appl Intell 22(1):9\u201328","journal-title":"Appl Intell"},{"key":"443_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-258-0","volume-title":"Understanding concurrent systems","author":"AW Roscoe","year":"2010","unstructured":"Roscoe AW (2010) Understanding concurrent systems. Springer, London"},{"issue":"3","key":"443_CR27","doi-asserted-by":"crossref","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":"6","key":"443_CR28","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.knosys.2008.03.011","volume":"21","author":"W Song","year":"2008","unstructured":"Song\u00a0W, 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":"1","key":"443_CR29","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/s10618-011-0232-z","volume":"25","author":"N Tatti","year":"2012","unstructured":"Tatti\u00a0N, Cule\u00a0B (2012) Mining closed strict episodes. Data Min Knowl Discov 25(1):34\u201366","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"443_CR30","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/s10489-007-0096-5","volume":"29","author":"M-C Tseng","year":"2008","unstructured":"Tseng M-C, Lin Y-Y, Jeng\u00a0R (2008) Updating generalized association rules with evolving taxonomies. Appl Intell 29(3):306\u2013320","journal-title":"Appl Intell"},{"key":"443_CR31","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/1835804.1835839","volume-title":"Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201910)","author":"VS Tseng","year":"2010","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), pp 253\u2013262"},{"key":"443_CR32","unstructured":"IBM data generator. http:\/\/www.cs.loyola.edu\/~cgiannel\/assoc_gen.html"},{"key":"443_CR33","unstructured":"Frequent Itemset mining implementations repository. http:\/\/fimi.ua.ac.be\/"},{"issue":"1","key":"443_CR34","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10489-006-0031-1","volume":"27","author":"S-L Wang","year":"2007","unstructured":"Wang S-L, Patel\u00a0D, Jafari\u00a0A, Hong T-P (2007) Hiding collaborative recommendation association rules. Appl Intell 27(1):67\u201377","journal-title":"Appl Intell"},{"issue":"1","key":"443_CR35","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/s10489-009-0201-z","volume":"35","author":"Y-T Wang","year":"2011","unstructured":"Wang Y-T, Cheng J-T (2011) Mining periodic movement patterns of mobile phone users based on an efficient sampling approach. Appl Intell 35(1):32\u201340","journal-title":"Appl Intell"},{"key":"443_CR36","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1137\/1.9781611972740.51","volume-title":"Proceedings of the 4th SIAM international conference on data mining (SDM\u201904)","author":"H Yao","year":"2004","unstructured":"Yao\u00a0H, Hamilton HJ, Butz CJ (2004) A\u00a0foundational approach to mining itemset utilities from databases. In: Proceedings of the 4th SIAM international conference on data mining (SDM\u201904), pp 482\u2013486"},{"issue":"3","key":"443_CR37","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","volume":"59","author":"H Yao","year":"2006","unstructured":"Yao\u00a0H, Hamilton HJ (2006) Mining itemset utilities from transaction databases. Data Knowl Eng 59(3):603\u2013626","journal-title":"Data Knowl Eng"},{"issue":"1","key":"443_CR38","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4018\/jdwm.2009010104","volume":"5","author":"G Yu","year":"2009","unstructured":"Yu\u00a0G, Shao\u00a0S, Luo\u00a0B, Zeng\u00a0X (2009) A\u00a0hybrid method for high-utility itemsets mining in large high-dimensional data. Int J Data Warehous Min 5(1):57\u201373","journal-title":"Int J Data Warehous Min"},{"key":"443_CR39","first-page":"326","volume-title":"Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201903)","author":"MJ Zaki","year":"2003","unstructured":"Zaki MJ, Gouda\u00a0K (2003) Fast vertical mining using diffsets. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201903), pp 326\u2013335"},{"issue":"1","key":"443_CR40","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/s10489-010-0247-y","volume":"36","author":"S Zhang","year":"2012","unstructured":"Zhang\u00a0S, Chen\u00a0F, Wu\u00a0X, Zhang\u00a0C, Wang\u00a0R (2012) Mining bridging rules between conceptual clusters. Appl Intell 36(1):108\u2013118","journal-title":"Appl Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0443-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-013-0443-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0443-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T05:37:52Z","timestamp":1595828272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-013-0443-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,29]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["443"],"URL":"https:\/\/doi.org\/10.1007\/s10489-013-0443-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,29]]}}}