{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T04:22:09Z","timestamp":1783570929066,"version":"3.55.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T00:00:00Z","timestamp":1698364800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T00:00:00Z","timestamp":1698364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LQ21F030010"],"award-info":[{"award-number":["LQ21F030010"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007834","name":"Natural Science Foundation of Ningbo","doi-asserted-by":"publisher","award":["202003N4306"],"award-info":[{"award-number":["202003N4306"]}],"id":[{"id":"10.13039\/100007834","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Public Welfare Foundation of Ningbo","award":["2021S108"],"award-info":[{"award-number":["2021S108"]}]},{"name":"the Key Technology R&D Program of Ningbo","award":["2022Z149"],"award-info":[{"award-number":["2022Z149"]}]},{"name":"Ningbo Science and Technology Special Innovation Projects","award":["2022Z095"],"award-info":[{"award-number":["2022Z095"]}]},{"name":"Ningbo Science and Technology Special Innovation Projects","award":["2022Z235"],"award-info":[{"award-number":["2022Z235"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10489-023-05076-4","type":"journal-article","created":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T14:02:11Z","timestamp":1698415331000},"page":"29319-29337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Mining top-k high average-utility itemsets based on breadth-first search"],"prefix":"10.1007","volume":"53","author":[{"given":"Xuan","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Genlang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9618-8965","authenticated-orcid":false,"given":"Fangyu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shiting","family":"Wen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wanli","family":"Zuo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,27]]},"reference":[{"key":"5076_CR1","first-page":"12","volume":"1","author":"H Liu","year":"2022","unstructured":"Liu H, Liu T, Chen Y et al (2022) EHPE: Skeleton cues-based gaussian coordinate encoding for efficient human pose estimation. IEEE Trans Multimedia 1:12","journal-title":"IEEE Trans Multimedia"},{"key":"5076_CR2","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.neucom.2020.12.090","volume":"436","author":"T Liu","year":"2021","unstructured":"Liu T, Wang J, Yang B et al (2021) NGDNet: Nonuniform Gaussian-label distribution learning for infrared head pose estimation and on-task behavior understanding in the classroom. Neurocomputing 436:210\u2013220","journal-title":"Neurocomputing"},{"key":"5076_CR3","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1109\/TMM.2021.3081873","volume":"24","author":"H Liu","year":"2021","unstructured":"Liu H, Fang S, Zhang Z et al (2021) MFDNet: Collaborative poses perception and matrix Fisher distribution for head pose estimation. IEEE Trans Multimedia 24:2449\u20132460","journal-title":"IEEE Trans Multimedia"},{"key":"5076_CR4","first-page":"14","volume":"1","author":"H Liu","year":"2023","unstructured":"Liu H, Zhang C, Deng Y et al (2023) TransIFC: invariant cues-aware feature concentration learning for efficient fine-grained bird image classification. IEEE Trans Multimedia 1:14","journal-title":"IEEE Trans Multimedia"},{"key":"5076_CR5","first-page":"11","volume":"1","author":"T Liu","year":"2023","unstructured":"Liu T, Liu H, Yang B et al (2023) LDCNet: Limb Direction Cues-aware Network for Flexible Human Pose Estimation in Industrial Behavioral Biometrics Systems. IEEE Trans Ind Inf 1:11","journal-title":"IEEE Trans Ind Inf"},{"issue":"10","key":"5076_CR6","doi-asserted-by":"crossref","first-page":"7107","DOI":"10.1109\/TII.2022.3143605","volume":"18","author":"H Liu","year":"2022","unstructured":"Liu H, Liu T, Zhang Z et al (2022) Arhpe: Asymmetric relation-aware representation learning for head pose estimation in industrial human\u2013computer interaction. IEEE Trans Industr Inf 18(10):7107\u20137117","journal-title":"IEEE Trans Industr Inf"},{"issue":"6","key":"5076_CR7","first-page":"e1329","volume":"9","author":"JM Luna","year":"2019","unstructured":"Luna JM, Fournier-Viger P, Sebasti\u00e1n V (2019) Frequent itemset mining: A 25 years review. Wiley Interdiscip Rev: Data Mining and Knowledge Discovery 9(6):e1329","journal-title":"Wiley Interdiscip Rev: Data Mining and Knowledge Discovery"},{"key":"5076_CR8","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases 1215:487\u2013499"},{"issue":"3","key":"5076_CR9","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5076_CR10","unstructured":"Savasere A, Omiecinski E, Navathe SB (1995) An efficient algorithm for mining association rules in large databases. Proceedings of the 21th International Conference on Very Large Data Bases 432\u2013444."},{"issue":"1","key":"5076_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"JW Han","year":"2004","unstructured":"Han JW, Pei J, Yin YW et al (2004) Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min Knowl Disc 8(1):53\u201387","journal-title":"Data Min Knowl Disc"},{"key":"5076_CR12","doi-asserted-by":"crossref","unstructured":"Uno T, Kiyomi M, Arimura H (2004)\u00a0LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations,\u00a0126:1\u201311","DOI":"10.1145\/1133905.1133916"},{"issue":"10","key":"5076_CR13","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne G, Zhu JF (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":"8","key":"5076_CR14","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 et al (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"},{"issue":"1","key":"5076_CR15","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":"5","key":"5076_CR16","doi-asserted-by":"crossref","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":"5","key":"5076_CR17","doi-asserted-by":"crossref","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"},{"key":"5076_CR18","doi-asserted-by":"crossref","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:168\u2013183","journal-title":"Expert Syst Appl"},{"key":"5076_CR19","doi-asserted-by":"crossref","unstructured":"Peng AY, Koh YS, Riddle P (2017) mHUIMiner: A fast high utility itemset mining algorithm for sparse datasets. Proceedings of the 21st Pacific-Asia Conference on Knowledge Discovery and Data Mining 196\u2013207","DOI":"10.1007\/978-3-319-57529-2_16"},{"issue":"1","key":"5076_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3462636","volume":"13","author":"MS Nawaz","year":"2022","unstructured":"Nawaz MS, Fournier-Viger P, Yun U et al (2022) Mining high utility itemsets with Hill climbing and simulated annealing. ACM Trans Manag Inf Syst 13(1):1\u201322","journal-title":"ACM Trans Manag Inf Syst"},{"issue":"4","key":"5076_CR21","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1109\/TKDE.2019.2942594","volume":"33","author":"W Gan","year":"2021","unstructured":"Gan W, Lin JC-W, Fournier-Viger P et al (2021) A survey of utility-oriented pattern mining. IEEE Trans Knowl Data Eng 33(4):1306\u20131327","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5076_CR22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.eswa.2018.07.051","volume":"115","author":"H-J Choi","year":"2019","unstructured":"Choi H-J, Park CH (2019) Emerging topic detection in twitter stream based on high utility pattern mining. Expert Syst Appl 115:27\u201336","journal-title":"Expert Syst Appl"},{"key":"5076_CR23","doi-asserted-by":"crossref","first-page":"104008","DOI":"10.1016\/j.tourman.2019.104008","volume":"77","author":"HQ Vu","year":"2020","unstructured":"Vu HQ, Li G, Law R (2020) Discovering highly profitable travel patterns by high-utility pattern mining. Tour Manage 77:104008","journal-title":"Tour Manage"},{"issue":"4","key":"5076_CR24","doi-asserted-by":"crossref","first-page":"3901","DOI":"10.1007\/s10489-021-02611-z","volume":"52","author":"K Singh","year":"2022","unstructured":"Singh K, Kumar R, Biswas B (2022) High average-utility itemsets mining: a survey. Appl Intell 52(4):3901\u20133938","journal-title":"Appl Intell"},{"issue":"7","key":"5076_CR25","doi-asserted-by":"crossref","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"T-P Hong","year":"2011","unstructured":"Hong T-P, Lee C-H, Wang S-L (2011) Effective utility mining with the measure of average utility. Expert Syst Appl 38(7):8259\u20138265","journal-title":"Expert Syst Appl"},{"issue":"1","key":"5076_CR26","first-page":"193","volume":"28","author":"G-C Lan","year":"2012","unstructured":"Lan G-C, Hong T-P, Tseng VS (2012) A projection-based approach for discovering high average-utility itemsets. J Inf Sci Eng 28(1):193\u2013209","journal-title":"J Inf Sci Eng"},{"issue":"05","key":"5076_CR27","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1142\/S0219622012500307","volume":"11","author":"G-C Lan","year":"2012","unstructured":"Lan G-C, Hong T-P, Tseng VS (2012) Efficiently mining high average-utility itemsets with an improved upper-bound strategy. Int J Inf Technol Decis Mak 11(05):1009\u20131030","journal-title":"Int J Inf Technol Decis Mak"},{"key":"5076_CR28","doi-asserted-by":"crossref","unstructured":"Lin C-W, Hong T-P, Lu W-H (2010) Efficiently mining high average utility itemsets with a tree structure. asian conference on intelligent information and database systems 131\u2013139","DOI":"10.1007\/978-3-642-12145-6_14"},{"issue":"2","key":"5076_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. ACM SIGMOD Rec 29(2):1\u201312","journal-title":"ACM SIGMOD Rec"},{"key":"5076_CR30","doi-asserted-by":"crossref","first-page":"144245","DOI":"10.1109\/ACCESS.2019.2945840","volume":"7","author":"I Yildirim","year":"2019","unstructured":"Yildirim I, Celik M (2019) An Efficient Tree-Based Algorithm for Mining High Average-Utility Itemset. IEEE Access 7:144245\u2013144263","journal-title":"IEEE Access"},{"key":"5076_CR31","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. Proceedings of the 21st ACM International Conference on Information and Knowledge Management 55\u201364","DOI":"10.1145\/2396761.2396773"},{"issue":"2","key":"5076_CR32","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Li T, Fournier-Viger P et al (2016) An efficient algorithm to mine high average-utility itemsets. Adv Eng Inform 30(2):233\u2013243","journal-title":"Adv Eng Inform"},{"issue":"2","key":"5076_CR33","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10489-017-0896-1","volume":"47","author":"JC-W Lin","year":"2017","unstructured":"Lin JC-W, Ren S, Fournier-Viger P et al (2017) A fast algorithm for mining high average-utility itemsets. Appl Intell 47(2):331\u2013346","journal-title":"Appl Intell"},{"key":"5076_CR34","doi-asserted-by":"crossref","first-page":"12927","DOI":"10.1109\/ACCESS.2017.2717438","volume":"5","author":"JC-W Lin","year":"2017","unstructured":"Lin JC-W, Ren S, Fournier-Viger P et al (2017) EHAUPM: Efficient high average-utility pattern mining with tighter upper bounds. IEEE Access 5:12927\u201312940","journal-title":"IEEE Access"},{"key":"5076_CR35","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.future.2016.10.027","volume":"68","author":"U Yun","year":"2017","unstructured":"Yun U, Kim D (2017) Mining of high average-utility itemsets using novel list structure and pruning strategy. Futur Gener Comput Syst 68:346\u2013360","journal-title":"Futur Gener Comput Syst"},{"issue":"12","key":"5076_CR36","doi-asserted-by":"crossref","first-page":"10288","DOI":"10.1007\/s11227-020-03247-5","volume":"76","author":"KK Sethi","year":"2020","unstructured":"Sethi KK, Ramesh D (2020) A fast high average-utility itemset mining with efficient tighter upper bounds and novel list structure. J Supercomput 76(12):10288\u201310318","journal-title":"J Supercomput"},{"key":"5076_CR37","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ins.2020.07.043","volume":"543","author":"H Kim","year":"2021","unstructured":"Kim H, Yun U, Baek Y et al (2021) Efficient list based mining of high average utility patterns with maximum average pruning strategies. Inf Sci 543:85\u2013105","journal-title":"Inf Sci"},{"issue":"11","key":"5076_CR38","doi-asserted-by":"crossref","first-page":"2947","DOI":"10.1007\/s10115-021-01614-z","volume":"63","author":"W Song","year":"2021","unstructured":"Song W, Liu L, Huang C (2021) Generalized maximal utility for mining high average-utility itemsets. Knowl Inf Syst 63(11):2947\u20132967","journal-title":"Knowl Inf Syst"},{"issue":"5","key":"5076_CR39","first-page":"6099","volume":"53","author":"G Li","year":"2023","unstructured":"Li G, Shang T, Zhang Y (2023) Efficient mining high average-utility itemsets with effective pruning strategies and novel list structure. Appl Intell 53(5):6099\u20136118","journal-title":"Appl Intell"},{"key":"5076_CR40","doi-asserted-by":"crossref","unstructured":"Wu CW, Shie B-E, Tseng VS et al. (2012) Mining top-k high utility itemsets. Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining 78\u201386","DOI":"10.1145\/2339530.2339546"},{"issue":"1","key":"5076_CR41","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","volume":"28","author":"VS Tseng","year":"2016","unstructured":"Tseng VS, Wu CW, Fournier Viger P et al (2016) Efficient algorithms for mining Top-K high htility itemsets. IEEE Trans Knowl Data Eng 28(1):54\u201367","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5076_CR42","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu CW, Shie BE et al. (2010) UP-Growth: An efficient algorithm for high utility itemset mining. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"key":"5076_CR43","doi-asserted-by":"crossref","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 et al (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":"5076_CR44","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1007\/s10489-018-1316-x","volume":"49","author":"K Singh","year":"2019","unstructured":"Singh K, Singh SS, Kumar A et al (2019) TKEH: an efficient algorithm for mining top-k high utility itemsets. Appl Intell 49:1078\u20131097","journal-title":"Appl Intell"},{"issue":"2","key":"5076_CR45","doi-asserted-by":"crossref","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 et al (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":"5076_CR46","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.eswa.2018.09.051","volume":"117","author":"S Krishnamoorthy","year":"2019","unstructured":"Krishnamoorthy S (2019) Mining top-k high utility itemsets with effective threshold raising strategies. Expert Syst Appl 117:148\u2013165","journal-title":"Expert Syst Appl"},{"key":"5076_CR47","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.ins.2022.12.092","volume":"624","author":"JM Luna","year":"2023","unstructured":"Luna JM, Kiran RU, Fournier-Viger P et al (2023) Efficient mining of top-k high utility itemsets through genetic algorithms. Inf Sci 624:529\u2013553","journal-title":"Inf Sci"},{"key":"5076_CR48","first-page":"5350","volume":"2020","author":"W Gan","year":"2020","unstructured":"Gan W, Wan S, Chen J et al (2020) TopHUI: Top-k high-utility itemset mining with negative utility. IEEE Int Conf Big Data (Big Data) 2020:5350\u20135359","journal-title":"IEEE Int Conf Big Data (Big Data)"},{"issue":"3","key":"5076_CR49","doi-asserted-by":"crossref","first-page":"5637","DOI":"10.3233\/JIFS-201357","volume":"40","author":"R Sun","year":"2021","unstructured":"Sun R, Han M, Zhang C et al (2021) Mining of top-k high utility itemsets with negative utility. J Intell Fuzzy Syst 40(3):5637\u20135652","journal-title":"J Intell Fuzzy Syst"},{"issue":"8","key":"5076_CR50","first-page":"2386","volume":"41","author":"R Sun","year":"2021","unstructured":"Sun R, Han M, Zhang C et al (2021) Algorithm for mining top-k high utility itemsets with negative items. J Comp App 41(8):2386","journal-title":"J Comp App"},{"key":"5076_CR51","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.ins.2021.12.024","volume":"587","author":"M Ashraf","year":"2022","unstructured":"Ashraf M, Abdelkader T, Rady S et al (2022) TKN: An efficient approach for discovering top-k high utility itemsets with positive or negative profits. Inf Sci 587:654\u2013678","journal-title":"Inf Sci"},{"key":"5076_CR52","doi-asserted-by":"crossref","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","journal-title":"Inf Sci"},{"key":"5076_CR53","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1007\/s10489-017-0939-7","volume":"47","author":"S Dawar","year":"2017","unstructured":"Dawar S, Sharma V, Goyal V (2017) Mining top-k high-utility itemsets from a data stream under sliding window model. Appl Intell 47:1240\u20131255","journal-title":"Appl Intell"},{"issue":"2","key":"5076_CR54","doi-asserted-by":"crossref","first-page":"3317","DOI":"10.3233\/JIFS-210610","volume":"41","author":"H Cheng","year":"2021","unstructured":"Cheng H, Han M, Zhang N et al (2021) ETKDS: An efficient algorithm of Top-K high utility itemsets mining over data streams under sliding window model. J Intell Fuzzy Syst 41(2):3317\u20133338","journal-title":"J Intell Fuzzy Syst"},{"issue":"10","key":"5076_CR55","doi-asserted-by":"crossref","first-page":"3429","DOI":"10.1007\/s10489-018-1155-9","volume":"48","author":"R Wu","year":"2018","unstructured":"Wu R, He Z (2018) Top-k high average-utility itemsets mining with effective pruning strategies. Appl Intell 48(10):3429\u20133445","journal-title":"Appl Intell"},{"key":"5076_CR56","doi-asserted-by":"crossref","first-page":"105355","DOI":"10.1016\/j.engappai.2022.105355","volume":"116","author":"X Liu","year":"2022","unstructured":"Liu X, Chen G, Zuo W (2022) Effective algorithms to mine skyline frequent-utility itemsets. Eng Appl Artif Intell 116:105355","journal-title":"Eng Appl Artif Intell"},{"key":"5076_CR57","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin J C W, Gomariz A, et al. (2016) The SPMF open-source data mining library version 2. Proceedings of 19th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2016) Part III, 36\u201340","DOI":"10.1007\/978-3-319-46131-1_8"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05076-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-05076-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05076-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T14:32:31Z","timestamp":1701268351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-05076-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,27]]},"references-count":57,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["5076"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-05076-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,27]]},"assertion":[{"value":"2 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests related to this research.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"The data used in this study were obtained through publicly available sources, and no ethical or informed consent considerations were required.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}]}}