PSPengjian Shang

Pengjian Shang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Pengjian Shang has a total of 74 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Time–Frequency Dispersion Entropy Plane and its Application in Mechanical Fault Diagnosis

    by Fan Zhang, Pengjian Shang, Yi Yin

    Fourier transform and entropy are two essential mathematical tools, and they have a fruitful role in system dynamics and machine learning research. In this paper, we propose a generalized composite multiscale amplitude dispersion entropy (GCMADE) and time–frequency dispersion entropy plane. GCMADE measures the complexity of the frequency domain of a time series and can approach the zero complexity of periodic sequences, unlike most other entropy methods. The time–frequency dispersion entropy plane further extracts time domain and frequency domain features of complex signals simultaneously through entropy. Its ability to measure the uncertainty of complex systems is analyzed by simulated data, and the results show that it can effectively distinguish between periodic sequences, chaotic sequences and stochastic processes. Finally, we introduce support vector machine (SVM) to perform mechanical fault diagnosis on five datasets. Compared with the other six algorithms, our method has significantly higher accuracy.


  • Open Access

    Hierarchical Bidirectional Transition Dispersion Entropy-based Lempel-Ziv Complexity and Its Application in Fault-Bearing Diagnosis

    by Runze Jiang, Pengjian Shang

    Lempel-Ziv complexity (LZC) is a key measure for detecting the irregularity and complexity of nonlinear time series and has seen various improvements in recent decades. However, existing LZC-based metrics, such as Permutation Lempel-Ziv complexity (PLZC) and Dispersion-Entropy based Lempel-Ziv complexity (DELZC), focus mainly on patterns of independent embedding vectors, often overlooking the transition patterns within the time series. To address this gap, this paper introduces a novel LZC-based method called Bidirectional Transition Dispersion Entropy-based Lempel-Ziv complexity (BT-DELZC). Leveraging Markov chain theory, this method integrates a bidirectional transition network framework with DELZC to better capture dynamic signal information. Additionally, an improved hierarchical decomposition algorithm is used to extract features from various frequency components of the time series. The proposed BT-DELZC method is first evaluated through four simulated experiments, demonstrating its robustness and effectiveness in characterizing nonlinear time series. Additionally, two fault-bearing diagnosis experiments are conducted by combining the hierarchical BT-DELZC method with various classifiers from the machine learning domain. The results indicate that BT-DELZC achieves the highest accuracy across both datasets, significantly outperforming existing methods such as LZC, PLZC, and DELZC in extracting features related to fault bearings.

  • Time Irreversibility of Complex Time Series with Detrended Cross-Correlation Analysis Based on Visibility Graph

    by Yi Yin, Xi Wang, Wenjing Wang, Qiang Li, Pengjian Shang

    In this paper, we introduce detrended cross-correlation analysis (DCCA) method into visibility graph (VG) algorithm and propose VGDCCA method to reflect the time series irreversibility from a new perspective. The validity and reliability of the proposed VGDCCA method is supported by numerical simulations on synthesized short-term correlated chaotic systems and long-term correlated fractal processes, and by the empirical analysis on stock indices and traffic parameter. The VGDCCA planes suggest that autoregressive fractionally integrated moving average (ARFIMA) and fractional Gaussian noise (FGN) series show time reversible behavior, whatever the long-term correlation of the series is or however strong the persistence or anti-persistence of the series is. Meanwhile, Logistic map with [ ] and Hénon map show more time irreversible behaviors than those of ARFIMA, FGN series and other Logistic maps. It can be found that the relationship between cross-correlation of ingoing degree sequence and outgoing degree sequence for the simulated series with different parameters is consistent with the complexity and autocorrelation behavior in the corresponding definition of the time series. For the empirical analysis, VGDCCA method declares the similarity and dissimilarity between stock indices on time series irreversibility and captures the time irreversibility of traffic time series recorded by the detectors in different locations.


  • A novel and effective method for characterizing time series correlations based on martingale difference correlation

    by Ang Li, Du Shang, Pengjian Shang

    Analysis of correlation between time series is an essential step for complex system studies and dynamical characteristics extractions. Martingale difference correlation (MDC) theory is mainly concerned with the correlation of conditional mean values between response variables and predictor variables. It is the generalization and deepening of the Pearson correlation coefficient, Spearman correlation coefficient, Kendall correlation coefficient, and other statistics. In this paper, on the basis of phase space reconstruction, the generalized dependence index (GDI) is proposed by using MDC and martingale difference divergence matrix theories, which can measure the degree of dependence between time series more effectively. Moreover, motivated by the theoretical framework of the refined distance correlation method, the corresponding dependence measure (DE) is employed in this paper to construct the DE-GDI plane, so as to comprehensively and intuitively distinguish different types of data and deeply explore the operating mechanism behind the relevant time series and complex systems. According to the performances tested by the different simulated and real-world data, our proposed method performs relatively reasonably and reliably in dependence measuring and data distinguishing. The proposal of this complex data clustering method can not only recognize the features of complex systems but also distinguish them effectively so as to acquire more relevant detailed information.


  • A Novel and Effective Method for Quantifying the Performance of Time Series Volatility

    by Binbin Shang, Pengjian Shang

    This article presents a volatility quantification method based on the Wasserstein–Fourier (WF) distance to detect dynamic changes and identify abnormal behaviors of time series. Specifically, if one of the time series in WF distance is determined as having known statistical properties, then the focus of the research is naturally shifted to explore the properties of the other time series it contains. Theoretically, the proposed method named constrained WF (CWF) combines the natures of WF distance with the statistical characteristics of the fixed time series in a good way, and obtains some unique properties. In terms of application, experiments conducted on both simulated and real-world datasets demonstrate the effectiveness of this new proposed volatility quantification method. Furthermore, the comparison with other methods of the same type gives promising results, highlighting its advantages in applicability and recognition accuracy. Based on theoretical analysis, simulated research and experimental verifications, this work establishes CWF as a meaningful and practical model for quantifying the volatility of time series.


  • Open Access

    Dispersion complexity–entropy curves: An effective method to characterize the structures of nonlinear time series

    by Runze Jiang, Pengjian Shang

    The complexity–entropy curve (CEC) is a valuable tool for characterizing the structure of time series and finds broad application across various research fields. Despite its widespread usage, the original permutation complexity–entropy curve (PCEC), which is founded on permutation entropy (PE), exhibits a notable limitation: its inability to take the means and amplitudes of time series into considerations. This oversight can lead to inaccuracies in differentiating time series. In this paper, drawing inspiration from dispersion entropy (DE), we propose the dispersion complexity–entropy curve (DCEC) to enhance the capability of CEC in uncovering the concealed structures within nonlinear time series. Our approach initiates with simulated data including the logistic map, color noises, and various chaotic systems. The outcomes of our simulated experiments consistently showcase the effectiveness of DCEC in distinguishing nonlinear time series with diverse characteristics. Furthermore, we extend the application of DCEC to real-world data, thereby asserting its practical utility. A novel approach is proposed, wherein DCEC-based feature extraction is combined with multivariate support vector machine for the diagnosis of various types of bearing faults. This combination achieved a high accuracy rate in our experiments. Additionally, we employ DCEC to assess stock indices from different countries and periods, thereby facilitating an analysis of the complexity inherent in financial markets. Our findings reveal significant insights into the dynamic regularities and distinct structures of these indices, offering a novel perspective for analyzing financial time series. Collectively, these applications underscore the potential of DCEC as an effective tool for the nonlinear time series analysis.


  • A New and Effective Classification Method for Complex Time Series Based on Information Measure

    by Ang Li, Pengjian Shang

    The growing importance of time series information measure raises questions about how to effectively cluster a large number of nonlinear complex time series data and accurately extract more hidden information from them. In this paper, a clustering measurement and classification method for complex time series, the symmetrical exponential Tsallis relative information (SETRI) measure, is proposed, which aims to address these problems. The intrinsic characteristics of different types of time series information could be validly identified by this method. The modified multidimensional scaling (MDS) method, based on the SETRI measure, has the ability to display the data in the form of graphs for intuitive exhibition and accomplish the process of dimension reduction. The introduction of weighted permutation patterns allows a higher-accuracy classification not only for the time series dissimilarity quantification, but also for avoiding dispensable errors. Besides, the feasibility of the modified MDS classification method is visually and quantitatively verified by the simulated and real-world data. Compared with other MDS methods, the proposed method has better performance, which is reflected in the validity and rationality of the clustering results, thus further verifying the feasibility of the proposed method. Therefore, the new results will be helpful to develop complex data clustering and dimensionality reduction methods.