Jun Yin
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
Jun Yin has a total of 69 co-authors. Here are the top co-authors by number of shared publications:
- Lai Wei
College of Information Engineering, Shanghai Maritime University, Shanghai, China
6 shared publications - Changming Zhu
College of Information Engineering, Shanghai Maritime University, Shanghai, China
4 shared publications - Shiliang Sun
School of Automation and Intelligent Sensing, Shanghai Jiao Tong University, Shanghai, China
4 shared publications Zhong Jin
4 shared publicationsLai Wei
Shanghai Maritime University
3 shared publications- Ri-Gui Zhou
Shanghai Maritime University
3 shared publications
Latest Publications
- 27 September 2026
- Published by Elsevier in Ocean Engineering
- Vol. 368
A ship trajectory clustering and typical trajectory extraction framework based on Grey Wolf Optimized DBSCAN
- 27 September 2026
- Published by Elsevier in Ocean Engineering
- Vol. 368
A ship trajectory clustering and typical trajectory extraction framework based on Grey Wolf Optimized DBSCAN
- 10 April 2026
- Published by Elsevier in Information Fusion
- Vol. 134
Clustering result re-guided incomplete multi-view spectral clustering
- 10 April 2026
- Published by Elsevier in Information Fusion
- Vol. 134
Clustering result re-guided incomplete multi-view spectral clustering
- 8 February 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 169
Reinforced semantic information acquiring for contrastive clustering
- 8 February 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 169
Reinforced semantic information acquiring for contrastive clustering
- 27 November 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 302
Neighborhood context-aware contrastive clustering
- 27 November 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 302
Neighborhood context-aware contrastive clustering
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1695-1703
Neighbor Contrastive Learning with Weakened Consensus Graph for Deep Multi-View Clustering
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1695-1703
Open AccessNeighbor Contrastive Learning with Weakened Consensus Graph for Deep Multi-View Clustering
- Open Access
- 24 October 2025
- Published by Springer Nature in Neural Processing Letters
- Vol. 57 (6) , 1-29
Multi-view Fusion and View-specific-labels Learning for Multi-label Classification
- 24 October 2025
- Published by Springer Nature in Neural Processing Letters
- Vol. 57 (6) , 1-29
Open AccessMulti-view Fusion and View-specific-labels Learning for Multi-label Classification
- Open Access
Clustering Result Re-guided Incomplete Multi-view Spectral Clustering
Incomplete multi-view spectral clustering generalizes spectral clustering to multi-view data and simultaneously realizes the partition of multi-view data with missing views. For this category of method, K-means algorithm needs to be performed to generate the clustering result after the procedure of feature extraction. More importantly, the connectivity of samples reflected by the clustering result is not utilized effectively. To overcome these defects, we propose Clustering Result re-Guided Incomplete Multi-view Spectral Clustering (CRG_IMSC). CRG_IMSC obtains the clustering result directly by imposing nonnegative constraint to the extracted feature. Furthermore, it constructs the connectivity matrix according to the result of spectral clustering, and minimizes the residual of self-representation based on the connectivity matrix. A novel iterative algorithm using multiplicative update is developed to solve the optimization problem of CRG_IMSC, and its convergence is proved rigorously. On benchmark datasets, for multi-view data, CRG_IMSC performs better than state-of-the-art clustering methods, and the experimental results also demonstrate the convergence of CRG_IMSC algorithm.
Open AccessClustering Result Re-guided Incomplete Multi-view Spectral Clustering
Incomplete multi-view spectral clustering generalizes spectral clustering to multi-view data and simultaneously realizes the partition of multi-view data with missing views. For this category of method, K-means algorithm needs to be performed to generate the clustering result after the procedure of feature extraction. More importantly, the connectivity of samples reflected by the clustering result is not utilized effectively. To overcome these defects, we propose Clustering Result re-Guided Incomplete Multi-view Spectral Clustering (CRG_IMSC). CRG_IMSC obtains the clustering result directly by imposing nonnegative constraint to the extracted feature. Furthermore, it constructs the connectivity matrix according to the result of spectral clustering, and minimizes the residual of self-representation based on the connectivity matrix. A novel iterative algorithm using multiplicative update is developed to solve the optimization problem of CRG_IMSC, and its convergence is proved rigorously. On benchmark datasets, for multi-view data, CRG_IMSC performs better than state-of-the-art clustering methods, and the experimental results also demonstrate the convergence of CRG_IMSC algorithm.
- 3 September 2025
- Published by Elsevier in Neural Networks
- Vol. 193, 108069
Dual aggregation based joint-modal similarity hashing for cross-modal retrieval
- 3 September 2025
- Published by Elsevier in Neural Networks
- Vol. 193, 108069
Dual aggregation based joint-modal similarity hashing for cross-modal retrieval
- Top Cited Papers
- 29 June 2025
- Published by Elsevier in Ocean Engineering
- Vol. 338
Ship trajectory prediction based on LSTM model with multi-scale convolution and attention mechanism
- 29 June 2025
- Published by Elsevier in Ocean Engineering
- Vol. 338
Top Cited PapersShip trajectory prediction based on LSTM model with multi-scale convolution and attention mechanism
- 15 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (8) , 4716-4727
Incomplete Multi-View Clustering via Multi-Level Contrastive Learning
Although significant progress has been made in multi-view learning over the past few decades, it remains challenging, especially in the context of incomplete multi-view clustering, where modeling complex correlations among different views and handling missing data are key difficulties. In this paper, we propose a novel incomplete multi-view clustering network to address the aforementioned issue, named Incomplete Multi-view Clustering via Multi-level Contrastive Learning (IMC-MCL). Specifically, the proposed model aims to minimize the conditional entropy between views to recover missing data by dual prediction strategy. Moreover, the approach learns multi-level features, including latent, high-level and semantic features, with the goal of satisfying both reconstruction and consistency objectives in distinct feature spaces. Specifically, latent features are utilized to accomplish the reconstruction objective, while high-level features and semantic labels are employed to achieve the two consistency goals through contrastive learning. This framework enables the exploration of shared semantics within high-level features and achieves clustering assignment using semantic features. Extensive experiments have shown that the proposed approach outperforms other state-of-the-art incomplete multi-view clustering methods on seven challenging datasets.
- 15 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (8) , 4716-4727
Incomplete Multi-View Clustering via Multi-Level Contrastive Learning
Although significant progress has been made in multi-view learning over the past few decades, it remains challenging, especially in the context of incomplete multi-view clustering, where modeling complex correlations among different views and handling missing data are key difficulties. In this paper, we propose a novel incomplete multi-view clustering network to address the aforementioned issue, named Incomplete Multi-view Clustering via Multi-level Contrastive Learning (IMC-MCL). Specifically, the proposed model aims to minimize the conditional entropy between views to recover missing data by dual prediction strategy. Moreover, the approach learns multi-level features, including latent, high-level and semantic features, with the goal of satisfying both reconstruction and consistency objectives in distinct feature spaces. Specifically, latent features are utilized to accomplish the reconstruction objective, while high-level features and semantic labels are employed to achieve the two consistency goals through contrastive learning. This framework enables the exploration of shared semantics within high-level features and achieves clustering assignment using semantic features. Extensive experiments have shown that the proposed approach outperforms other state-of-the-art incomplete multi-view clustering methods on seven challenging datasets.