arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.00729stat.ME
收藏

简约时间序列聚类

Parsimonious Time Series Clustering

Carmela Iorio, Gianluca Frasso, Antonio D'Ambrosio, Roberta Siciliano

摘要:

我们引入了一个简约的基于模型的框架聚类时间过程数据。在这些应用中,由于可用观测的数量,计算负担往往成为一个问题。测量的时间序列也可能是非常嘈杂和稀疏的,并且描述它们的合适模型可能难以定义。我们建议通过使用P-样条平滑器对观察到的测量进行建模,并通过最佳样条系数对功能对象进行聚类。原则上,这个想法可以在所有最常见的集群框架中采用。在这项工作中,我们将讨论基于k-means算法的应用。我们通过模拟和处理果蝇基因表达数据来评估我们的建议的准确性和效率。

英文摘要:

We introduce a parsimonious model-based framework for clustering time course data. In these applications the computational burden becomes often an issue due to the number of available observations. The measured time series can also be very noisy and sparse and a suitable model describing them can be hard to define. We propose to model the observed measurements by using P-spline smoothers and to cluster the functional objects as summarized by the optimal spline coefficients. In principle, this idea can be adopted within all the most common clustering frameworks. In this work we discuss applications based on a k-means algorithm. We evaluate the accuracy and the efficiency of our proposal by simulations and by dealing with drosophila melanogaster gene expression data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑