Min Ren
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Min Ren has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Zhihao Wang
School of Management and Engineering, Shandong University of Finance and Economics, Jinan, Shandong Province, China
2 shared publications - Ding Ding
Intuit
1 shared publication - Gaoyong Li
School of Management Science and Engineering, Shandong University of Finance and Economics, Jinan 250014, China
1 shared publication Jing Yi
School of Information Science and Engineering
1 shared publication- Mauro Conti
University of Padova, Padova, Italy, and Örebro University, Örebro, Sweden
1 shared publication Peiying Zhao
School of Mathematics and Quantitative Economics, Shandong University of Finance and Economics, Jinan, Shandong Province, China
1 shared publication
Latest Publications
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (5) , 3581-3593
RACE: Risk-Aware Cloud-Edge Orchestration With Online Adaptive Calibration for Trustworthy LLM Services
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (5) , 3581-3593
RACE: Risk-Aware Cloud-Edge Orchestration With Online Adaptive Calibration for Trustworthy LLM Services
- 1 January 2022
- Published by Inderscience Publishers in International Journal of Information and Computer Security
- Vol. 18 (3/4) , 278-299
A feature selection method based on neighbourhood rough set and genetic algorithm for intrusion detection
In intrusion detection system, unsupervised clustering algorithm is often used to analyse the detected data without class labels, and judge them as the normal or abnormal behaviour. Optimal feature...
- 1 January 2022
- Published by Inderscience Publishers in International Journal of Information and Computer Security
- Vol. 18 (3/4) , 278-299
A feature selection method based on neighbourhood rough set and genetic algorithm for intrusion detection
In intrusion detection system, unsupervised clustering algorithm is often used to analyse the detected data without class labels, and judge them as the normal or abnormal behaviour. Optimal feature...
- Open Access
- 29 November 2016
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2016, 1-12
A Self-Adaptive Fuzzyc-Means Algorithm for Determining the Optimal Number of Clusters
For the shortcoming of fuzzyc-means algorithm (FCM) needing to know the number of clusters in advance, this paper proposed a new self-adaptive method to determine the optimal number of clusters. Firstly, a density-based algorithm was put forward. The algorithm, according to the characteristics of the dataset, automatically determined the possible maximum number of clusters instead of using the empirical ruleand obtained the optimal initial cluster centroids, improving the limitation of FCM that randomly selected cluster centroids lead the convergence result to the local minimum. Secondly, this paper, by introducing a penalty function, proposed a new fuzzy clustering validity index based on fuzzy compactness and separation, which ensured that when the number of clusters verged on that of objects in the dataset, the value of clustering validity index did not monotonically decrease and was close to zero, so that the optimal number of clusters lost robustness and decision function. Then, based on these studies, a self-adaptive FCM algorithm was put forward to estimate the optimal number of clusters by the iterative trial-and-error process. At last, experiments were done on the UCI, KDD Cup 1999, and synthetic datasets, which showed that the method not only effectively determined the optimal number of clusters, but also reduced the iteration of FCM with the stable clustering result.- 29 November 2016
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2016, 1-12
Open AccessA Self-Adaptive Fuzzyc-Means Algorithm for Determining the Optimal Number of Clusters
For the shortcoming of fuzzyc-means algorithm (FCM) needing to know the number of clusters in advance, this paper proposed a new self-adaptive method to determine the optimal number of clusters. Firstly, a density-based algorithm was put forward. The algorithm, according to the characteristics of the dataset, automatically determined the possible maximum number of clusters instead of using the empirical ruleand obtained the optimal initial cluster centroids, improving the limitation of FCM that randomly selected cluster centroids lead the convergence result to the local minimum. Secondly, this paper, by introducing a penalty function, proposed a new fuzzy clustering validity index based on fuzzy compactness and separation, which ensured that when the number of clusters verged on that of objects in the dataset, the value of clustering validity index did not monotonically decrease and was close to zero, so that the optimal number of clusters lost robustness and decision function. Then, based on these studies, a self-adaptive FCM algorithm was put forward to estimate the optimal number of clusters by the iterative trial-and-error process. At last, experiments were done on the UCI, KDD Cup 1999, and synthetic datasets, which showed that the method not only effectively determined the optimal number of clusters, but also reduced the iteration of FCM with the stable clustering result.