Search

As one of the most common types of cancer among women, breast cancer is a serious health concern worldwide. Early detection is crucial for successful treatment and improved survival rates. However, detecting breast cancer is challenging due to imbalanced classification, where the minority class (cancerous) is ominously smaller than the majority class (non-cancerous). In this paper, we explore the use of logistic regression (LR) and the adaptive synthetic resampling (ADASYN) technique to address imbalanced classification in breast cancer detection. To that end, we collected the Wisconsin Breast Cancer dataset, which contains 569 instances. The dataset is imbalanced, with 212 malignant (cancerous) cases and 357 benign (non-cancerous) cases. Then, we trained support vector machine, LR, K-nearest neighbor, gradient, and adaptive boosting on the imbalanced dataset. Finally, we trained these algorithms on resampled data with the ADASYN oversampling and we evaluated their performance using cross-validation score with 5-folds. The results of the experiment showed that using ADASYN with LR significantly improved the performance the LR model. The LR model achieves 99.46% accuracy on breast cancer diagnosis. Moreover, the confusion matrix shows that among the 188 samples, the model misclassified one cancerous instance. Thus, we concluded that the proposed model is effective for breast cancer diagnosis. [ABSTRACT FROM AUTHOR]

Breast cancer was the most diagnosed form of cancer in 2020. Early diagnosis of breast cancer results in a significant improvement in long-term survival rates. Current methods require consultation with experts, which is expensive and time-consuming and thus may not be accessible to all. This paper seeks to train and evaluate supervised machine learning models for the accurate and efficient detection of breast cancer. The Wisconsin Breast Cancer Database dataset describes 30 attributes of cell nuclei, including, but not limited to, their radius, texture, and concavity. It contains 569 instances, 212 of which are malignant tumors. The Random Forest algorithm outperforms other algorithms in classifying breast tumors as either malignant or benign and is thus selected as our primary model. It is trained on two different subsets of the dataset having 16 and 8 features, respectively, identified with the help of multiple feature selection methods. The Random Forest models are tested post hyperparameter tuning on a holdout set, and accuracies of 100% and 99.30% respectively. The models are also compared with four other machine learning classification algorithms: Support Vector Machine (SVM), Decision Tree, Multilayer Perceptron, and K-Nearest Neighbors. The results confirm that Random Forest is the superior method for breast cancer diagnosis. [ABSTRACT FROM AUTHOR]

• A novel integrated framework for the diagnosis of breast cancer patients is proposed. • A scheme combining feature selection and hyperparameter optimization is proposed to improve the prediction accuracy of the model. • Compared with the existing models, the proposed model has higher performance and generalization ability. In this paper, a new integrated scheme is proposed to accurately predict breast cancer, help doctors make early diagnosis and treatment plans, and improve the prognosis of patients. We selects five mainstream machine learning models: support vector machine (SVM), artificial neural network (ANN), random forest (RF), extreme gradient boosting (XGBoost) and adaptive boosting (AdaBoost). The Wisconsin Breast Cancer Database (WBCD) and Wisconsin Diagnostic Breast Cancer (WDBC) are used as datasets to investigate the predictive performance of these single and ensemble models. Then, we use multiple linear regression method for feature selection (FS), the experimental results show that the change of feature subset will significantly affect the performance of the model. The recall and f1-score of the five models are improved by 1.19% and 0.84% on average. After that, we apply whale optimization algorithm (WOA) to optimize the hyperparameters of the model to improve their prediction performance. In the best-case scenario, the model demonstrated improvements of 1.02% in accuracy and 1.82% in precision. In addition, we ensemble these models by stacking, investigate the performance changes of the ensemble model when different models are used as meta learners. Finally, the FS-WOA-Stacking model achieves 99.56% accuracy on WBCD and 99.65% accuracy on WDBC. Compared with the existing breast cancer prediction models, the performance of the proposed model is at an excellent level. [ABSTRACT FROM AUTHOR]

This paper presents a new training algorithm that can update the situation of layers' network, and therefore, connections, neurons, and firing rate of neurons based on FORCE (first-order reduced and controlled error) training algorithm. The Quantized Full FORCE algorithm (QFF) also updates the number of neurons and connections between different layers in the network per iteration in a way that the whole firing rate of each layer is updated via selecting the best neurons and combining strong features. The update method is sequential, so that with each instance passing through the network, the network structure is updated with the Full FORCE algorithm. The algorithm updates the structure of networks with a multiple/single middle layer of the supervised version of feed forward networks such as Multilayer perceptron (MLP), changing them into partially-connected networks. A combination of principal component analysis PCA and Linear Discriminant Analysis (LDA) algorithms has been used to cluster the network input features. The paper focuses on the deep supervised MLP network with backpropagation (BP) and various datasets and its comparison with other MLP based stat of art methods and hybrid evolutionary algorithms. We achieved 98.15 percent accuracy for facial expression 98.6 and 97.7 percent for Wisconsin breast Cancer and Iris Flower in respectively. The training algorithm employed in the study enjoys a lower computational complexity while yielding faster and more accurate convergence, starting with a very low level of errors of 0.009 in comparison with the full connection network and it solves the challenge of getting stuck in local minima and poor convergence of Gradient Decent with BP. • Providing the new training algorithm to update the connections and firing rate of neurons in each iteration. • The proposed training model is based on Quantized Full FORCE (first-order reduced and controlled error) training. • Providing an accurate framework to update the number of neurons, converting the network to a partial connection network. • In the new training model, the best features have the highest number of connections and neurons within the middle layers. • Being the decision speed of the network in the proposed method much faster than a fully connected network. • Cost-effectiveness and much lower resource requirements for implementation of deep networks on hardware such as FPGAs. [ABSTRACT FROM AUTHOR]

Each year number of deaths is increasing extremely because of breast cancer. It is the most frequent type of all cancers and the major cause of death in women worldwide. Any development for prediction and diagnosis of cancer disease is capital important for a healthy life. Consequently, high accuracy in cancer prediction is important to update the treatment aspect and the survivability standard of patients. Machine learning techniques can bring a large contribute on the process of prediction and early diagnosis of breast cancer, became a research hotspot and has been proved as a strong technique. In this study, we applied five machine learning algorithms: Support Vector Machine (SVM), Random Forest, Logistic Regression, Decision tree (C4.5) and K-Nearest Neighbours (KNN) on the Breast Cancer Wisconsin Diagnostic dataset, after obtaining the results, a performance evaluation and comparison is carried out between these different classifiers. The main objective of this research paper is to predict and diagnosis breast cancer, using machine-learning algorithms, and find out the most effective whit respect to confusion matrix, accuracy and precision. It is observed that Support vector Machine outperformed all other classifiers and achieved the highest accuracy (97.2%).All the work is done in the Anaconda environment based on python programming language and Scikit-learn library. [ABSTRACT FROM AUTHOR]

Today, machine learning algorithms are an important research area capable of analyzing and modeling data in any field. Information obtained through machine learning methods helps researchers and planners to understand and review systematic problems of their current strategies. Thus, it is very important to work fully in every field that facilitates human life, such as early and correct diagnosis, correct choice, fully functioning autonomous systems. In this paper, a novel machine learning algorithm for multiclass classification is presented. The proposed method is designed based on the Minimum Distance Classifier (MDC) algorithm. The MDC is variance-insensitive because it classifies input vectors by calculating their distances/similarities with respect to class-centroids (average value of input vectors of a class). As it is known, real-world data contains certain proportions of noise. This situation negatively affects the performance of the MDC. To overcome this problem, we developed a variance-sensitive model, which we call Standardized Variable Distances (SVD), considering the standard deviation and z-score (standardized variable) factors. To ensure the accuracy of the SVD, we used Wisconsin Breast Cancer Original (WBCO) and LED Display Domain (led7digit) datasets, which we obtained from UCI machine learning repository, with 5-fold cross validation. It was compared and analyzed classification performance of the SVD with Decision Tree (DT), Random Forest (RF), k-Nearest Neighbor (k-NN), Multinomial Logistic Regression (MLR), Naïve Bayes (NB), Support Vector Machine (SVM), and the Minimum Distance Classifier (MDC), which are well-known in the literature. It has also been compared thirteen different studies using the same datasets over the past five years. Our results in the experimental studies have shown that the SVD can classify better than traditional and state-of-the-art methods, compared in this study. The proposed method reached over 97% classification accuracy (CACC), F-measure (FM) and area under the curve (AUC) on the WBCO dataset. On the led7digit dataset, approximately 74% CACC, 75.1% FM and 82.2% AUC scores were obtained. It has been observed that the classification scores obtained with the SVD are higher than other ML algorithms used in the experimental studies. • The Standardized Variable Distances (SVD) is a novel machine learning algorithm. • The SVD is an improved version of the Minimum Distance Classifier (MDC) algorithm. • The SVD, which is a distance-based method, is capable of multiclass classification. • The SVD can be coupled with any distance measure method. [ABSTRACT FROM AUTHOR]