Yuhao Zhou, Faming Gong, Yanwei Wang, Ruijie Wang, An Zeng
{"title":"融合引文网络中的结构和时间信息以识别里程碑作品","authors":"Yuhao Zhou, Faming Gong, Yanwei Wang, Ruijie Wang, An Zeng","doi":"10.1016/j.chaos.2025.116004","DOIUrl":null,"url":null,"abstract":"The rapid proliferation of scientific and technological works has highlighted the necessity to effectively identify the significant achievements in more and more complex citation networks. Mainstream algorithms fall into two categories: structural information based algorithms with Citation and PageRank as the core; Temporal information based algorithms represented by the citation dynamic model and Relevance. This article conducts a detailed study of the relationship between these two categories to fill the gap in this area. We use the American Physical Society (APS) dataset, which includes 469,452 papers and 5,016,382 citations from 1893 to 2010. Our findings indicate that PageRank and Citation are statistically similar, both favoring older articles. However, Relevance excels in early forecasting, hence showing a weaker correlation with PageRank. Inspired by this, we introduce a new method called Structural-Temporal Rank (STRank). Validation experiments demonstrate that STRank excels in identifying milestone letters and predicting future impact, outperforming other methods in these tasks. This study introduces the idea of fusing structural and temporal information in designing ranking methods that could guide the future development of more efficient node identification algorithms in networks.","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"33 1","pages":""},"PeriodicalIF":5.3000,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fusing structural and temporal information in citation networks for identifying milestone works\",\"authors\":\"Yuhao Zhou, Faming Gong, Yanwei Wang, Ruijie Wang, An Zeng\",\"doi\":\"10.1016/j.chaos.2025.116004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid proliferation of scientific and technological works has highlighted the necessity to effectively identify the significant achievements in more and more complex citation networks. Mainstream algorithms fall into two categories: structural information based algorithms with Citation and PageRank as the core; Temporal information based algorithms represented by the citation dynamic model and Relevance. This article conducts a detailed study of the relationship between these two categories to fill the gap in this area. We use the American Physical Society (APS) dataset, which includes 469,452 papers and 5,016,382 citations from 1893 to 2010. Our findings indicate that PageRank and Citation are statistically similar, both favoring older articles. However, Relevance excels in early forecasting, hence showing a weaker correlation with PageRank. Inspired by this, we introduce a new method called Structural-Temporal Rank (STRank). Validation experiments demonstrate that STRank excels in identifying milestone letters and predicting future impact, outperforming other methods in these tasks. This study introduces the idea of fusing structural and temporal information in designing ranking methods that could guide the future development of more efficient node identification algorithms in networks.\",\"PeriodicalId\":9764,\"journal\":{\"name\":\"Chaos Solitons & Fractals\",\"volume\":\"33 1\",\"pages\":\"\"},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2025-01-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chaos Solitons & Fractals\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1016/j.chaos.2025.116004\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos Solitons & Fractals","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1016/j.chaos.2025.116004","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Fusing structural and temporal information in citation networks for identifying milestone works
The rapid proliferation of scientific and technological works has highlighted the necessity to effectively identify the significant achievements in more and more complex citation networks. Mainstream algorithms fall into two categories: structural information based algorithms with Citation and PageRank as the core; Temporal information based algorithms represented by the citation dynamic model and Relevance. This article conducts a detailed study of the relationship between these two categories to fill the gap in this area. We use the American Physical Society (APS) dataset, which includes 469,452 papers and 5,016,382 citations from 1893 to 2010. Our findings indicate that PageRank and Citation are statistically similar, both favoring older articles. However, Relevance excels in early forecasting, hence showing a weaker correlation with PageRank. Inspired by this, we introduce a new method called Structural-Temporal Rank (STRank). Validation experiments demonstrate that STRank excels in identifying milestone letters and predicting future impact, outperforming other methods in these tasks. This study introduces the idea of fusing structural and temporal information in designing ranking methods that could guide the future development of more efficient node identification algorithms in networks.
期刊介绍:
Chaos, Solitons & Fractals strives to establish itself as a premier journal in the interdisciplinary realm of Nonlinear Science, Non-equilibrium, and Complex Phenomena. It welcomes submissions covering a broad spectrum of topics within this field, including dynamics, non-equilibrium processes in physics, chemistry, and geophysics, complex matter and networks, mathematical models, computational biology, applications to quantum and mesoscopic phenomena, fluctuations and random processes, self-organization, and social phenomena.