.png){kind=icon}
返回
Unsupervised clustering on dynamic databases
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2005.03.023.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Clustering algorithms typically assume that the available data constitute a random sample from a stationary distribution. As data accumulate over time the underlying process that generates them can change. Thus, the development of algorithms that can extract clustering rules in non-stationary environments is necessary. In this paper, we present an extension of the k-windows algorithm that can track the evolution of cluster models in dynamically changing databases, without a significant computational overhead. Experiments show that the k-windows algorithm can effectively and efficiently identify the changes on the pattern structure. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
clustering
pattern recognition
Bkd-tree structure
dynamic databases
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
Psychological characteristics and biofeedback mitigation in preadolescents with eating disorders
PREAI
分享收藏分享收藏
查看更多内容