{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:19:33Z","timestamp":1765545573754},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,7,14]],"date-time":"2009-07-14T00:00:00Z","timestamp":1247529600000},"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":[[2011,4]]},"DOI":"10.1007\/s10489-009-0188-5","type":"journal-article","created":{"date-parts":[[2009,7,13]],"date-time":"2009-07-13T20:46:54Z","timestamp":1247518014000},"page":"181-198","source":"Crossref","is-referenced-by-count":56,"title":["HUC-Prune: an efficient candidate pruning technique to\u00a0mine high utility patterns"],"prefix":"10.1007","volume":"34","author":[{"given":"Chowdhury Farhan","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"Syed Khairuzzaman","family":"Tanbeer","sequence":"additional","affiliation":[]},{"given":"Byeong-Soo","family":"Jeong","sequence":"additional","affiliation":[]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,14]]},"reference":[{"key":"188_CR1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/s10489-007-0099-2","volume":"30","author":"M Adnan","year":"2009","unstructured":"Adnan M, Alhajj R (2009) DRFP-tree: disk resident frequent pattern tree. Appl Intell 30:84\u201397","journal-title":"Appl Intell"},{"issue":"11","key":"188_CR2","doi-asserted-by":"crossref","first-page":"2578","DOI":"10.1093\/ietisy\/e91-d.11.2578","volume":"E91-D","author":"CF Ahmed","year":"2008","unstructured":"Ahmed CF, Tanbeer SK, Jeong B-S, Lee Y-K (2008) Handling dynamic weights in weighted frequent pattern mining. IEICE Trans Inf Syst E91-D(11):2578\u20132588","journal-title":"IEICE Trans Inf Syst"},{"key":"188_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 12th ACM SIGMOD international conference on management of data, 1993, pp\u00a0207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"188_CR4","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large data bases (VLDB), 1994, pp\u00a0487\u2013499"},{"key":"188_CR5","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:153\u2013185","journal-title":"Data Min Knowl Discov"},{"key":"188_CR6","doi-asserted-by":"crossref","unstructured":"Brijs T, Swinnen G, Vanhoof K, Wets G (1999) Using association rules for product assortment decisions: a case study. In: Proceedings of the 5th ACM SIGKDD international conference on knowledge discovery and data mining, 1999, pp\u00a0254\u2013260","DOI":"10.1145\/312129.312241"},{"key":"188_CR7","unstructured":"Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In: Proceedings of the 3rd IEEE international conference on data mining, 2003, pp\u00a019\u201326"},{"key":"188_CR8","doi-asserted-by":"crossref","unstructured":"Cooper C, Zito M (2007) Realistic synthetic data for testing association rule mining algorithms for market basket databases. In: Proceedings of the 11th international conference on principles and practice of knowledge discovery in databases (PKDD), 2007, pp\u00a0398\u2013405","DOI":"10.1007\/978-3-540-74976-9_39"},{"key":"188_CR9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.knosys.2006.08.005","volume":"20","author":"J Dong","year":"2007","unstructured":"Dong J, Han M (2007) BitTableFI: An efficient mining frequent itemsets algorithm. Knowl-Based Syst 20:329\u2013335","journal-title":"Knowl-Based Syst"},{"key":"188_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 (CIT), 2007, pp\u00a071\u201376","DOI":"10.1109\/CIT.2007.120"},{"key":"188_CR11","unstructured":"Frequent itemset mining dataset repository. Available from: http:\/\/fimi.cs.helsinki.fi\/data\/"},{"issue":"10","key":"188_CR12","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne G, Zhu J (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"},{"key":"188_CR13","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:55\u201386","journal-title":"Data Min Knowl Discov"},{"key":"188_CR14","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\u00a0frequent-pattern tree approach. Data Min Knowl Discov 8:53\u201387","journal-title":"Data Min Knowl Discov"},{"key":"188_CR15","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.ins.2006.07.029","volume":"177","author":"Y Huang","year":"2007","unstructured":"Huang Y, Xiong H, Wu W, Deng P, Zhang Z (2007) Mining maximal hyperclique pattern: a\u00a0hybrid search strategy. Inf Sci 177:703\u2013721","journal-title":"Inf Sci"},{"key":"188_CR16","unstructured":"IBM (2009) QUEST Data Mining Project. Available from: http:\/\/www.almaden.ibm.com\/cs\/disciplines\/iis\/"},{"key":"188_CR17","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:198\u2013217","journal-title":"Data Knowl Eng"},{"key":"188_CR18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1021931008240","volume":"18","author":"B Liu","year":"2003","unstructured":"Liu B, Ma Y, Wong CK (2003) Scoring the data using association rules. Appl Intell 18:119\u2013135","journal-title":"Appl Intell"},{"key":"188_CR19","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W-K, Choudhary A (2005) A\u00a0fast high utility itemsets mining algorithm. In: Proceedings of the 1st international conference on utility-based data mining, 2005, pp\u00a090\u201399","DOI":"10.1145\/1089827.1089839"},{"key":"188_CR20","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W-K, Choudhary A (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), 2005, pp\u00a0689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"188_CR21","unstructured":"Pei J, Han J (2000) CLOSET: An efficient algorithm for mining frequent closed itemsets. In: Proceedings of ACM SIGMOD workshop on research issues in data mining and knowledge discovery, 2000, pp\u00a021\u201330"},{"key":"188_CR22","unstructured":"Pisharath J, Liu Y, Parhi J, Liao W-K, Choudhary A, Memik\u00a0G (2006) NU-MineBench version\u00a02.0 source code and datasets. Available from: http:\/\/cucis.ece.northwestern.edu\/projects\/DMS\/MineBench.html"},{"issue":"4","key":"188_CR23","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/TKDE.2006.1599386","volume":"18","author":"M Song","year":"2006","unstructured":"Song M, Rajasekaran S (2006) A transaction mapping algorithm for frequent itemsets mining. IEEE Trans Knowl Data Eng 18(4):472\u2013481","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"188_CR24","series-title":"LNAI","first-page":"233","volume-title":"AI 2003","author":"YG Sucahyo","year":"2003","unstructured":"Sucahyo YG, Gopalan RP, Rudra A (2003) Efficient mining frequent patterns from dense datasets using a cluster of computers. In: AI 2003. LNAI, vol\u00a02903. Springer, Berlin, pp\u00a0233\u2013244"},{"key":"188_CR25","doi-asserted-by":"crossref","unstructured":"Tan PN, Kumar V, Srivastava J (2002) Selecting the right interestingness measure for association patterns. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, 2002, pp\u00a032\u201341","DOI":"10.1145\/775047.775053"},{"issue":"5","key":"188_CR26","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ins.2008.10.027","volume":"179","author":"SK Tanbeer","year":"2009","unstructured":"Tanbeer SK, Ahmed CF, Jeong B-S, Lee Y-K (2009) Efficient single-pass frequent pattern mining using a prefix-tree. Inf Sci 179(5):559\u2013583","journal-title":"Inf Sci"},{"key":"188_CR27","unstructured":"Tao F (2003) Weighted association rule mining using weighted support and significant framework. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, 2003, pp\u00a0661\u2013666"},{"key":"188_CR28","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 W-Y, Jeng R (2008) Updating generalized association rules with evolving taxonomies. Appl Intell 29:306\u2013320","journal-title":"Appl Intell"},{"key":"188_CR29","unstructured":"UCI machine learning repository. Available from: http:\/\/archive.ics.uci.edu\/ml\/"},{"issue":"3","key":"188_CR30","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1084805.1084818","volume":"34","author":"K Verma","year":"2005","unstructured":"Verma K, Vyas OP (2005) Efficient calendar based temporal association rule. SIGMOD Rec 34(3):63\u201370","journal-title":"SIGMOD Rec"},{"key":"188_CR31","doi-asserted-by":"crossref","unstructured":"Wang J, Han J, Pei J (2003) CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, 2003, pp\u00a0236\u2013245","DOI":"10.1145\/956750.956779"},{"key":"188_CR32","doi-asserted-by":"crossref","first-page":"1752","DOI":"10.1016\/j.ins.2005.05.005","volume":"176","author":"CY Wang","year":"2006","unstructured":"Wang CY, Tseng SS, Hong TP (2006) Flexible online association rule mining based on multidimensional pattern relations. Inf Sci 176:1752\u20131780","journal-title":"Inf Sci"},{"key":"188_CR33","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10115-003-0108-7","volume":"6","author":"W Wang","year":"2004","unstructured":"Wang W, Yang J, Yu PS (2004) WAR: weighted association rules for item intensities. Knowl Inf Syst 6:203\u2013229","journal-title":"Knowl Inf Syst"},{"key":"188_CR34","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1016\/j.is.2007.01.001","volume":"32","author":"F Wu","year":"2007","unstructured":"Wu F, Chiang S-W, Lin J-R (2007) A\u00a0new approach to mine frequent patterns using item-transformation method. Inf Syst 32:1056\u20131072","journal-title":"Inf Syst"},{"key":"188_CR35","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10618-006-0043-9","volume":"13","author":"H Xiong","year":"2006","unstructured":"Xiong H, Tan P-N, Kumar V (2006) Hyperclique Pattern Discovery. Data Min Knowl Discov 13:219\u2013242","journal-title":"Data Min Knowl Discov"},{"key":"188_CR36","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:603\u2013626","journal-title":"Data Knowl Eng"},{"key":"188_CR37","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, 2004, pp\u00a0482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"key":"188_CR38","unstructured":"Ye F-Y, Wang J-D, Shao B-L (2005) New algorithm for mining frequent itemsets in sparse database. In: Proceeding of the 4th international conference on machine learning and cybernetics, 2005, pp\u00a01554\u20131558"},{"key":"188_CR39","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:3477\u20133499","journal-title":"Inf Sci"},{"key":"188_CR40","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:86\u201397","journal-title":"Knowl-Based Syst"},{"key":"188_CR41","doi-asserted-by":"crossref","unstructured":"Yun U, Leggett JJ (2005) WFIM: weighted frequent itemset mining with a weight range and a minimum weight. In: Proceedings of the 5th SIAM international conference on data mining, 2005, pp\u00a0636\u2013640","DOI":"10.1137\/1.9781611972757.76"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-009-0188-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-009-0188-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-009-0188-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:25:43Z","timestamp":1559154343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-009-0188-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,14]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["188"],"URL":"https:\/\/doi.org\/10.1007\/s10489-009-0188-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,14]]}}}