Xiaopeng Chen
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
Research Subjects
Xiaopeng Chen has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Chanseok Park
Pusan National University
3 shared publications - Xuehong Gao
Research Institute of Macro-Safety Science, University of Science and Technology Beijing, Beijing 100083, China
3 shared publications - Bosung Kim
School of Management, Kyung Hee University, Seoul 02447, Republic of Korea
1 shared publication - Chengrong Li
Institute of Automation, Chinese Academy of Sciences, Beijing, China
1 shared publication - Chong Li
Xi’an Jiaotong-Liverpool University, Suzhou, China
1 shared publication Deshun Yang
Guangzhou Paike Pushi Information Technology Co., Ltd.,Guangzhou,China
1 shared publication
Latest Publications
- 6 January 2026
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (10) , 2958-2972
Two hybrid genetic algorithms for the continuous p -centre problem
- 6 January 2026
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (10) , 2958-2972
Two hybrid genetic algorithms for the continuous p -centre problem
- 6 October 2025
- Published by Springer Nature in Operational Research
- Vol. 25 (4) , 1-28
Optimizing pricing strategies in cross-border green supply chains with revenue sharing and flexible exchange rate mechanisms
- 6 October 2025
- Published by Springer Nature in Operational Research
- Vol. 25 (4) , 1-28
Optimizing pricing strategies in cross-border green supply chains with revenue sharing and flexible exchange rate mechanisms
- 3 July 2024
- Published by Taylor & Francis in Engineering Optimization
- Vol. 57 (7) , 1764-1777
A new heuristic for the continuous fixed-radius disc cover problem
- 3 July 2024
- Published by Taylor & Francis in Engineering Optimization
- Vol. 57 (7) , 1764-1777
A new heuristic for the continuous fixed-radius disc cover problem
- Open Access
- 17 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 88135-88151
Robust Model Design by Comparative Evaluation of Clustering Algorithms
The K-means algorithm, widely used in cluster analysis, is a centroid-based clustering method known for its high efficiency and scalability. However, in realistic situations, the operating environment is susceptible to contamination issues caused by outliers and distribution departures, which may lead to clustering results from K-means that are distorted or rendered invalid. In this paper, we introduce three other alternative algorithms, including K-weighted-medians, K-weighted-L 2 -medians, and K-weighted-HLs, to address these issues under the consideration of data with weights. The impact of contamination is investigated by examining the estimation effects on optimal cluster centroids. We explore the robustness of the clustering algorithms from the perspective of the breakdown point, and then conduct experiments on simulated and real datasets to evaluate their performance using new numerical metrics. The results demonstrate the effectiveness of the proposed K-weighted-HLs algorithm, surpassing other algorithms in scenarios involving both contamination issues.
- 17 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 88135-88151
Open AccessRobust Model Design by Comparative Evaluation of Clustering Algorithms
The K-means algorithm, widely used in cluster analysis, is a centroid-based clustering method known for its high efficiency and scalability. However, in realistic situations, the operating environment is susceptible to contamination issues caused by outliers and distribution departures, which may lead to clustering results from K-means that are distorted or rendered invalid. In this paper, we introduce three other alternative algorithms, including K-weighted-medians, K-weighted-L 2 -medians, and K-weighted-HLs, to address these issues under the consideration of data with weights. The impact of contamination is investigated by examining the estimation effects on optimal cluster centroids. We explore the robustness of the clustering algorithms from the perspective of the breakdown point, and then conduct experiments on simulated and real datasets to evaluate their performance using new numerical metrics. The results demonstrate the effectiveness of the proposed K-weighted-HLs algorithm, surpassing other algorithms in scenarios involving both contamination issues.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 25, 1-6
Class Size Variance Minimization to Metric Learning for Dish Identification
The objective of metric learning is to search a suitable metric for measuring distance or similarity between samples. Usually, it aims to minimize the distance between samples of same class and maximizes the distance between samples of different classes. However, most metric learning methods do not consider the sizes of classes, which may cause negative impact on the performance in classification since the size of a cluster is usually ignored in the distance comparison. In this work, we propose a triplet loss with variance constraint. Our method focuses not only on the distances between samples but also on the sizes of classes. The size difference between classes is also minimized in our objective function. The experimental results confirm that our method outperforms the one without the class size variance.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 25, 1-6
Class Size Variance Minimization to Metric Learning for Dish Identification
The objective of metric learning is to search a suitable metric for measuring distance or similarity between samples. Usually, it aims to minimize the distance between samples of same class and maximizes the distance between samples of different classes. However, most metric learning methods do not consider the sizes of classes, which may cause negative impact on the performance in classification since the size of a cluster is usually ignored in the distance comparison. In this work, we propose a triplet loss with variance constraint. Our method focuses not only on the distances between samples but also on the sizes of classes. The size difference between classes is also minimized in our objective function. The experimental results confirm that our method outperforms the one without the class size variance.
- 1 September 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21582181,p. 210-215
Adaptive Bandwidth Mean Shift Object Detection
In this paper, a novel adaptive bandwidth mean shift algorithm toward 2D object detection (ABMSOD) is proposed. It can not only identify whether an object of certain classes exists or not, but also get the scale and orientation besides position very fast. The feature histogram weighted by a kernel with adaptive bandwidth is used for representing the target object model and the candidate object model. Features such as color, texture, gradient and so on can be used. A single piece of image is enough to build a model by calculating the weighted feature histogram of the object in the image. There is no exhaustive training. The similarity of the target model and the candidate model is measured by the Bhattacharyya coefficient. After gathering the models of targets, the algorithm can be used for object detection. In the first step, the algorithm searches the whole image to find the rough positions of possible candidate objects. If the similarities are all below a certain threshold, it reports no object existence. If the similarities are above the threshold, the second step or the adaptive bandwidth mean shift search step is executed to find the best position, orientation and scale of these objects. Experiments show that it successfully detects the position, scale and orientation of objects.
- 1 September 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21582181,p. 210-215
Adaptive Bandwidth Mean Shift Object Detection
In this paper, a novel adaptive bandwidth mean shift algorithm toward 2D object detection (ABMSOD) is proposed. It can not only identify whether an object of certain classes exists or not, but also get the scale and orientation besides position very fast. The feature histogram weighted by a kernel with adaptive bandwidth is used for representing the target object model and the candidate object model. Features such as color, texture, gradient and so on can be used. A single piece of image is enough to build a model by calculating the weighted feature histogram of the object in the image. There is no exhaustive training. The similarity of the target model and the candidate model is measured by the Bhattacharyya coefficient. After gathering the models of targets, the algorithm can be used for object detection. In the first step, the algorithm searches the whole image to find the rough positions of possible candidate objects. If the similarities are all below a certain threshold, it reports no object existence. If the similarities are above the threshold, the second step or the adaptive bandwidth mean shift search step is executed to find the best position, orientation and scale of these objects. Experiments show that it successfully detects the position, scale and orientation of objects.