ArticleScientific reports2025
A weight clustering algorithm based on sliding window model for stream data.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
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.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.