{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:37:34Z","timestamp":1770277054244,"version":"3.49.0"},"reference-count":28,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T00:00:00Z","timestamp":1557360000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2019,6,11]]},"abstract":"<jats:p>\u00a0Time decay model (TDM) is frequently used for mining frequent patterns on data streams, because the information embedded in the data from the new transactions is particularly valuable. However, some existing methods on designing decay factor of TDM are random, so their results are unsteady. Some other methods focus on only 100% recall or 100% precision of algorithm, but the corresponding high precision or high recall is ignored. In order to balance high recall and high precision of algorithm, meanwhile, ensure the stability of the result, a novel average decay factor is designed. In addition, to further increase the weights of the latest transactions and reduce the weights of historical transactions, another novel Gaussian decay factor is proposed. Hence, based on an analysis of existing decay factors, this paper aims to design two novel decay factors and two novel TDMs. Algorithms based on these two TDMs are designed to discover frequent patterns over data streams. The methods of mining frequent patterns on high density or low density data streams are evaluated via experiments. This paper\u2019s research findings show that the application of average time decay factor can balance the high recall and high precision of algorithm. And Gaussian decay factor can produce better performance than existing algorithms.<\/jats:p>","DOI":"10.3233\/jifs-181654","type":"journal-article","created":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T10:43:16Z","timestamp":1557484996000},"page":"5807-5820","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient methods to set decay factor of time decay model over data streams"],"prefix":"10.1177","volume":"36","author":[{"given":"Meng","family":"Han","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, North Minzu University, Yinchuan, China"}]},{"given":"Jian","family":"Ding","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, North Minzu University, Yinchuan, China"}]}],"member":"179","published-online":{"date-parts":[[2019,5,9]]},"reference":[{"key":"e_1_3_2_2_2","article-title":"Adaptive stream mining: Pattern learning and mining from evolving data stream","author":"Bifet A.","year":"2010","unstructured":"A.Bifet, Adaptive stream mining: Pattern learning and mining from evolving data stream, Frontiers in Artificial Intelligence and Applications (2010), IOS Press.","journal-title":"Frontiers in Artificial Intelligence and Applications"},{"key":"e_1_3_2_3_2","first-page":"487","article-title":"Finding recent frequent itemsets adaptively over online data streams","author":"Chang J.H.","year":"2003","unstructured":"J.H.Chang and W.S.Lee, Finding recent frequent itemsets adaptively over online data streams, In SIGKDD'03, 2003, pp. 487\u2013492.","journal-title":"SIGKDD'03"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.04.001"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1142\/S021819401450034X"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.05.007"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0092-4"},{"issue":"9","key":"e_1_3_2_8_2","first-page":"1309","article-title":"Time-decaying sketches for robust aggregation of sensor data","volume":"34","author":"Cormode G.","year":"2009","unstructured":"G.Cormode, S.Tirthapura and B.Xu, Time-decaying sketches for robust aggregation of sensor data, SIAM Journal on Computing 34(9) (2009), 1309\u20131339.","journal-title":"SIAM Journal on Computing"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-0939-7"},{"issue":"6","key":"e_1_3_2_10_2","first-page":"851","article-title":"TDMCS: An efficient method for mining closed frequent patterns over data streams based on time decay model","volume":"14","author":"Han M.","year":"2017","unstructured":"M.Han, J.Ding and J.Li, TDMCS: An efficient method for mining closed frequent patterns over data streams based on time decay model, International Arab Journal of Information Technology 14(6) (2017), 851\u2013860.","journal-title":"International Arab Journal of Information Technology"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3019612.3019867"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0581-y"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-160861"},{"key":"e_1_3_2_14_2","first-page":"266","article-title":"Finding maximal frequent itemsets over online data streams adaptively","author":"Lee D.","year":"2005","unstructured":"D.Lee and W.Lee, Finding maximal frequent itemsets over online data streams adaptively, In ICDM'05, 2005, pp. 266\u2013273.","journal-title":"ICDM'05"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/1982185.1982393"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1001.2008.02585"},{"issue":"3","key":"e_1_3_2_17_2","first-page":"1799","article-title":"A single-scan algorithm for mining sequential patterns from data streams","volume":"8","author":"Li H.F.","year":"2012","unstructured":"H.F.Li, C.C.Ho, et al., A single-scan algorithm for mining sequential patterns from data streams, International Journal of Innovative Computing, Information and Control 8(3A) (2012), 1799\u20131820.","journal-title":"International Journal of Innovative Computing, Information and Control"},{"issue":"7","key":"e_1_3_2_18_2","first-page":"117","article-title":"Mining frequent itemsets from online data streams: Comparative study","volume":"4","author":"Nabil H.M.","year":"2013","unstructured":"H.M.Nabil, A.S.Eldin and M.A.E.Belal, Mining frequent itemsets from online data streams: Comparative study, International Journal of Advanced Computer Science and Applications 4(7) (2013), 117\u2013125.","journal-title":"International Journal of Advanced Computer Science and Applications"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2012.10.011"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.01.078"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.03.001"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.05.035"},{"issue":"1","key":"e_1_3_2_23_2","first-page":"46","article-title":"Mining frequent, maximal and closed frequent itemsets over data stream - a review","volume":"9","author":"Sutha M.J.","year":"2017","unstructured":"M.J.Sutha and F.R.Dhanaseelan, Mining frequent, maximal and closed frequent itemsets over data stream - a review, International Journal of Data Science and Applications 9(1) (2017), 46\u201362.","journal-title":"International Journal of Data Science and Applications"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.01.016"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2017.2682782"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-162106"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.12.029"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488514500470"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-016-5617-1"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-181654","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-181654","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-181654","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:20:39Z","timestamp":1770229239000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-181654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,9]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,6,11]]}},"alternative-id":["10.3233\/JIFS-181654"],"URL":"https:\/\/doi.org\/10.3233\/jifs-181654","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,9]]}}}