Evolutionary complex network for uncovering rich structure of series

IF 2.8 3区 物理与天体物理 Q2 PHYSICS, MULTIDISCIPLINARY
Bin Huang, Fang Wang, Hongyu Chen, Fan Liu
{"title":"Evolutionary complex network for uncovering rich structure of series","authors":"Bin Huang,&nbsp;Fang Wang,&nbsp;Hongyu Chen,&nbsp;Fan Liu","doi":"10.1140/epjp/s13360-024-05802-y","DOIUrl":null,"url":null,"abstract":"<div><p>Important structures hidden in series often reflect various real-world information. Analyzing and recognizing series is, therefore, of great practical significance. Complex networks have shown outstanding performance in mining the topological features of data, which provides rich information from high-dimensional perspective. In this work, we develop a new evolutionary complex network mapped method from series, termed weighted <i>k</i>-series maximum differential graph (<i>k</i>s-maxDG). This method facilitates the mapping of series into complex networks from multiple perspectives, providing a more comprehensive exploration of their topological properties. These dynamic network properties offer deeper insights into the evolving structure of the original series. We validate its accuracy in uncovering the topological features theoretically and empirically, showing excellent performance in chaos and noise identification as well as series classification.</p></div>","PeriodicalId":792,"journal":{"name":"The European Physical Journal Plus","volume":"139 12","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2024-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The European Physical Journal Plus","FirstCategoryId":"4","ListUrlMain":"https://link.springer.com/article/10.1140/epjp/s13360-024-05802-y","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Important structures hidden in series often reflect various real-world information. Analyzing and recognizing series is, therefore, of great practical significance. Complex networks have shown outstanding performance in mining the topological features of data, which provides rich information from high-dimensional perspective. In this work, we develop a new evolutionary complex network mapped method from series, termed weighted k-series maximum differential graph (ks-maxDG). This method facilitates the mapping of series into complex networks from multiple perspectives, providing a more comprehensive exploration of their topological properties. These dynamic network properties offer deeper insights into the evolving structure of the original series. We validate its accuracy in uncovering the topological features theoretically and empirically, showing excellent performance in chaos and noise identification as well as series classification.

求助全文
约1分钟内获得全文 求助全文
来源期刊
The European Physical Journal Plus
The European Physical Journal Plus PHYSICS, MULTIDISCIPLINARY-
CiteScore
5.40
自引率
8.80%
发文量
1150
审稿时长
4-8 weeks
期刊介绍: The aims of this peer-reviewed online journal are to distribute and archive all relevant material required to document, assess, validate and reconstruct in detail the body of knowledge in the physical and related sciences. The scope of EPJ Plus encompasses a broad landscape of fields and disciplines in the physical and related sciences - such as covered by the topical EPJ journals and with the explicit addition of geophysics, astrophysics, general relativity and cosmology, mathematical and quantum physics, classical and fluid mechanics, accelerator and medical physics, as well as physics techniques applied to any other topics, including energy, environment and cultural heritage.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信