Jiangyong Duan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jiangyong Duan has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Congmin Lv
The Key Laboratory of Space Utilization, Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences, Beijing, China
2 shared publications - Ke Zhang
The Key Laboratory of Space Utilization, Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences, Beijing, China
2 shared publications - Lili Guo
Key Laboratory of Space Utilization, Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences, Beijing 100094, China
2 shared publications - Tiantian Yang
The Key Laboratory of Space Utilization, Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences, Beijing, China
2 shared publications - Hongfei Wang
Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences, Beijing, China
1 shared publication
Latest Publications
- 5 July 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (12) , 1-22
Adaptive variable-length subsequence pattern extraction in time series
- 5 July 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (12) , 1-22
Adaptive variable-length subsequence pattern extraction in time series
- 20 June 2025
- Published by Springer Nature
- p. 407-419
Adaptive Extraction of Variable-Length Subsequence Patterns in Noisy Time Series
- 20 June 2025
- Published by Springer Nature
- p. 407-419
Adaptive Extraction of Variable-Length Subsequence Patterns in Noisy Time Series
- 13 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 34 (2) , 983-995
Variable-Length Subsequence Clustering in Time Series
Subsequence clustering is an important issue in time series data mining. Observing that most time series consist of various patterns with different unknown lengths, we propose an optimization framework to adaptively estimate the lengths and representations for different patterns. Our framework minimizes the inner subsequence cluster errors with respect to subsequence clusters and segmentation under time series cover constraint where the subsequence cluster lengths can be variable. To optimize our framework, we first generate abundant initial subsequence clusters with different lengths. Then, three cluster operations, i.e., cluster splitting, combination and removing, are used to iteratively refine the cluster lengths and representations by respectively splitting clusters consisting of different patterns, joining neighboring clusters belonging to the same pattern and removing clusters to the predefined cluster number. During each cluster refinement, we employ an efficient algorithm to alternatively optimize subsequence clusters and segmentation based on dynamic programming. Our method can automatically and efficiently extract the unknown variable-length subsequence clusters in the time series. Comparative results with the state-of-the-art are conducted on various synthetic and real time series, and quantitative and qualitative performances demonstrate the effectiveness of our method.
- 13 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 34 (2) , 983-995
Variable-Length Subsequence Clustering in Time Series
Subsequence clustering is an important issue in time series data mining. Observing that most time series consist of various patterns with different unknown lengths, we propose an optimization framework to adaptively estimate the lengths and representations for different patterns. Our framework minimizes the inner subsequence cluster errors with respect to subsequence clusters and segmentation under time series cover constraint where the subsequence cluster lengths can be variable. To optimize our framework, we first generate abundant initial subsequence clusters with different lengths. Then, three cluster operations, i.e., cluster splitting, combination and removing, are used to iteratively refine the cluster lengths and representations by respectively splitting clusters consisting of different patterns, joining neighboring clusters belonging to the same pattern and removing clusters to the predefined cluster number. During each cluster refinement, we employ an efficient algorithm to alternatively optimize subsequence clusters and segmentation based on dynamic programming. Our method can automatically and efficiently extract the unknown variable-length subsequence clusters in the time series. Comparative results with the state-of-the-art are conducted on various synthetic and real time series, and quantitative and qualitative performances demonstrate the effectiveness of our method.