Clustering Method for Financial Time Series with Co-Movement Relationship

Jungyu Ahn, Ju-hong Lee
{"title":"Clustering Method for Financial Time Series with Co-Movement Relationship","authors":"Jungyu Ahn, Ju-hong Lee","doi":"10.1109/ICCIA.2018.00057","DOIUrl":null,"url":null,"abstract":"Due to the random walk property of the financial time series, it is very difficult to develop a system that solves real financial application problems. However, if we obtain a time series cluster with a high degree of co-movement, it will be very useful for developing financial application systems. This paper proposes a clustering method that finds time series clusters with higher degrees of co-movement than the existing time series clustering algorithms. There is a problem in that clusters generated by the existing time series clustering algorithms contain too much noise with a low degree of co-movement. We propose a clustering method that solves the problem. This method is performed in the following steps. In the Data Preprocessing step, it performs Average Scaling, Weighted Time Series Transformation, Dimension Reduction, and Cluster Diameter Estimation. In the Clustering Step, it performs Preclustering and Refinement. Experiments show that our clustering method has higher performance than the existing time series clustering algorithms in finding clusters with high degree of co-movement.","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIA.2018.00057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Due to the random walk property of the financial time series, it is very difficult to develop a system that solves real financial application problems. However, if we obtain a time series cluster with a high degree of co-movement, it will be very useful for developing financial application systems. This paper proposes a clustering method that finds time series clusters with higher degrees of co-movement than the existing time series clustering algorithms. There is a problem in that clusters generated by the existing time series clustering algorithms contain too much noise with a low degree of co-movement. We propose a clustering method that solves the problem. This method is performed in the following steps. In the Data Preprocessing step, it performs Average Scaling, Weighted Time Series Transformation, Dimension Reduction, and Cluster Diameter Estimation. In the Clustering Step, it performs Preclustering and Refinement. Experiments show that our clustering method has higher performance than the existing time series clustering algorithms in finding clusters with high degree of co-movement.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有共动关系的金融时间序列的聚类方法
由于金融时间序列的随机游走特性,开发一个能够解决实际金融应用问题的系统是非常困难的。然而,如果我们得到一个具有高度协同运动的时间序列簇,它将对开发金融应用系统非常有用。本文提出了一种寻找比现有时间序列聚类算法具有更高共动度的时间序列聚类的聚类方法。现有的时间序列聚类算法产生的聚类存在噪声过多、共运动程度低的问题。我们提出了一种聚类方法来解决这个问题。该方法通过以下步骤执行。在数据预处理步骤中,它执行平均缩放、加权时间序列变换、降维和聚类直径估计。在聚类步骤中,它执行预聚类和细化。实验表明,我们的聚类方法在寻找高度共同运动的聚类方面比现有的时间序列聚类算法具有更高的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Text Extraction and Categorization from Watermark Scientific Document in Bulk Locating Heartbeats from Electrocardiograms and Other Correlated Signals Combining Deep Learning and JSEG Cuda Segmentation Algorithm for Electrical Components Recognition An Oppositional Learning Prediction Operator for Simulated Kalman Filter Clustering Method for Financial Time Series with Co-Movement Relationship
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1