{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T20:19:05Z","timestamp":1760473145670,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T00:00:00Z","timestamp":1665792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T00:00:00Z","timestamp":1665792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61202022"],"award-info":[{"award-number":["61202022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61202022","61202022"],"award-info":[{"award-number":["61202022","61202022"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Data stream is a type of data that continue to grow over time. For example, network security data stream will constantly be generated in the field of data security, and encrypted data stream will be generated in the privacy protection scenario. Clustering is a basic task in the analysis of data stream. In addition to the large amount of data and limited computer memory, there are the following challenges in time-decaying data stream clustering: (1) How to quickly process time-varying data stream and how to quickly save vaild data. (2) How to maintain and update clusters and track their evolution in real time. Based on the fact that the existing data stream algorithms do not provide a good strategy to the above problems, this paper proposes a dynamic clustering algorithm named SKDStream. The algorithm divides the entire data space into distinct minimal bound hypercubes, which are maintained and indexed by a newly defined structure, SKDTree, that aggregates and updates clusters in real time without requiring large primary storage. Clusters are composed of dense hypercubes. Experiments on synthetic datasets and real datasets show that the response time of the algorithm is similar to that of existing dataflow algorithms, but the quality of the generated clusters is relatively stable over time. Furthermore, the SKDStream algorithm is able to track the evolution of the number of clusters, centers, and density in real time, and compared to D-stream, SKDStream is efficient and effective in clustering.<\/jats:p>","DOI":"10.1186\/s13638-022-02160-0","type":"journal-article","created":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T10:02:44Z","timestamp":1665828164000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["SKDStream: a dynamic clustering algorithm on time-decaying data stream"],"prefix":"10.1186","volume":"2022","author":[{"given":"Hui","family":"Liu","sequence":"first","affiliation":[]},{"given":"Aihua","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Mingkang","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Chin-Chen","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,15]]},"reference":[{"key":"2160_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2133803.2184450","volume":"17","author":"MR Ackermann","year":"2012","unstructured":"M.R. Ackermann, M M\u00e4rtens, C. Raupach, K. Swierkot, C. Lammersen, C. Sohler, Streamkm++ a clustering algorithm for data streams. J. Exp. Algorithmics 17, 1\u20132 (2012)","journal-title":"J. Exp. Algorithmics"},{"key":"2160_CR2","doi-asserted-by":"crossref","unstructured":"C. Aggarwal, S.Y. Philip, J. Han,  J. Wang, A framework for clustering evolving data streams. In: Proceedings 2003 VLDB conference, pp. 81\u201392. Elsevier, (2003)","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"2160_CR3","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.jnca.2014.11.007","volume":"59","author":"A Amini","year":"2016","unstructured":"A. Amini, H. Saboohi, T. Herawan, T.Y. Wah, Mudi-stream: a multi density clustering algorithm for evolving data stream. J. Netw. Comput. Appl. 59, 370\u2013385 (2016)","journal-title":"J. Netw. Comput. Appl."},{"issue":"1","key":"2160_CR4","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s11390-014-1416-y","volume":"29","author":"A Amini","year":"2014","unstructured":"A. Amini, T.Y. Wah, H. Saboohi, On density-based data streams clustering algorithms: a survey. J. Comput. Sci. Technol. 29(1), 116\u2013141 (2014)","journal-title":"J. Comput. Sci. Technol."},{"issue":"9","key":"2160_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"J.L. Bentley, Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"1","key":"2160_CR6","first-page":"107","volume":"3","author":"AM Berg","year":"2016","unstructured":"A.M. Berg, S.T. Mol, G. Kismih\u00f3k, N. Sclater, The role of a reference synthetic data generator within the field of learning analytics. J. Learn. Anal. 3(1), 107\u2013128 (2016)","journal-title":"J. Learn. Anal."},{"key":"2160_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ins.2019.12.022","volume":"518","author":"CG Bezerra","year":"2020","unstructured":"C.G. Bezerra, B.S.J. Costa, L.A. Guedes, P.P. Angelov, An evolving approach to data streams clustering based on typicality and eccentricity data analytics. Inf. Sci. 518, 13\u201328 (2020)","journal-title":"Inf. Sci."},{"key":"2160_CR8","doi-asserted-by":"crossref","unstructured":"F. Cao, M. Estert, W. Qian, A. Zhou. Density-based clustering over an evolving data stream with noise. In: Proceedings of the 2006 SIAM international conference on data mining, pp. 328\u2013339. SIAM, (2006)","DOI":"10.1137\/1.9781611972764.29"},{"key":"2160_CR9","doi-asserted-by":"crossref","unstructured":"Y. Chen,  L.\u00a0Tu. Density-based clustering for real-time stream data. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 133\u2013142, (2007)","DOI":"10.1145\/1281192.1281210"},{"key":"2160_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39964-3_42","volume-title":"Dynamic topic mining from news stream data","author":"S Chung","year":"2003","unstructured":"S. Chung, D. Mcleod, Dynamic topic mining from news stream data (Springer, Berlin, 2003)"},{"issue":"99","key":"2160_CR11","first-page":"1","volume":"PP","author":"M Cui","year":"2019","unstructured":"M. Cui, D. Han, J. Wang, An efficient and safe road condition monitoring authentication scheme based on fog computing. IEEE Internet Things J. PP(99), 1\u20131 (2019)","journal-title":"IEEE Internet Things J."},{"issue":"12","key":"2160_CR12","doi-asserted-by":"publisher","first-page":"15815","DOI":"10.1109\/TVT.2020.3036631","volume":"69","author":"M Cui","year":"2020","unstructured":"M. Cui, D. Han, J. Wang, K.C. Li, C.C. Chang, Arfv: an efficient shared data auditing scheme supporting revocation for fog-assisted vehicular ad-hoc networks. IEEE Trans. Veh. Technol. 69(12), 15815\u201315827 (2020)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"2160_CR13","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.eswa.2016.09.020","volume":"67","author":"J de Andrade Silva","year":"2017","unstructured":"J. de Andrade Silva, E.R. Hruschka, J. Gama, An evolutionary algorithm for clustering data streams with a variable number of clusters. Expert Syst. Appl. 67, 228\u2013238 (2017)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"2160_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.3233\/IDA-2010-0453","volume":"15","author":"J Gama","year":"2011","unstructured":"J. Gama, P.   P. Rodrigues, L. Lopes, Clustering distributed sensor data streams using local processing and reduced communication. Intell. Data Anal. 15(1), 3\u201328 (2011)","journal-title":"Intell. Data Anal."},{"issue":"1","key":"2160_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s41044-016-0011-3","volume":"1","author":"M Ghesmoune","year":"2016","unstructured":"M. Ghesmoune, M. Lebbah, H. Azzag, State-of-the-art on clustering data streams. Big Data Anal. 1(1), 1\u201327 (2016)","journal-title":"Big Data Anal."},{"issue":"4","key":"2160_CR16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/3186728.3164136","volume":"11","author":"S Gong","year":"2017","unstructured":"S. Gong, Y. Zhang, Y. Ge, Clustering stream data by exploring the evolution of density mountain. Proc. VLDB Endow. 11(4), 393\u2013405 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"99","key":"2160_CR17","first-page":"1","volume":"PP","author":"D Han","year":"2020","unstructured":"D. Han, N. Pan, K.C. Li, A traceable and revocable ciphertext-policy attribute-based encryption scheme based on privacy protection. IEEE Trans. Depend. Secure Comput. PP(99), 1\u20131 (2020)","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"2160_CR18","doi-asserted-by":"crossref","unstructured":"D. Han, Y. Zhu, D. Li, W. Liang, A. Souri,  K.C. Li. A blockchain-based auditable access control system for private data in service-centric iot environments. IEEE Transactions on Industrial Informatics, (2021)","DOI":"10.1109\/TII.2021.3114621"},{"key":"2160_CR19","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ins.2016.12.004","volume":"382","author":"R Hyde","year":"2017","unstructured":"R. Hyde, P. Angelov, A.R. MacKenzie, Fully online clustering of evolving data streams into arbitrarily shaped clusters. Inf. Sci. 382, 96\u2013114 (2017)","journal-title":"Inf. Sci."},{"key":"2160_CR20","doi-asserted-by":"crossref","unstructured":"C. Isaksson, M.H. Dunham, M. Hahsler, Sostream: self organizing density-based clustering over data stream. In: International workshop on machine learning and data mining in pattern recognition, pp. 264\u2013278. Springer, (2012)","DOI":"10.1007\/978-3-642-31537-4_21"},{"key":"2160_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ins.2019.03.022","volume":"489","author":"MK Islam","year":"2019","unstructured":"M.K. Islam, M.M. Ahmed, K.Z. Zamli, A buffer-based online clustering for evolving data stream. Inf. Sci. 489, 113\u2013135 (2019)","journal-title":"Inf. Sci."},{"issue":"8","key":"2160_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.14445\/23488387\/IJCSE-V3I8P101","volume":"3","author":"P Kumar","year":"2016","unstructured":"P. Kumar, Data stream clustering in internet of things. SSRG Int. J. Comput. Sci. Eng. 3(8), 1\u201314 (2016)","journal-title":"SSRG Int. J. Comput. Sci. Eng."},{"key":"2160_CR23","doi-asserted-by":"crossref","unstructured":"V. Kumar, J.K. Chhabra,  D. Kumar, Initializing cluster center for k-means using biogeography based optimization. In: international conference on advances in computing, communication and control, pp. 448\u2013456. Springer, (2011)","DOI":"10.1007\/978-3-642-18440-6_57"},{"key":"2160_CR24","doi-asserted-by":"crossref","unstructured":"H. Li, D. Han, M. Tang, A privacy-preserving storage scheme for logistics data with assistance of blockchain. IEEE Internet of Things J (2021)","DOI":"10.1109\/JIOT.2021.3107846"},{"key":"2160_CR25","doi-asserted-by":"crossref","unstructured":"J. Ren, R. Ma, Density-based data streams clustering over sliding windows. In: 2009 Sixth international conference on fuzzy systems and knowledge discovery, pp. 248\u2013252. IEEE, (2009)","DOI":"10.1109\/FSKD.2009.553"},{"key":"2160_CR26","doi-asserted-by":"crossref","unstructured":"J. Steil, M.X. Huang, A. Bulling, Fixation detection for head-mounted eye tracking based on visual similarity of gaze targets. In: Proceedings of the 2018 ACM Symposium on eye tracking research & applications, pp. 1\u20139, (2018)","DOI":"10.1145\/3204493.3204538"},{"issue":"10","key":"2160_CR27","doi-asserted-by":"publisher","first-page":"3162","DOI":"10.1007\/s10489-020-01694-4","volume":"50","author":"Q Tian","year":"2020","unstructured":"Q. Tian, D. Han, K.C.  Li, X. Liu, L. Duan, A. Castiglione, An intrusion detection approach based on improved deep belief network. Appl. Intell. 50(10), 3162\u20133178 (2020)","journal-title":"Appl. Intell."},{"key":"2160_CR28","doi-asserted-by":"crossref","unstructured":"K. Udommanetanakit, T. Rakthanmanon, K. Waiyamai, E-stream: evolution-based technique for stream clustering. In: International Conference on advanced data mining and applications, pp. 605\u2013615. Springer, (2007)","DOI":"10.1007\/978-3-540-73871-8_58"},{"key":"2160_CR29","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.knosys.2016.12.025","volume":"120","author":"X Ji","year":"2017","unstructured":"X. Ji, G. Wang, T. Li, W. Deng, G. Gou, Fat node leading tree for data stream clustering with density peaks. Knowl. Based Syst. 120, 99\u2013117 (2017)","journal-title":"Knowl. Based Syst."},{"key":"2160_CR30","doi-asserted-by":"crossref","unstructured":"C. Yin, L. Xia, J. Wang, Application of an improved data stream clustering algorithm in intrusion detection system. In: advanced multimedia and ubiquitous engineering, pp. 626\u2013632. Springer, (2017)","DOI":"10.1007\/978-981-10-5041-1_99"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02160-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13638-022-02160-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02160-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T10:04:11Z","timestamp":1665828251000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-022-02160-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,15]]},"references-count":30,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["2160"],"URL":"https:\/\/doi.org\/10.1186\/s13638-022-02160-0","relation":{},"ISSN":["1687-1499"],"issn-type":[{"type":"electronic","value":"1687-1499"}],"subject":[],"published":{"date-parts":[[2022,10,15]]},"assertion":[{"value":"11 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2022","order":3,"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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"102"}}