arXiv subjects

Pengjian Shang

Publications and source records attributed to Pengjian Shang.

4 recordsLinked to original sources

arXiv2025

Differential Distance Correlation and Its Applications

In this paper, we propose a novel Euclidean-distance-based coefficient, named differential distance correlation, to measure the strength of dependence between a random variable $ Y \in \mathbb{R} $ and a random vector $ \boldsymbol{X} \in \mathbb{R}^p $. The coefficient has a concise expression and is invariant to arbitrary orthogonal transformations of the random vector. Moreover, the coefficient is a strongly consistent estimator of a simple and interpretable dependent measure, which is 0 if and only if $ \boldsymbol{X} $ and $ Y $ are independent and equal to 1 if and only if $ Y $ determines $ \boldsymbol{X} $ almost surely. An alternative approach is also proposed to address the limitation that the coefficient is non-robust to outliers. Furthermore, the coefficient exhibits asymptotic normality with a simple variance under the independent hypothesis, facilitating fast and accurate estimation of $ p $-value for testing independence. Three simulation experiments show that the proposed coefficient is more computationally efficient for independence testing and more effective in detecting oscillatory relationships than several competing methods. We also apply our method to analyze a real data example.

stat.ME↗

arXiv2025

Measuring Feature-Label Dependence Using Projection Correlation Statistic

Detecting dependence between variables is a crucial issue in statistical science. In this paper, we propose a novel metric, named label projection correlation, to measure the dependence between numerical and categorical variables. The proposed correlation does not require any conditions on the numerical variable, and is equal to zero if and only if the two variables are independent. Moreover, when the numerical variable is one-dimensional, we demonstrate that the computational cost of the correlation estimation can be reduced from $\mathrm{O}(n^3)$ to $\mathrm{O}(n \log n)$, where $ n $ is the sample size. Furthermore, if the one-dimensional variable is continuous, the metric can be simplified to a concise rank-based expression. The asymptotic theorem of the estimation is also established. Two simulated experiments are presented to demonstrate the effectiveness of our proposed correlation in feature selection. Furthermore, our approach is applied to feature selection in drivers' facial images and cancer mass-spectrometric data.

stat.ME↗

arXiv2025

Gradient entropy (GradEn): The two dimensional version of slope entropy for image analysis

Information theory and Shannon entropy are essential for quantifying irregularity in complex systems or signals. Recently, two-dimensional entropy methods, such as two-dimensional sample entropy, distribution entropy, and permutation entropy, have been proposed for analyzing 2D texture or image data. This paper introduces Gradient entropy (GradEn), an extension of slope entropy to 2D, which considers both symbolic patterns and amplitude information, enabling better feature extraction from image data. We evaluate GradEn with simulated data, including 2D colored noise, 2D mixed processes, and the logistic map. Results show the ability of GradEn to distinguish images with various characteristics while maintaining low computational cost. Real-world datasets, consist of texture, fault gear, and railway corrugation signals, demonstrate the superior performance of GradEn in classification tasks compared to other 2D entropy methods. In conclusion, GradEn is an effective tool for image characterization, offering a novel approach for image processing and recognition.

eess.IV↗

arXiv2024

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

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.

physics.data-an↗