Kelin Dang

Mr. Kelin Dang


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
19 May 2024 in Electronics
Verified
Journal Article
Open access
PDF file
YWYing Wang
Ying Wang
KDKelin Dang
Kelin Dang
RYRennong Yang
Rennong Yang
LLLeyan Li
Leyan Li
Hao LiHao Li
Hao Li
Maoguo GongMaoguo Gong
Maoguo Gong
Data mining technology is the process of extracting hidden knowledge and potentially useful information from a large number of incomplete, noisy, and random practical application data. The clustering algorithm based on multi-objective evolution has obvious advantages compared with the traditional single-objective method. In order to further improve the performance of evolutionary multi-objective clustering algorithms, this paper proposes a multi-objective automatic clustering model based on evolutionary multi-task optimization. Based on the multi-objective clustering algorithm that automatically determines the value of k, evolutionary multi-task optimization is introduced to deal with multiple clustering tasks simultaneously. A set of non-dominated solutions for clustering results is obtained by concurrently optimizing the overall deviation and connectivity index. Multi-task adjacency coding based on a locus adjacency graph was designed to encode the clustered data. Additionally, an evolutionary operator based on relevance learning was designed to facilitate the evolution of individuals within the population. It also facilitates information transfer between individuals with different tasks, effectively avoiding negative transfer. Finally, the proposed algorithm was applied to both artificial datasets and UCI datasets for testing. It was then compared with traditional clustering algorithms and other multi-objective clustering algorithms. The results verify the advantages of the proposed algorithm in clustering accuracy and algorithm convergence.

29 May 2024 in Remote Sensing
Verified
Journal Article
Open access
PDF file
YWYing Wang
Ying Wang
KDKelin Dang
Kelin Dang
RYRennong Yang
Rennong Yang
祺S祺 Qi Song
祺 Qi Song
Hao LiHao Li
Hao Li
Maoguo GongMaoguo Gong
Maoguo Gong
Heterogeneous image change detection is a very practical and challenging task because the data in the original image have a large distribution difference and the labeled samples of the remote sensing image are usually very few. In this study, we focus on solving the issue of comparing heterogeneous images without supervision. This paper first designs a self-paced multi-scale joint feature mapper (SMJFM) for the mapping of heterogeneous data to similar feature spaces for comparison and incorporates a self-paced learning strategy to weaken the mapper’s capture of non-consistent information. Then, the difference information in the output of the mapper is evaluated from two perspectives, namely noise robustness and detail preservation effectiveness; then, the change detection problem is modeled as a multi-objective optimization problem. We decompose this multi-objective optimization problem into several scalar optimization subproblems with different weights, and use particle swarm optimization to optimize these subproblems. Finally, the robust evaluation strategy is used to fuse the multi-scale change information to obtain a high-precision binary change map. Compared with previous methods, the proposed SMJFM framework has the following three main advantages: First, the unsupervised design alleviates the dilemma of few labels in remote sensing images. Secondly, the introduction of self-paced learning enhances SMJFM’s capture of the unchanged region mapping relationship between heterogeneous images. Finally, the multi-scale change information fusion strategy enhances the robustness of the framework to outliers in the original data.