{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:50:50Z","timestamp":1757541050948,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T00:00:00Z","timestamp":1661385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T00:00:00Z","timestamp":1661385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2018YFB1700700"],"award-info":[{"award-number":["2018YFB1700700"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51875516"],"award-info":[{"award-number":["51875516"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10489-022-03978-3","type":"journal-article","created":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T12:03:07Z","timestamp":1661428987000},"page":"10800-10824","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An incremental rare association rule mining approach with a life cycle tree structure considering time-sensitive data"],"prefix":"10.1007","volume":"53","author":[{"given":"Kerui","family":"Hu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9358-0099","authenticated-orcid":false,"given":"Lemiao","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Shuyou","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zili","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Naiyu","family":"Fang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,25]]},"reference":[{"issue":"14-15","key":"3978_CR1","doi-asserted-by":"publisher","first-page":"2826","DOI":"10.1016\/j.comcom.2007.05.024","volume":"30","author":"AA Abbasi","year":"2007","unstructured":"Abbasi AA, Younis M (2007) A survey on clustering algorithms for wireless sensor networks. Comput Commun 30(14-15):2826\u20132841. https:\/\/doi.org\/10.1016\/j.comcom.2007.05.024","journal-title":"Comput Commun"},{"key":"3978_CR2","doi-asserted-by":"publisher","unstructured":"Adnan M, Alhajj R, Barker K (2006) Alternative method for increnentally constructing the fp-tree. In: 2006 3rd International IEEE conference intelligent systems, IEEE. https:\/\/doi.org\/10.1109\/IS.2006.348469, pp 494\u2013499","DOI":"10.1109\/IS.2006.348469"},{"key":"3978_CR3","doi-asserted-by":"publisher","first-page":"115603","DOI":"10.1016\/j.eswa.2021.115603","volume":"185","author":"SA Ahmed","year":"2021","unstructured":"Ahmed SA, Nath B (2021) Issp-tree: an improved fast algorithm for constructing a complete prefix tree using single database scan. Expert Syst Appl 185:115603. https:\/\/doi.org\/10.1016\/j.eswa.2021.115603https:\/\/doi.org\/10.1016\/j.eswa.2021.115603","journal-title":"Expert Syst Appl"},{"key":"3978_CR4","doi-asserted-by":"publisher","first-page":"114560","DOI":"10.1016\/j.eswa.2021.114560","volume":"170","author":"F Antonello","year":"2021","unstructured":"Antonello F, Baraldi P, Shokry A, Zio E, Gentile U, Serio L (2021) A novel association rule mining method for the identification of rare functional dependencies in complex technical infrastructures from alarm data. Expert Syst Appl 170:114560. https:\/\/doi.org\/10.1016\/j.eswa.2021.114560","journal-title":"Expert Syst Appl"},{"key":"3978_CR5","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1016\/j.procs.2015.07.391","volume":"57","author":"U Bhatt","year":"2015","unstructured":"Bhatt U, Patel P (2015) A novel approach for finding rare items based on multiple minimum support framework. Procedia Comput Sci 57:1088\u20131095. https:\/\/doi.org\/10.1016\/j.procs.2015.07.391","journal-title":"Procedia Comput Sci"},{"key":"3978_CR6","doi-asserted-by":"publisher","first-page":"105824","DOI":"10.1016\/j.asoc.2019.105824","volume":"85","author":"A Borah","year":"2019","unstructured":"Borah A, Nath B (2019) Incremental rare pattern based approach for identifying outliers in medical data. Appl Soft Comput 85:105824. https:\/\/doi.org\/10.1016\/j.asoc.2019.105824","journal-title":"Appl Soft Comput"},{"issue":"04","key":"3978_CR7","doi-asserted-by":"publisher","first-page":"2150018","DOI":"10.1142\/S0218213021500184","volume":"30","author":"A Borah","year":"2021","unstructured":"Borah A, Nath B (2021) An efficient method for mining rare association rules: a case study on air pollution. Int J Artif Intell Tools 30(04):2150018. https:\/\/doi.org\/10.1142\/S0218213021500184","journal-title":"Int J Artif Intell Tools"},{"key":"3978_CR8","doi-asserted-by":"publisher","unstructured":"Cui Y, Gan W, Lin H, Zheng w (2021) Fri-miner: Fuzzy rare itemset mining. Applied Intelligence. https:\/\/doi.org\/10.1007\/s10489-021-02574-1https:\/\/doi.org\/10.1007\/s10489-021-02574-1","DOI":"10.1007\/s10489-021-02574-1 10.1007\/s10489-021-02574-1"},{"issue":"2","key":"3978_CR9","doi-asserted-by":"publisher","first-page":"e1242,","DOI":"10.1002\/widm.1242","volume":"8","author":"W Gan","year":"2018","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Hong TP, Fujita H (2018) A survey of incremental high-utility itemset mining. Wiley Interdiscip Rev Data Min Knowl Discov 8(2):e1242,. https:\/\/doi.org\/10.1002\/widm.1242","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"3978_CR10","unstructured":"Haglin DJ, Manning AM (2007) On minimal infrequent itemset mining. In: DMIN, pp 141\u2013147"},{"issue":"2","key":"3978_CR11","doi-asserted-by":"publisher","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 Record 29(2):1\u201312. https:\/\/doi.org\/10.1145\/335191.335372https:\/\/doi.org\/10.1145\/335191.335372","journal-title":"ACM Sigmod Record"},{"issue":"1","key":"3978_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/360402.360421","volume":"2","author":"J Hipp","year":"2000","unstructured":"Hipp J, G\u00fcntzer U, Nakhaeizadeh G (2000) Algorithms for association rule mining\u2014a general survey and comparison. ACM Sigkdd Explorations Newsletter 2(1):58\u201364, . https:\/\/doi.org\/10.1145\/360402.360421https:\/\/doi.org\/10.1145\/360402.360421","journal-title":"ACM Sigkdd Explorations Newsletter"},{"issue":"4","key":"3978_CR13","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,. https:\/\/doi.org\/10.1016\/j.eswa.2007.04.009","journal-title":"Expert Syst Appl"},{"key":"3978_CR14","doi-asserted-by":"publisher","unstructured":"Huang DTJ, Koh YS, Dobbie G (2015) Rare pattern mining from data streams using srp-tree and its variants. In: Transactions on large-scale data-and knowledge-centered systems XXI, Springer, pp 140\u2013160. https:\/\/doi.org\/10.1007\/978-3-662-47804-2_7","DOI":"10.1007\/978-3-662-47804-2_7"},{"key":"3978_CR15","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ins.2012.07.047","volume":"222","author":"TCK Huang","year":"2013","unstructured":"Huang TCK (2013) Discovery of fuzzy quantitative sequential patterns with multiple minimum supports and adjustable membership functions. Inform Sci 222:126\u2013146. https:\/\/doi.org\/10.1016\/j.ins.2012.07.047","journal-title":"Inform Sci"},{"key":"3978_CR16","doi-asserted-by":"publisher","unstructured":"Kiran RU, Reddy PK (2010) Mining rare association rules in the datasets with widely varying items\u2019 frequencies. In: International conference on database systems for advanced applications, Springer. https:\/\/doi.org\/10.1007\/978-3-642-12026-8_6, pp 49\u201362","DOI":"10.1007\/978-3-642-12026-8_6"},{"key":"3978_CR17","doi-asserted-by":"publisher","unstructured":"Koh JL, Shieh SF (2004) An efficient approach for maintaining association rules based on adjusting fp-tree structures. In: International conference on database systems for advanced applications, Springer, pp 417\u2013424. https:\/\/doi.org\/10.1007\/978-3-540-24571-1_38","DOI":"10.1007\/978-3-540-24571-1_38"},{"key":"3978_CR18","doi-asserted-by":"publisher","unstructured":"Koh YS, Rountree N (2005) Finding sporadic rules using apriori-inverse. In: Pacific-Asia conference on knowledge discovery and data mining, Springer, pp 97\u2013106. https:\/\/doi.org\/10.1007\/11430919_13","DOI":"10.1007\/11430919_13"},{"issue":"16","key":"3978_CR19","doi-asserted-by":"publisher","first-page":"e5269","DOI":"10.1002\/cpe.5269","volume":"32","author":"S Koulouzis","year":"2020","unstructured":"Koulouzis S, Martin P, Zhou H, Hu Y, Wang J, Carval T, Grenier B, Heikkinen J, De Laat C, Zhao Z (2020) Time-critical data management in clouds: Challenges and a dynamic real-time infrastructure planner (drip) solution. Concurr Comput: Pract Exper 32(16):e5269. https:\/\/doi.org\/10.1002\/cpe.5269","journal-title":"Concurr Comput: Pract Exper"},{"issue":"2","key":"3978_CR20","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1016\/j.eswa.2013.07.094","volume":"41","author":"G Lee","year":"2014","unstructured":"Lee G, Yun U, Ryu KH (2014) Sliding window based weighted maximal frequent pattern mining over data streams. Expert Syst Appl 41(2):694\u2013708. https:\/\/doi.org\/10.1016\/j.eswa.2013.07.094","journal-title":"Expert Syst Appl"},{"issue":"8","key":"3978_CR21","doi-asserted-by":"publisher","first-page":"11304","DOI":"10.1016\/j.eswa.2009.03.045","volume":"36","author":"HF Li","year":"2009","unstructured":"Li HF (2009) Mining top-k maximal reference sequences from streaming web click-sequences with a damped sliding window. Expert Syst Appl 36(8):11304\u201311311. https:\/\/doi.org\/10.1016\/j.eswa.2009.03.045","journal-title":"Expert Syst Appl"},{"issue":"4","key":"3978_CR22","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1007\/s10489-020-01994-9","volume":"51","author":"X Liu","year":"2021","unstructured":"Liu X, Niu X, Fournier-Viger P (2021) Fast top-k association rule mining using rule generation property pruning. Appl Intell 51(4):2077\u20132093. https:\/\/doi.org\/10.1007\/s10489-020-01994-9","journal-title":"Appl Intell"},{"issue":"3","key":"3978_CR23","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10489-014-0603-4","volume":"42","author":"JM Luna","year":"2015","unstructured":"Luna JM, Romero C, Romero JR, Ventura S (2015) An evolutionary algorithm for the discovery of rare class association rules in learning management systems. Appl Intell 42(3):501\u2013513,. https:\/\/doi.org\/10.1007\/s10489-014-0603-4","journal-title":"Appl Intell"},{"key":"3978_CR24","doi-asserted-by":"publisher","first-page":"115898","DOI":"10.1016\/j.eswa.2021.115898","volume":"187","author":"MA Mahdi","year":"2022","unstructured":"Mahdi MA, Hosny KM, Elhenawy I (2022) Fr-tree: A novel rare association rule for big data problem. Expert Syst Appl 187:115898. https:\/\/doi.org\/10.1016\/j.eswa.2021.115898","journal-title":"Expert Syst Appl"},{"issue":"11","key":"3978_CR25","doi-asserted-by":"publisher","first-page":"4753","DOI":"10.1007\/s12652-020-01736-2","volume":"11","author":"S Nagaraj","year":"2020","unstructured":"Nagaraj S, Mohanraj E (2020) A novel fuzzy association rule for efficient data mining of ubiquitous real-time data. J Ambient Intell Humaniz Comput 11(11):4753\u20134763. https:\/\/doi.org\/10.1007\/s12652-020-01736-2","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"3978_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2020.03.030","volume":"529","author":"H Nam","year":"2020","unstructured":"Nam H, Yun U, Yoon E, Lin JCW (2020) Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions. Inform Sci 529:1\u201327. https:\/\/doi.org\/10.1016\/j.ins.2020.03.030","journal-title":"Inform Sci"},{"key":"3978_CR27","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ins.2015.05.006","volume":"320","author":"D Nguyen","year":"2015","unstructured":"Nguyen D, Nguyen LT, Vo B, Hong TP (2015) A novel method for constrained class association rule mining. Inform Sci 320:107\u2013125. https:\/\/doi.org\/10.1016\/j.ins.2019.04.050","journal-title":"Inform Sci"},{"issue":"6","key":"3978_CR28","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1007\/s10489-017-1023-z","volume":"48","author":"LT Nguyen","year":"2018","unstructured":"Nguyen LT, Nguyen NT, Vo B, Nguyen HS (2018) Efficient method for updating class association rules in dynamic datasets with record deletion. Appl Intell 48(6):1491\u20131505. https:\/\/doi.org\/10.1007\/s10489-017-1023-z","journal-title":"Appl Intell"},{"key":"3978_CR29","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","volume":"175","author":"LT Nguyen","year":"2019","unstructured":"Nguyen LT, Nguyen P, Nguyen TD, Vo B, Fournier-Viger P, Tseng VS (2019) Mining high-utility itemsets in dynamic profit databases. Knowl-Based Syst 175:130\u2013144. https:\/\/doi.org\/10.1016\/j.knosys.2019.03.022https:\/\/doi.org\/10.1016\/j.knosys.2019.03.022","journal-title":"Knowl-Based Syst"},{"key":"3978_CR30","doi-asserted-by":"publisher","unstructured":"Padillo F, Luna JM, Ventura S (2017) An evolutionary algorithm for mining rare association rules: a big data approach. In: 2017 IEEE Congress on evolutionary computation (CEC), IEEE. https:\/\/doi.org\/10.1109\/CEC.2017.7969547, pp 2007\u20132014","DOI":"10.1109\/CEC.2017.7969547"},{"key":"3978_CR31","doi-asserted-by":"publisher","unstructured":"Pan Q, Xiang L, Jin Y (2019) Rare association rules mining of diabetic complications based on improved rarity algorithm. In: 2019 IEEE 7th International conference on bioinformatics and computational biology (ICBCB), IEEE,. https:\/\/doi.org\/10.1109\/ICBCB.2019.8854639, pp 115\u2013119","DOI":"10.1109\/ICBCB.2019.8854639"},{"key":"3978_CR32","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.knosys.2013.10.013","volume":"55","author":"G Pyun","year":"2014","unstructured":"Pyun G, Yun U, Ryu KH (2014) Efficient frequent pattern mining based on linear prefix tree. Knowl-Based Syst 55:125\u2013139. https:\/\/doi.org\/10.1016\/j.knosys.2013.10.013","journal-title":"Knowl-Based Syst"},{"key":"3978_CR33","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.neucom.2017.01.078","volume":"239","author":"S Ram\u00edrez-Gallego","year":"2017","unstructured":"Ram\u00edrez-Gallego S, Krawczyk B, Garc\u00eda S, Wo\u017aniak M, Herrera F (2017) A survey on data preprocessing for data stream mining: Current status and future directions. Neurocomputing 239:39\u201357. https:\/\/doi.org\/10.1016\/j.neucom.2017.01.078","journal-title":"Neurocomputing"},{"issue":"2-3","key":"3978_CR34","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0167-739X(97)00019-8","volume":"13","author":"R Srikant","year":"1997","unstructured":"Srikant R, Agrawal R (1997) Mining generalized association rules. Future Gener Comput Syst 13(2-3):161\u2013180. https:\/\/doi.org\/10.1016\/S0167-739X(97)00019-8https:\/\/doi.org\/10.1016\/S0167-739X(97)00019-8","journal-title":"Future Gener Comput Syst"},{"key":"3978_CR35","doi-asserted-by":"publisher","unstructured":"Szathmary L, Napoli A, Valtchev P (2007) Towards rare itemset mining. In: 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), IEEE. https:\/\/doi.org\/10.1109\/ICTAI.2007.30, vol 1, pp 305\u2013312","DOI":"10.1109\/ICTAI.2007.30"},{"key":"3978_CR36","doi-asserted-by":"publisher","unstructured":"Tsang S, Koh YS, Dobbie G (2011) Rp-tree: rare pattern tree mining. In: International conference on data warehousing and knowledge discovery, Springer, pp 277\u2013288. https:\/\/doi.org\/10.1007\/978-3-642-23544-3_21","DOI":"10.1007\/978-3-642-23544-3_21"},{"issue":"3","key":"3978_CR37","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0164-1212(02)00128-0","volume":"67","author":"H Yun","year":"2003","unstructured":"Yun H, Ha D, Hwang B, Ryu KH (2003) Mining association rules on significant rare data using relative support. J Syst Softw 67(3):181\u2013191. https:\/\/doi.org\/10.1016\/S0164-1212(02)00128-0","journal-title":"J Syst Softw"},{"key":"3978_CR38","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.12.029","volume":"144","author":"U Yun","year":"2018","unstructured":"Yun U, Kim D, Yoon E, Fujita H (2018) Damped window based high average utility pattern mining over data streams. Knowl-Based Syst 144:188\u2013205. https:\/\/doi.org\/10.1016\/j.knosys.2017.12.029https:\/\/doi.org\/10.1016\/j.knosys.2017.12.029","journal-title":"Knowl-Based Syst"},{"key":"3978_CR39","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2019.04.050","volume":"494","author":"Yun U","year":"2019","unstructured":"Yun U, Lee G, Yoon E (2019) Advanced approach of sliding window based erasable pattern mining with list structure of industrial fields. Inf Sci 494:37\u201359. https:\/\/doi.org\/10.1016\/j.ins.2019.04.050https:\/\/doi.org\/10.1016\/j.ins.2019.04.050","journal-title":"Inf Sci"},{"issue":"2","key":"3978_CR40","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/s10489-019-01531-3","volume":"50","author":"Z Zhang","year":"2020","unstructured":"Zhang Z, Huang J, Hao J, Gong J, Chen H (2020) Extracting relations of crime rates through fuzzy association rules mining. Appl Intell 50(2):448\u2013467. https:\/\/doi.org\/10.1007\/s10489-019-01531-3https:\/\/doi.org\/10.1007\/s10489-019-01531-3","journal-title":"Appl Intell"},{"key":"3978_CR41","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.comcom.2020.08.012","volume":"163","author":"Q Zheng","year":"2020","unstructured":"Zheng Q, Li Y, Cao J (2020) Application of data mining technology in alarm analysis of communication network. Comput Commun 163:84\u201390. https:\/\/doi.org\/10.1016\/j.comcom.2020.08.012","journal-title":"Comput Commun"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03978-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03978-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03978-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T11:04:06Z","timestamp":1684494246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03978-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,25]]},"references-count":41,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["3978"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03978-3","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2022,8,25]]},"assertion":[{"value":"7 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}}]}}