Mingzhao Wang
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
Mingzhao Wang has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Juanying Xie
Shaanxi Normal University
12 shared publications - Huan Yan
School of Computer Science, Shaanxi Normal University, Xian, China
2 shared publications - Philip W. Grant
Department of Computer Science, Swansea University, Swansea, U.K.
2 shared publications - Witold Pedrycz
University of Alberta
2 shared publications - Ying Peng
School of Computer Science, Shaanxi Normal University,Xian,China,710119
2 shared publications Aixun Wang
Wuhan Construction Group Co., Ltd. Enterprise Technology Center, Wuhan, Hubei, China
1 shared publication
Latest Publications
- 9 July 2026
- Published by Springer Nature
- p. 98-117
Feature Selection Based on Discriminability and Non-redundancy
- 9 July 2026
- Published by Springer Nature
- p. 98-117
Feature Selection Based on Discriminability and Non-redundancy
- 19 November 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 332
SMFK-DPC: Enhanced density peak clustering by the weighted Manhattan distance
- 19 November 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 332
SMFK-DPC: Enhanced density peak clustering by the weighted Manhattan distance
- 1 August 2025
- Published by Springer Nature
- p. 228-240
Bidirectional Position-Context Feature Representation for Predicting DNA/RNA Modification Sites
- 1 August 2025
- Published by Springer Nature
- p. 228-240
Bidirectional Position-Context Feature Representation for Predicting DNA/RNA Modification Sites
- 25 June 2025
- Published by Elsevier in Pattern Recognition
- Vol. 170
WANN-DPC: Density peaks finding clustering based on Weighted Adaptive Nearest Neighbors
- 25 June 2025
- Published by Elsevier in Pattern Recognition
- Vol. 170
WANN-DPC: Density peaks finding clustering based on Weighted Adaptive Nearest Neighbors
- Open Access
- 1 February 2025
- Published by Taylor & Francis in Journal of Multidisciplinary Healthcare
- Vol. ume 18, 675-695
Detection of Masses in Mammogram Images Based on the Enhanced RetinaNet Network With INbreast Dataset
Purpose: Breast cancer is the most common major public health problems of women in the world. Until now, analyzing mammogram images is still the main method used by doctors to diagnose and detect breast cancers. However, this process usually depends on the experience of radiologists and is always very time consuming. Patients and Methods: We propose to introduce deep learning technology into the process for the facilitation of computer-aided diagnosis (CAD), and address the challenges of class imbalance, enhance the detection of small masses and multiple targets, and reduce false positives and negatives in mammogram analysis. Therefore, we adopted and enhanced RetinaNet to detect masses in mammogram images. Specifically, we introduced a novel modification to the network structure, where the feature map M5 is processed by the ReLU function prior to the original convolution kernel. This strategic adjustment was designed to prevent the loss of resolution for small mass features. Additionally, we introduced transfer learning techniques into training process through leveraging pre-trained weights from other RetinaNet applications, and fine-tuned our improved model using the INbreast dataset. Results: The aforementioned innovations facilitate superior performance of the enhanced RetiaNet model on the public dataset INbreast, as evidenced by a mAP (mean average precision) of 1.0000 and TPR (true positive rate) of 1.00 at 0.00 FPPI (false positive per image) on the INbreast dataset. Conclusion: The experimental results demonstrate that our enhanced RetinaNet model defeats the existing models by having more generalization performance than other published studies, and it can also be applied to other types of patients to assist doctors in making a proper diagnosis.
- 1 February 2025
- Published by Taylor & Francis in Journal of Multidisciplinary Healthcare
- Vol. ume 18, 675-695
Open AccessDetection of Masses in Mammogram Images Based on the Enhanced RetinaNet Network With INbreast Dataset
Purpose: Breast cancer is the most common major public health problems of women in the world. Until now, analyzing mammogram images is still the main method used by doctors to diagnose and detect breast cancers. However, this process usually depends on the experience of radiologists and is always very time consuming. Patients and Methods: We propose to introduce deep learning technology into the process for the facilitation of computer-aided diagnosis (CAD), and address the challenges of class imbalance, enhance the detection of small masses and multiple targets, and reduce false positives and negatives in mammogram analysis. Therefore, we adopted and enhanced RetinaNet to detect masses in mammogram images. Specifically, we introduced a novel modification to the network structure, where the feature map M5 is processed by the ReLU function prior to the original convolution kernel. This strategic adjustment was designed to prevent the loss of resolution for small mass features. Additionally, we introduced transfer learning techniques into training process through leveraging pre-trained weights from other RetinaNet applications, and fine-tuned our improved model using the INbreast dataset. Results: The aforementioned innovations facilitate superior performance of the enhanced RetiaNet model on the public dataset INbreast, as evidenced by a mAP (mean average precision) of 1.0000 and TPR (true positive rate) of 1.00 at 0.00 FPPI (false positive per image) on the INbreast dataset. Conclusion: The experimental results demonstrate that our enhanced RetinaNet model defeats the existing models by having more generalization performance than other published studies, and it can also be applied to other types of patients to assist doctors in making a proper diagnosis.
- 4 May 2024
- Published by Springer Nature in Cognitive Computation
- Vol. 16 (3) , 1176-1197
CIL-Net: Densely Connected Context Information Learning Network for Boosting Thyroid Nodule Segmentation Using Ultrasound Images
- 4 May 2024
- Published by Springer Nature in Cognitive Computation
- Vol. 16 (3) , 1176-1197
CIL-Net: Densely Connected Context Information Learning Network for Boosting Thyroid Nodule Segmentation Using Ultrasound Images
- 1 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 33 (3) , 766-775
The Squeeze & Excitation Normalization Based nnU-Net for Segmenting Head & Neck Tumors
Head and neck cancer is one of the most common malignancies in the world. We propose SE-nnU-Net by adapting SE (squeeze and excitation) normalization into nnU-Net, so as to segment head and neck tumors in PET/CT images by combining advantages of SE capturing features of interest regions and nnU-Net configuring itself for a specific task. The basic module referred to convolution-ReLU-SE is designed for SE-nnU-Net. In the encoder it is combined with residual structure while in the decoder without residual structure. The loss function combines Dice loss and Focal loss. The specific data preprocessing and augmentation techniques are developed, and specific network architecture is designed. Moreover, the deep supervised mechanism is introduced to calculate the loss function using the last four layers of the decoder of SE-nnU-Net. This SE-nnU-net is applied to HECKTOR 2020 and HECKTOR 2021 challenges, respectively, using different experimental design. The experimental results show that SE-nnU-Net for HECKTOR 2020 obtained 0.745, 0.821, and 0.725 in terms of Dice, Precision, and Recall, respectively, while the SE-nnU-Net for HECKTOR 2021 obtains 0.778 and 3.088 in terms of Dice and median HD95, respectively. This SE-nnU-Net for segmenting head and neck tumors can provide auxiliary opinions for doctors' diagnoses.
- 1 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 33 (3) , 766-775
The Squeeze & Excitation Normalization Based nnU-Net for Segmenting Head & Neck Tumors
Head and neck cancer is one of the most common malignancies in the world. We propose SE-nnU-Net by adapting SE (squeeze and excitation) normalization into nnU-Net, so as to segment head and neck tumors in PET/CT images by combining advantages of SE capturing features of interest regions and nnU-Net configuring itself for a specific task. The basic module referred to convolution-ReLU-SE is designed for SE-nnU-Net. In the encoder it is combined with residual structure while in the decoder without residual structure. The loss function combines Dice loss and Focal loss. The specific data preprocessing and augmentation techniques are developed, and specific network architecture is designed. Moreover, the deep supervised mechanism is introduced to calculate the loss function using the last four layers of the decoder of SE-nnU-Net. This SE-nnU-net is applied to HECKTOR 2020 and HECKTOR 2021 challenges, respectively, using different experimental design. The experimental results show that SE-nnU-Net for HECKTOR 2020 obtained 0.745, 0.821, and 0.725 in terms of Dice, Precision, and Recall, respectively, while the SE-nnU-Net for HECKTOR 2021 obtains 0.778 and 3.088 in terms of Dice and median HD95, respectively. This SE-nnU-Net for segmenting head and neck tumors can provide auxiliary opinions for doctors' diagnoses.
- 16 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (11) , 6195-6209
Feature Selection With Discernibility and Independence Criteria
Feature selection plays a significant role in data mining and machine learning. It is challenging to determine how many features are necessary to form an optimal feature subset. To address this challenge, an innovative visual 2D feature selection framework is introduced, in which the feature discernibility and independence are defined to evaluate its capability for classification and its relevance to other features, respectively. All features are represented in 2D space with discernibility as$x$ -axis and independence as$y$ -axis. The features located in the upper right corner represent high discernibility and high independence, so comprise the optimal feature subset. This leads to the formation of a family of feature selection algorithms. Three such algorithms are proposed in this paper referred to as FSDIE, FSDIR, and FSDIS (Feature Selection based on the Discernibility and the Independence, respectively, of Exponent, Reciprocal, and anti-Similarity). To speed-up these three algorithms, a clustering based feature preselection first eliminates some unrelated and redundant features. Extensive experiments on UCI datasets, face datasets and gene expression datasets demonstrate that these three 2D feature selection algorithms are superior to the state-of-the-art methods indicating the power of our 2D feature selection framework.- 16 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (11) , 6195-6209
Feature Selection With Discernibility and Independence Criteria
Feature selection plays a significant role in data mining and machine learning. It is challenging to determine how many features are necessary to form an optimal feature subset. To address this challenge, an innovative visual 2D feature selection framework is introduced, in which the feature discernibility and independence are defined to evaluate its capability for classification and its relevance to other features, respectively. All features are represented in 2D space with discernibility as$x$ -axis and independence as$y$ -axis. The features located in the upper right corner represent high discernibility and high independence, so comprise the optimal feature subset. This leads to the formation of a family of feature selection algorithms. Three such algorithms are proposed in this paper referred to as FSDIE, FSDIR, and FSDIS (Feature Selection based on the Discernibility and the Independence, respectively, of Exponent, Reciprocal, and anti-Similarity). To speed-up these three algorithms, a clustering based feature preselection first eliminates some unrelated and redundant features. Extensive experiments on UCI datasets, face datasets and gene expression datasets demonstrate that these three 2D feature selection algorithms are superior to the state-of-the-art methods indicating the power of our 2D feature selection framework.- 4 April 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 294
ANN-DPC: Density peak clustering by finding the adaptive nearest neighbors
- 4 April 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 294
ANN-DPC: Density peak clustering by finding the adaptive nearest neighbors
- 20 October 2023
- Published by Elsevier in Information Sciences
- Vol. 653
SFKNN-DPC: Standard deviation weighted distance based density peak clustering algorithm
- 20 October 2023
- Published by Elsevier in Information Sciences
- Vol. 653
SFKNN-DPC: Standard deviation weighted distance based density peak clustering algorithm