{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:59:48Z","timestamp":1769443188379,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T00:00:00Z","timestamp":1524009600000},"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":"publisher","award":["61503092"],"award-info":[{"award-number":["61503092"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012156","name":"Shenzhen Technical Project","doi-asserted-by":"crossref","award":["JCYJ20170307151733005"],"award-info":[{"award-number":["JCYJ20170307151733005"]}],"id":[{"id":"10.13039\/501100012156","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012156","name":"Shenzhen Technical Project","doi-asserted-by":"crossref","award":["KQJSCX20170726103424709"],"award-info":[{"award-number":["KQJSCX20170726103424709"]}],"id":[{"id":"10.13039\/501100012156","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10489-018-1180-8","type":"journal-article","created":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T01:25:03Z","timestamp":1524014703000},"page":"3691-3706","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Maintenance algorithm for high average-utility itemsets with transaction deletion"],"prefix":"10.1007","volume":"48","author":[{"given":"Jerry Chun-Wei","family":"Lin","sequence":"first","affiliation":[]},{"given":"Yina","family":"Shao","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]},{"given":"Youcef","family":"Djenouri","sequence":"additional","affiliation":[]},{"given":"Xiangmin","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,18]]},"reference":[{"key":"1180_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. The International Conference on Very Large Data Bases, pp 487\u2013499"},{"key":"1180_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1994) Quest synthetic data generator. http:\/\/www.Almaden.ibm.com\/cs\/quest\/syndata.html","DOI":"10.1145\/191843.191972"},{"issue":"12","key":"1180_CR3","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Lee YK (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"},{"key":"1180_CR4","doi-asserted-by":"crossref","unstructured":"Erwin A, Gopalan RP, Achuthan NR (2008) Efficient mining of high utility itemsets from large datasets. Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pp 554\u2013561","DOI":"10.1007\/978-3-540-68125-0_50"},{"key":"1180_CR5","doi-asserted-by":"crossref","unstructured":"Cheung DW, Wong CY, Han J, Ng VT (1996) Maintenance of discovered association rules in large databases: an incremental updating techniques. Proceedings of the Twelfth International Conference, pp 106\u2013114","DOI":"10.1109\/ICDE.1996.492094"},{"key":"1180_CR6","doi-asserted-by":"crossref","unstructured":"Cheung DW, Lee SD, Kao B (1997) A general incremental technique for maintaining discovered association rules. The International Conference on Database Systems for Advanced Applications, pp 185\u2013194","DOI":"10.1142\/9789812819536_0020"},{"issue":"2","key":"1180_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/69.683753","volume":"10","author":"MS Chen","year":"1998","unstructured":"Chen MS, Park JS, Yu PS (1998) Efficient data mining for path traversal patterns. IEEE Trans Knowl Data Eng 10(2):209\u2013221","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1180_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1093\/bioinformatics\/19.1.79","volume":"19","author":"C Creighton","year":"2003","unstructured":"Creighton C, Hanash S (2003) Mining gene expression databases for association rules. Bioinformatics 19 (1):79\u201386","journal-title":"Bioinformatics"},{"issue":"10","key":"1180_CR9","doi-asserted-by":"publisher","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"Z Deng","year":"2014","unstructured":"Deng Z, Lv SL (2014) Fast mining frequent itemsets using nodesets. Expert Syst Appl 41(10):4505\u20134512","journal-title":"Expert Syst Appl"},{"key":"1180_CR10","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The SPMF open-source data mining library version 2. Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp 36\u201340","DOI":"10.1007\/978-3-319-46131-1_8"},{"issue":"1","key":"1180_CR11","doi-asserted-by":"publisher","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":"4","key":"1180_CR12","doi-asserted-by":"publisher","first-page":"2424","DOI":"10.1016\/j.eswa.2007.04.009","volume":"34","author":"TP Hong","year":"2008","unstructured":"Hong TP, Lin CW, Wu YL (2008) Incrementally fast updated frequent pattern trees. Expert Syst Appl 34(4):2424\u20132435","journal-title":"Expert Syst Appl"},{"issue":"7","key":"1180_CR13","doi-asserted-by":"publisher","first-page":"2485","DOI":"10.1016\/j.csda.2009.01.015","volume":"53","author":"TP Hong","year":"2009","unstructured":"Hong TP, Lin CW, Wu YL (2009) Maintenance of fast updated frequent pattern trees for record deletion. Comput Stat Data Anal 53(7):2485\u20132499","journal-title":"Comput Stat Data Anal"},{"issue":"7","key":"1180_CR14","doi-asserted-by":"publisher","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"TP Hong","year":"2011","unstructured":"Hong TP, Lee CH, Wang SL (2011) Effective utility mining with the measure of average utility. Expert Syst Appl 38(7):8259\u20138265","journal-title":"Expert Syst Appl"},{"key":"1180_CR15","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A fast high utility itemsets mining algorithm. International Workshop on Utility-Based Data Mining, pp 90\u201399","DOI":"10.1145\/1089827.1089839"},{"key":"1180_CR16","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pp 689\u2013 695","DOI":"10.1007\/11430919_79"},{"issue":"1","key":"1180_CR17","doi-asserted-by":"publisher","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":"5","key":"1180_CR18","doi-asserted-by":"publisher","first-page":"9498","DOI":"10.1016\/j.eswa.2008.03.014","volume":"36","author":"CW Lin","year":"2009","unstructured":"Lin CW, Hong TP, Lu WH (2009) The Pre-FUFP algorithm for incremental mining. Expert Syst Appl 36(5):9498\u20139505","journal-title":"Expert Syst Appl"},{"issue":"8","key":"1180_CR19","doi-asserted-by":"publisher","first-page":"7173","DOI":"10.1016\/j.eswa.2012.01.072","volume":"39","author":"CW Lin","year":"2009","unstructured":"Lin CW, Lan GC, Hong TP (2009) An incremental mining algorithm for high utility itemsets. Expert Syst Appl 39(8):7173\u20137180","journal-title":"Expert Syst Appl"},{"key":"1180_CR20","doi-asserted-by":"crossref","unstructured":"Lin CW, Hong TP, Lu WH (2010) Efficiently mining high average utility itemsets with a tree structure. Asian Conference on Intelligent Information and Database Systems, pp 131\u2013139","DOI":"10.1007\/978-3-642-12145-6_14"},{"issue":"6","key":"1180_CR21","doi-asserted-by":"publisher","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","volume":"38","author":"CW Lin","year":"2011","unstructured":"Lin CW, Hong TP, Lu WH (2011) An effective tree structure for mining high utility itemsets. Expert Syst Appl 38(6):7419\u2013 7424","journal-title":"Expert Syst Appl"},{"key":"1180_CR22","doi-asserted-by":"crossref","unstructured":"Liu J, Wang K, Fung BCM (2012) Direct discovery of high utility itemsets without candidate generation. IEEE International Conference on Data Mining, pp 984\u2013989","DOI":"10.1109\/ICDM.2012.20"},{"key":"1180_CR23","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. ACM International Conference on Information and Knowledge Management, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"issue":"5","key":"1180_CR24","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1142\/S0219622012500307","volume":"11","author":"GC Lan","year":"2012","unstructured":"Lan GC, Hong TP, Tseng VS (2012) Efficient mining high average-utility itemsets with an improved upper-bound strategy. Int J Inform Technol Decis Making 11(5):1009\u20131030","journal-title":"Int J Inform Technol Decis Making"},{"key":"1180_CR25","doi-asserted-by":"crossref","unstructured":"Lu T, Vo B, Nguyen HT, Hong TP (2014) A new method for mining high average utility itemsets. Computer Information Systems and Industrial Management, pp 33\u201342","DOI":"10.1007\/978-3-662-45237-0_5"},{"issue":"1","key":"1180_CR26","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.aei.2014.08.003","volume":"29","author":"CW Lin","year":"2015","unstructured":"Lin CW, Hong TP, Lan GC, Wong JW, Lin WY (2015) Efficient updating of discovered high-utility itemsets for transaction deletion in dynamic databases. Adv Eng Inform 29(1):16\u201327","journal-title":"Adv Eng Inform"},{"issue":"5","key":"1180_CR27","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1109\/TKDE.2015.2510012","volume":"28","author":"J Liu","year":"2016","unstructured":"Liu J, Wang K, Fung BCM (2016) Mining high utility patterns in one phase without generating candidates. IEEE Trans Knowl Data Eng 28(5):1245\u20131257","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"1180_CR28","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"CW Lin","year":"2016","unstructured":"Lin CW, Li T, Fournier-Viger P, Hong TP, Zhan J, Voznak M (2016) An efficient algorithm to mine high average-utility itemsets. Adv Eng Inform 30(2):233\u2013243","journal-title":"Adv Eng Inform"},{"key":"1180_CR29","doi-asserted-by":"publisher","first-page":"12927","DOI":"10.1109\/ACCESS.2017.2717438","volume":"5","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Ren S, Fournier-Viger P, Hong TP (2017) EHAUPM: Efficient high average-utility pattern mining with tighter upper-bound models. IEEE Access 5:12927\u201312940","journal-title":"IEEE Access"},{"key":"1180_CR30","doi-asserted-by":"publisher","first-page":"12927","DOI":"10.1109\/ACCESS.2017.2717438","volume":"5","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Ren S, Fournier-Viger P, Hong TP (2017) EHAUPM: efficient high average-utility pattern mining with tighter upper-bound models. IEEE Access 5:12927\u201312940","journal-title":"IEEE Access"},{"issue":"8","key":"1180_CR31","doi-asserted-by":"publisher","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"},{"key":"1180_CR32","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. SIAM International Conference on Data Mining, pp 215\u2013221","DOI":"10.1137\/1.9781611972740.51"},{"key":"1180_CR33","doi-asserted-by":"crossref","unstructured":"Yen SJ, Lee YS (2007) Mining high utility quantitative association rules. International Conference on Data Warehousing and Knowledge Discovery, pp 283\u2013292","DOI":"10.1007\/978-3-540-74553-2_26"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-018-1180-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1180-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1180-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T23:25:46Z","timestamp":1571181946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-018-1180-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,18]]},"references-count":33,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["1180"],"URL":"https:\/\/doi.org\/10.1007\/s10489-018-1180-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,18]]},"assertion":[{"value":"18 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}