CluWin algorithm can provide the clustering results in sliding windows ( window size = N) with relative error no more than e by maintaining O(k/ε log(εN/K) Time Clustering Feature synopses.
CluWin算法仪需要维护O(k/∈log(∈N/k))个时间聚类特征结构,就能够估算长度为N的滑动窗口中所有记录的聚类结果,且窗口最大相对差不超过∈。
参考来源 - 数据流聚类分析算法·2,447,543篇论文数据,部分数据来源于NoteExpress
应用推荐