Fast transformation from time series to visibility graphs.
The visibility graph method is used to transform time series into complex networks. In this letter, a fast transform algorithm is proposed for obtaining a visibility graph. Based on the strategy of "divide & conquer," the time complexity of the proposed algorithm is raised to O(n log n), which is more efficient than the previous basic algorithm whose time complexity is O(n(2)).
School of Computer and Information Science, Southwest University, Chongqing 400715, China.
Xin
X
Lan
School of Computer and Information Science, Southwest University, Chongqing 400715, China.
Hongming
H
Mo
School of Computer and Information Science, Southwest University, Chongqing 400715, China.
Shiyu
S
Chen
Department of Biomedical Informatics, Medical Center, Vanderbilt University, Nashiville, Tennessee 37232, USA.
Qi
Q
Liu
School of Computer and Information Science, Southwest University, Chongqing 400715, China.
Yong
Y
Deng
D000465:Algorithms; D009716:Numerical Analysis, Computer-Assisted; D013997:Time Factors