Zhongju Shang

Zhongju Shang

Auto-generated profile, based on publicly available information

Zhongju Shang

College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 January 2024 in Grey Systems: Theory and Application
Verified
Journal Article
Closed access
SLSifeng Liu
Sifeng Liu
NLNingning Lu
Ningning Lu
ZSZhongju Shang
Zhongju Shang
RRR.M. Kapila Tharanga Rathnayaka
R.M. Kapila Tharanga Rathnayaka
Purpose: The purpose of this paper is to explore a new approach to solve the problem of positive and negative offset in the calculation process of integral elements, then propose a series of new grey relational degree model for cross sequences.Design/methodology/approach: The definitions of cross sequences and area elements have been proposed at first. Then the concept of difference degree between sequences has been put forward. Based on the definition of difference degree between sequences, various modified grey relational degree models for cross sequences have been proposed to solve the measurement problem of cross sequence correlation relationships.Findings: (1) The new definition of cross sequences; (2) The area element; (3) Various modified grey relational degree models for cross sequences based on the definition of difference degree between sequences.Practical implications: The grey relational analysis model of cross sequences is a difficult problem in grey relational analysis. The new model proposed in this article can effectively avoid the calculation deviation of grey relational analysis model for cross sequences, and reasonably measure the correlation between cross sequences. The new model was used to analyse the food consumer price index in Shaanxi Province, clarifying the relationship between different types of food consumer price indices, some interesting results that are not completely consistent with general economic theory were obtained.Originality/value: The new definition of cross sequences, the area element and various modified grey relational degree models for cross sequences were proposed.

14 February 2025 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
ZSZhongju Shang
Zhongju Shang
YDYaoguo Dang
Yaoguo Dang
HWHaowei Wang
Haowei Wang
SLSifeng Liu
Sifeng Liu
Discovering clusters remains challenging when dealing with complex data structures, including those with varying densities, arbitrary shapes, weak separability, or the presence of noise. In this article, we propose a novel clustering algorithm called representative point-based clustering with neighborhood information (RPC-NI), which highlights the significance of neighborhood information often overlooked by existing clustering methods. The proposed algorithm first introduces a new local centrality metric that integrates both neighborhood density and topological convergence to identify core representative points, effectively capturing the structural characteristics of the data. Subsequently, a density-adaptive distance is defined to evaluate dissimilarities between these core representative points, and such distance is used to construct a minimum spanning tree (MST) over these points. Finally, an MST-based clustering algorithm is employed to yield the desired clusters. Incorporating neighborhood information enables RPC-NI to comprehensively determine representative points, and having multiple representative points per cluster allows RPC-NI to adapt to clusters of arbitrary shapes, varying densities, and different sizes. Extensive experiments on widely used datasets demonstrate that RPC-NI outperforms baseline algorithms in terms of clustering accuracy and robustness. These results provide further evidence for the importance of incorporating neighborhood information discovering clusters with complex structures.

20 January 2025 in Journal of the Operational Research Society
Verified
Journal Article
Closed access
LYLili Ye
Lili Ye
NXNaiming Xie
Naiming Xie
ZSZhongju Shang
Zhongju Shang
JBJohn E. Boylan
John E. Boylan

20 May 2024 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
ZSZhongju Shang
Zhongju Shang
YDYaoguo Dang
Yaoguo Dang
JZJun Zhu
Jun Zhu
HWHaowei Wang
Haowei Wang
JWJunjie Wang
Junjie Wang
Classical clustering methods such as k-means, spectral clustering, DBSCAN, and DPC often operate under specific assumptions about data characteristics. However, the increasing diversity and complex characteristic of data, coupled with limited prior knowledge, hinder the direct application of these clustering algorithms. Existing data processing approaches, such as ReScale and CDF-TS, are capable of homogenizing cluster density, but tailor to density-based algorithms that does not perform well on weakly separated or manifold clusters. To overcome these issues, we propose a novel data processing method (ReShape) facilitating the direct application of well-known clustering algorithms without modifications. The ReShape integrates three key components: a homogenization factor for uniforming varying cluster densities, a separation factor for enhancing cluster separations, and a joint distance considering both global and local consistency to measure distances in manifold datasets. The proposed method is universally applicable, and can match implicit assumptions of existing clustering algorithms. Extensive experiments and a case study for fault diagnosis involving k-means, spectral clustering, DBSCAN, and DPC demonstrates the efficacy of the ReShape approach.