Biclustering high‐frequency financial time series based on information theory

Haitao Liu, J. Zou, N. Ravishanker
{"title":"Biclustering high‐frequency financial time series based on information theory","authors":"Haitao Liu, J. Zou, N. Ravishanker","doi":"10.1002/sam.11581","DOIUrl":null,"url":null,"abstract":"Clustering a large number of time series into relatively homogeneous groups is a well‐studied unsupervised learning technique that has been widely used for grouping financial instruments (say, stocks) based on their stochastic properties across the entire time period under consideration. However, clustering algorithms ignore the notion of biclustering, that is, grouping of stocks only within a subset of times rather than over the entire time period. Biclustering algorithms enable grouping of stocks and times simultaneously, and thus facilitate improved pattern extraction for informed trading strategies. While biclustering methods may be employed for grouping low‐frequency (daily) financial data, their use with high‐frequency financial time series of intra‐day trading data is especially useful. This paper develops a biclustering algorithm based on pairwise or groupwise mutual information between one‐minute averaged stock returns within a trading day, using jackknife estimation of mutual information (JMI). We construct a multiple day time series biclustering (MI‐MDTSB) algorithm that can capture refined and local comovement patterns between groups of stocks over a subset of continuous time points. Extensive numerical studies based on high‐frequency returns data reveal interesting intra‐day patterns among different asset groups and sectors.","PeriodicalId":342679,"journal":{"name":"Statistical Analysis and Data Mining: The ASA Data Science Journal","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Statistical Analysis and Data Mining: The ASA Data Science Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/sam.11581","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Clustering a large number of time series into relatively homogeneous groups is a well‐studied unsupervised learning technique that has been widely used for grouping financial instruments (say, stocks) based on their stochastic properties across the entire time period under consideration. However, clustering algorithms ignore the notion of biclustering, that is, grouping of stocks only within a subset of times rather than over the entire time period. Biclustering algorithms enable grouping of stocks and times simultaneously, and thus facilitate improved pattern extraction for informed trading strategies. While biclustering methods may be employed for grouping low‐frequency (daily) financial data, their use with high‐frequency financial time series of intra‐day trading data is especially useful. This paper develops a biclustering algorithm based on pairwise or groupwise mutual information between one‐minute averaged stock returns within a trading day, using jackknife estimation of mutual information (JMI). We construct a multiple day time series biclustering (MI‐MDTSB) algorithm that can capture refined and local comovement patterns between groups of stocks over a subset of continuous time points. Extensive numerical studies based on high‐frequency returns data reveal interesting intra‐day patterns among different asset groups and sectors.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于信息论的高频金融时间序列双聚类
将大量时间序列聚类为相对同质的组是一种研究得很好的无监督学习技术,已广泛用于根据整个时间段内金融工具(如股票)的随机特性对其进行分组。然而,聚类算法忽略了双聚类的概念,即只在一段时间内对股票进行分组,而不是在整个时间段内对股票进行分组。双聚类算法可以同时对股票和时间进行分组,从而为知情的交易策略提供改进的模式提取。虽然双聚类方法可以用于分组低频(每日)金融数据,但它们与高频日内交易数据的金融时间序列的使用特别有用。本文利用互信息的刀切估计(JMI),开发了一种基于交易日内一分钟平均股票收益之间的成对或组互信息的双聚类算法。我们构建了一个多天时间序列双聚类(MI - MDTSB)算法,该算法可以捕获连续时间点子集上股票组之间的精炼和局部运动模式。基于高频回报数据的广泛数值研究揭示了不同资产组和行业之间有趣的日内模式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neural interval‐censored survival regression with feature selection Bayesian batch optimization for molybdenum versus tungsten inertial confinement fusion double shell target design Gaussian process selections in semiparametric multi‐kernel machine regression for multi‐pathway analysis An automated alignment algorithm for identification of the source of footwear impressions with common class characteristics Confidence bounds for threshold similarity graph in random variable network
×
引用
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