A weight clustering algorithm based on sliding window model for stream data
Abstract Streaming data, characterized by its temporal variations and large volumes, presents unique challenges for clustering tasks. To address these challenges, this paper proposes a novel weighted clustering approach specifically designed for streaming data. The proposed method begins with an in-...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-07-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-96696-y |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849238827791548416 |
|---|---|
| author | Jiashun Chen Jianjing Chen Zhaoman Zhong |
| author_facet | Jiashun Chen Jianjing Chen Zhaoman Zhong |
| author_sort | Jiashun Chen |
| collection | DOAJ |
| description | Abstract Streaming data, characterized by its temporal variations and large volumes, presents unique challenges for clustering tasks. To address these challenges, this paper proposes a novel weighted clustering approach specifically designed for streaming data. The proposed method begins with an in-depth analysis of concept drift features in streaming data, followed by the development of a weight parameter calculation technique. Building on this, we introduce a sliding window model clustering algorithm, which incorporates detailed threshold calculation processes to enhance clustering accuracy. The algorithm operates in two key stages: (1) constructing a sliding window tailored to the characteristics of streaming data to perform intra-window clustering, and (2) merging clusters within the landmark window to achieve global clustering. Extensive experiments are conducted on diverse datasets to validate the algorithm’s effectiveness. Results on static datasets reveal that while the algorithm struggles with precise clustering, it achieves low runtime and misclassification rates. In contrast, experiments on concept-drifting datasets demonstrate that the algorithm, when combined with appropriate weight parameters, achieves accurate clustering with minimal misclassification rates. These findings highlight the algorithm’s adaptability to dynamic data environments and its potential for real-world applications in streaming data analysis. |
| format | Article |
| id | doaj-art-23696f12d4f24a4982b100ff67c8a79d |
| institution | Kabale University |
| issn | 2045-2322 |
| language | English |
| publishDate | 2025-07-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | Scientific Reports |
| spelling | doaj-art-23696f12d4f24a4982b100ff67c8a79d2025-08-20T04:01:24ZengNature PortfolioScientific Reports2045-23222025-07-0115111310.1038/s41598-025-96696-yA weight clustering algorithm based on sliding window model for stream dataJiashun Chen0Jianjing Chen1Zhaoman Zhong2School of Computer Engineer, Jiangsu Ocean UniversitySchool of Continuing Education, Qingdao University of TechnologySchool of Computer Engineer, Jiangsu Ocean UniversityAbstract Streaming data, characterized by its temporal variations and large volumes, presents unique challenges for clustering tasks. To address these challenges, this paper proposes a novel weighted clustering approach specifically designed for streaming data. The proposed method begins with an in-depth analysis of concept drift features in streaming data, followed by the development of a weight parameter calculation technique. Building on this, we introduce a sliding window model clustering algorithm, which incorporates detailed threshold calculation processes to enhance clustering accuracy. The algorithm operates in two key stages: (1) constructing a sliding window tailored to the characteristics of streaming data to perform intra-window clustering, and (2) merging clusters within the landmark window to achieve global clustering. Extensive experiments are conducted on diverse datasets to validate the algorithm’s effectiveness. Results on static datasets reveal that while the algorithm struggles with precise clustering, it achieves low runtime and misclassification rates. In contrast, experiments on concept-drifting datasets demonstrate that the algorithm, when combined with appropriate weight parameters, achieves accurate clustering with minimal misclassification rates. These findings highlight the algorithm’s adaptability to dynamic data environments and its potential for real-world applications in streaming data analysis.https://doi.org/10.1038/s41598-025-96696-ySliding window modelConcept driftStream dataData clusterWeight value |
| spellingShingle | Jiashun Chen Jianjing Chen Zhaoman Zhong A weight clustering algorithm based on sliding window model for stream data Scientific Reports Sliding window model Concept drift Stream data Data cluster Weight value |
| title | A weight clustering algorithm based on sliding window model for stream data |
| title_full | A weight clustering algorithm based on sliding window model for stream data |
| title_fullStr | A weight clustering algorithm based on sliding window model for stream data |
| title_full_unstemmed | A weight clustering algorithm based on sliding window model for stream data |
| title_short | A weight clustering algorithm based on sliding window model for stream data |
| title_sort | weight clustering algorithm based on sliding window model for stream data |
| topic | Sliding window model Concept drift Stream data Data cluster Weight value |
| url | https://doi.org/10.1038/s41598-025-96696-y |
| work_keys_str_mv | AT jiashunchen aweightclusteringalgorithmbasedonslidingwindowmodelforstreamdata AT jianjingchen aweightclusteringalgorithmbasedonslidingwindowmodelforstreamdata AT zhaomanzhong aweightclusteringalgorithmbasedonslidingwindowmodelforstreamdata AT jiashunchen weightclusteringalgorithmbasedonslidingwindowmodelforstreamdata AT jianjingchen weightclusteringalgorithmbasedonslidingwindowmodelforstreamdata AT zhaomanzhong weightclusteringalgorithmbasedonslidingwindowmodelforstreamdata |