Wisconsin Breast Cancer Database Research Articles

FPGA implementation of on-chip ANN for breast cancer diagnosis

This work intends to an integration of implementing an automated diagnostic systems for breast cancer detection using Artificial Neural Network (ANN) in FPGA. In the world, breast cancer is the fifth most common cause of cancer death. So better classification system is needed for diagnosing breast cancer disease. In this work, the training and testing of the Multilayer Perceptron Neural Network (MLPNN) with Back Propagation Network (BPN) is done with the attributes of the record of the Wisconsin Breast Cancer Database (WBCD). The neural network lacks the flexibility during off line training. In order to overcome the flexibility, it is necessary to train and test the network on on-chip neural network using FPGA. The purpose is to determine the cancer of patients either having benign or malignant through an FPGA based implementation of smart instrument. In order to implement the hardware, VERILOG coding is done for ANN and synthesized by Xilinx family XC5VLX50TFFT1136 FPGA Virtex 5 board using XILINX ISE tool to get the netlist of ANN. Finally the netlist is mapped to FPGA and the hardware functionality is verified. The correct classification rate of proposed system is 90.83%.

Kernel Combined Sparse Representation for Disease Recognition

Motivated by the idea that the correlation structure of the entire training set can disclose the relationship between the test sample and the training samples, we propose the combined sparse representation (CSR) classifier for disease recognition. The CSR classifier minimizes the correlation structure of the entire training set multiplied by its transposition and the sparse coefficient together for classification. Including the kernel concept, we propose the kernel combined sparse representation classifier utilizing the high-dimensional nonlinear information instead of the linear information in the CSR classifier. Furthermore, considering the information of the training samples and the class center, we then propose the center-based kernel combined sparse representation (CKCSR) classifier. CKCSR uses the center-based kernel matrix to increase the center-based information that is helpful for classification. The proposed classifiers have been evaluated by extensive experiments on several well-known databases including the EXACT09 database, Emphysema-CT database, mini-MIAS database, Wisconsin breast cancer database, and HD-PECTF database. The experimental results demonstrate that the proposed classifiers achieve better recognition rates than the sparse representation-based classification, collaborative representation based classification, and several state-of-the-art methods.

A MODIFIED KOHONEN SELF-ORGANIZING MAP (KSOM) CLUSTERING FOR FOUR CATEGORICAL DATA

The Kohonen Self-Organizing Map (KSOM) is one of the Neural Network unsupervised learning algorithms. This algorithm is used in solving problems in various areas, especially in clustering complex data sets. Despite its advantages, the KSOM algorithm has a few drawbacks; such as overlapped cluster and non-linear separable problems. Therefore, this paper proposes a modified KSOM that inspired from pheromone approach in Ant Colony Optimization. The modification is focusing on the distance calculation amongst objects. The proposed algorithm has been tested on four real categorical data that are obtained from UCI machine learning repository; Iris, Seeds, Glass and Wisconsin Breast Cancer Database. From the results, it shows that the modified KSOM has produced accurate clustering result and all clusters can clearly be identified.

Design of intelligent system for medical applications using rough set theory

Rough set theory offers a promising solution for discovering knowledge from vague, incomplete and uncertain data. Literature survey shows tremendous research work in reduct computation using software specially developed for rough set theory. However, it becomes quite slow while dealing with larger datasets. New developments and growth in field programmable gate array offer researchers a novel alternative of using it as a hardware accelerator. The goal of this work is to design a hardware accelerator for rough set algorithms using a field programmable gate array. This paper presents modules based on rough set theory. With the usage of multi ports RAM, pipelining in design and parallelism in algorithm, considerable improvement in frequency of overall system is achieved. The proposed design has been tested on Wisconsin Breast Cancer Database. The proposed hardware accelerator will expedite the decision-making process of pathologists and doctors. The simulation results show that the proposed hardware is significantly faster than algorithms running on a general-purpose processor even though the clock frequency of design implemented on field programmable gate array is about 25 times slower.

The Neural Networks with an Incremental Learning Algorithm Approach for Mass Classification in Breast Cancer

As breast cancer can be very aggressive, only early detection can prevent mortality. The proposed system is to eliminate the unnecessary waiting time as well as reducing human and technical errors in diagnosing breast cancer. The correct diagnosis of breast cancer is one of the major problems in the medical field. From the literature it has been found that different pattern recognition techniques can help them to improve in this domain. This paper uses the neural networks with an incremental learning algorithm as a tool to classify a mass in the breast (benign and malignant) using selection of the most relevant risk factors and decision making of the breast cancer diagnosis To test the proposed algorithm we used the Wisconsin Breast Cancer Database (WBCD). ANN with an incremental learning algorithm performance is tested using classification accuracy, sensitivity and specificity analysis, and confusion matrix. The obtained classification accuracy of 99.95%, a very promising result compared with previous algorithms already applied and recent classification techniques applied to the same database.

A Hybrid Model for Breast Cancer Diagnosis Based on Expection-Maximization and Artificial Neural Network: EM+ANN

The correct diagnosis of breast cancer is an important subject in the medical field. Different data-mining techniques have improved a great deal to help medical experts in diagnosing diseases. This paper presents an expert medical diagnosis system for predicting breast cancer based on an EM cluster algorithm and artificial neural network (ANN). With the EM clustering method, dataset is divided to homogeneous subclusters to ensure more homogeneous training and test datasets for ANN. The proposed model EM-NN achieves more efficient training, while maintaining ANN performance. To test the proposed hybrid model, we used the Wisconsin Breast Cancer Database (WBCD) from UCI machine learning repository. The correct classification rate of EM-NN is 98.54%. This result demonstrated that to enhance the classification accuracy, the training process of the model is necessary to use homogeneous data in a learning-based classification algorithm. The proposed model can be used to obtain correct results for other diseases.

An optimal method for data clustering

An algorithm for optimizing data clustering in feature space is studied in this work. Using graph Laplacian and extreme learning machine (ELM) mapping technique, we develop an optimal weight matrix W for feature mapping. This work explicitly performs a mapping of the original data for clustering into an optimal feature space, which can further increase the separability of original data in the feature space, and the patterns points in same cluster are still closely clustered. Our method, which can be easily implemented, gets better clustering results than some popular clustering algorithms, like k-means on the original data, kernel clustering method, spectral clustering method, and ELM k-means on data include three UCI real data benchmarks (IRIS data, Wisconsin breast cancer database, and Wine database).

A Breast Cancer Classifier Using a Neuron Model with Dendritic Nonlinearity

SUMMARY Breast cancer is a serious disease across the world, and it is one of the largest causes of cancer death for women. The traditional diagnosis is not only time consuming but also easily affected. Hence, artificial intelligence (AI), especially neural networks, has been widely used to assist to detect cancer. However, in recent years, the computational ability of a neuron has attracted more and more attention. The main computational capacity of a neuron is located in the dendrites. In this paper, a novel neuron model with dendritic nonlinearity (NMDN) is proposed to classify breast cancer in the Wisconsin Breast Cancer Database (WBCD). In NMDN, the dendrites possess nonlinearity when realizing the excitatory synapses, inhibitory synapses, constant-1 synapses and constant-0 synapses instead of being simply weighted. Furthermore, the nonlinear interaction among the synapses on a dendrite is defined as a product of the synaptic inputs. The soma adds all of the products of the branches to produce an output. A back-propagation-based learning algorithm is introduced to train the NMDN. The performance of the NMDN is compared with classic back propagation neural networks (BPNNs). Simulation results indicate that NMDN possesses superior capability in terms of the accuracy, convergence rate, stability and area under the ROC curve (AUC). Moreover, regarding ROC, for continuum values, the existing 0-connections branches after evolving can be eliminated from the dendrite morphology to release computational load, but with no influence on the performance of classification. The results disclose that the computational ability of the neuron has been undervalued, and the proposed NMDN can be an interesting choice for medical researchers in further research.

Cancer prediction based on radical basis function neural network with particle swarm optimization.

This paper addresses cancer prediction based on radial basis function neural network optimized by particle swarm optimization. Today, cancer hazard to people is increasing, and it is often difficult to cure cancer. The occurrence of cancer can be predicted by the method of the computer so that people can take timely and effective measures to prevent the occurrence of cancer. In this paper, the occurrence of cancer is predicted by the means of Radial Basis Function Neural Network Optimized by Particle Swarm Optimization. The neural network parameters to be optimized include the weight vector between network hidden layer and output layer, and the threshold of output layer neurons. The experimental data were obtained from the Wisconsin breast cancer database. A total of 12 experiments were done by setting 12 different sets of experimental result reliability. The findings show that the method can improve the accuracy, reliability and stability of cancer prediction greatly and effectively.

A data mining method for breast cancer identification based on a selection of variables

In the majority of countries, breast cancer among women is highly prevalent. If diagnosed in the early stages, there is a high probability of a cure. Several statistical-based approaches have been developed to assist in early breast cancer detection. This paper presents a method for selection of variables for the classification of cases into two classes, benign or malignant, based on cytopathological analysis of breast cell samples of patients. The variables are ranked according to a new index of importance of variables that combines the weighting importance of Principal Component Analysis and the explained variance based on each retained component. Observations from the test sample are categorized into two classes using the k-Nearest Neighbor algorithm and Discriminant Analysis, followed by elimination of the variable with the index of lowest importance. The subset with the highest accuracy is used to classify observations in the test sample. When applied to the Wisconsin Breast Cancer Database, the proposed method led to average of 97.77% in classification accuracy while retaining an average of 5.8 variables.

A novel approach to cutting decision trees

In data mining, binary classification has a wide range of applications. Cutting Decision Tree (CDT) induction is an efficient mathematical programming based method that tries to discretize the data set on hand by using multiple separating hyperplanes. A new improvement to CDT model is proposed in this study by incorporating the second goal of maximizing the distance of the correctly classified instances to the misclassification region. Computational results show that developed model achieves better classification accuracy for Wisconsin Breast Cancer database and Japanese Banks data set when compared to existing piecewise-linear models in literature. Furthermore, remarkable results are obtained for the well-known benchmarking data sets (Buba Liver Disorders, Blood Tranfusion and Pima Indian Diabetes) when compared to the original CDT model.

Breast Cancer Diagnosis by using k-Nearest Neighbor with Different Distances and Classification Rules

Cancer diagnosis is one of the most studied problems in the medical domain. Several researchers have focused in order to improve performance and achieve to obtain satisfactory results. Breast cancer is one of cancer killer in the world. The diagnosis of this cancer is a big problem in cancer diagnosis researches. In artificial intelligent, machine learning is a discipline which allows to the machine to evolve through a process. Machine learning is widely used in bio informatics and particularly in breast cancer diagnosis. One of the most popular methods is K-nearest neighbors (K-NN) which is a supervised learning method. Using the K-NN in medical diagnosis is very interesting. The quality of the results depends largely on the distance and the value of the parameter “k” which represent the number of the nearest neighbors. In this paper, we study and evaluate the performance of different distances that can be used in the K-NN algorithm. Also, we analyze this distance by using different values of the parameter “k” and by using several rules of classification (the rule used to decide how to classify a sample). Our work will be performed on the WBCD database (Wisconsin Breast Cancer Database) obtained by the university of Wisconsin Hospital.

A research about breast cancer detection using different neural networks and K-MICA algorithm

Breast cancer is the second leading cause of death for women all over the world. The correct diagnosis of breast cancer is one of the major problems in the medical field. From the literature it has been found that different pattern recognition techniques can help them to improve in this domain. This paper presents a novel hybrid intelligent method for detection of breast cancer. The proposed method includes two main modules: Clustering module and the classifier module. In the clustering module, first the input data will be clustered by a new technique. This technique is a suitable combination of the modified imperialist competitive algorithm (MICA) and K-means algorithm. Then the Euclidean distance of each pattern is computed from the determined clusters. The classifier module determines the membership of the patterns using the computed distance. In this module, several neural networks, such as the multilayer perceptron, probabilistic neural networks and the radial basis function neural networks are investigated. Using the experimental study, we choose the best classifier in order to recognize the breast cancer. The proposed system is tested on Wisconsin Breast Cancer (WBC) database and the simulation results show that the recommended system has high accuracy.

Probabilistic neural network for breast cancer classification

Among cancers, breast cancer causes second most number of deaths in women. To reduce the high number of unnecessary breast biopsies, several computer-aided diagnosis systems have been proposed in the last years. These systems help physicians in their decision to perform a breast biopsy on a suspicious lesion seen in a mammogram or to perform a short-term follow-up examination instead. In clinical diagnosis, the use of artificial intelligent techniques as neural networks has shown great potential in this field. In this paper, three classification algorithms, multi-layer perceptron (MLP), radial basis function (RBF) and probabilistic neural networks (PNN), are applied for the purpose of detection and classification of breast cancer. Decision making is performed in two stages: training the classifiers with features from Wisconsin Breast Cancer database and then testing. The performance of the proposed structure is evaluated in terms of sensitivity, specificity, accuracy and ROC. The results revealed that PNN was the best classifiers by achieving accuracy rates of 100 and 97.66 % in both training and testing phases, respectively. MLP was ranked as the second classifier and was capable of achieving 97.80 and 96.34 % classification accuracy for training and validation phases, respectively, using scaled conjugate gradient learning algorithm. However, RBF performed better than MLP in the training phase, and it has achieved the lowest accuracy in the validation phase.

A hybrid breast cancer detection system via neural network and feature selection based on SBS, SFS and PCA

Two hybrid feature selection methods (SFSP and SBSP) which are composed by combining the sequential forward selection and the sequential backward selection together with the principal component analysis developed by utilizing quadratic discriminant analysis classification algorithmic criteria so as to utilize in the diagnosis of breast cancer fast and effectively are presented in this study. The tenfold cross-validation method has been applied in the algorithm, which is utilized as criteria during the selection of the features. The dimension of the feature space for input has been decreased from 9 to 4 thanks to the selection of these two hybrid features. The Artificial Neural Networks have been used as classifier. The cross-validation method has been preferred also in the phase of this classification as in the case of the selection of the feature in order to increase the reliability of the result. The Wisconsin Breast Cancer Database obtained from the UCI has been utilized so as to determine the correctness of the system suggested. The values of the average correctness of the classification obtained by utilizing a tenfold cross-validation of the two hybrid systems developed earlier are found, respectively, as follows: for SFSP + NN, 97.57 % and for SBSP + NN, 98.57 %. SBSP + NN system has been observed that, among the studies carried out by implementing the cross-validation method for the breast cancer, the result appears to be very promising. The acquired results have revealed that this hybrid system applied by means of reducing dimension is an utilizable system in order to diagnose the diseases faster and more successfully.

Breast Cancer Recognition Using a Novel Hybrid Intelligent Method

Breast cancer is the second largest cause of cancer deaths among women. At the same time, it is also among the most curable cancer types if it can be diagnosed early. This paper presents a novel hybrid intelligent method for recognition of breast cancer tumors. The proposed method includes three main modules: the feature extraction module, the classifier module, and the optimization module. In the feature extraction module, fuzzy features are proposed as the efficient characteristic of the patterns. In the classifier module, because of the promising generalization capability of support vector machines (SVM), a SVM-based classifier is proposed. In support vector machine training, the hyperparameters have very important roles for its recognition accuracy. Therefore, in the optimization module, the bees algorithm (BA) is proposed for selecting appropriate parameters of the classifier. The proposed system is tested on Wisconsin Breast Cancer database and simulation results show that the recommended system has a high accuracy.

Breast Cancer Classification Based on Advanced Multi Dimensional Fuzzy Neural Network

Breast cancer is the cause of the most common cancer death in women. Early detection of the breast cancer is an effective method to reduce mortality. Fuzzy Neural Networks (FNN) comprises an integration of the merits of neural and fuzzy approaches, enabling one to build more intelligent decision-making systems. But increasing the number of inputs causes exponential growth in the number of parameters in Fuzzy Neural Networks (FNN) and computational complexity increases accordingly. This phenomenon is named as "curse of dimensionality". The Hierarchical Fuzzy Neural Network (HFNN) and the Fuzzy Gaussian Potential Neural Network (FGPNN) are utilized to deal this problem. In this study, the HFNN and FGPNN by using new training algorithm, are applied to the Wisconsin Breast Cancer Database to classify breast cancer into two groups; benign and malignant lesions. The HFNN consists of hierarchically connected low-dimensional fuzzy neural networks. It can use fewer rules and parameters to model nonlinear system. Moreover, the FGPNN consists of Gaussian Potential Function (GPF) used in the antecedent as the membership function. When the number of inputs increases in FGPNN, the number of fuzzy rules does not increase. The performance of HFNN and FGPNN are evaluated and compared with FNN. Simulation results show the effectiveness of these methods even with less rules and parameters in performance result. These methods maintain the accuracy of original fuzzy neural system and have high interpretability by human in diagnosis of breast cancer.

Sparse data-dependent kernel principal component analysis based on least squares support vector machine for feature extraction and recognition

Kernel learning is widely used in many areas, and many methods are developed. As a famous kernel learning method, kernel principal component analysis (KPCA) endures two problems in the practical applications. One is that all training samples need to be stored for the computing the kernel matrix during kernel learning. Second is that the kernel and its parameter have the heavy influence on the performance of kernel learning. In order to solve the above problem, we present a novel kernel learning namely sparse data-dependent kernel principal component analysis through reducing the training samples with sparse learning-based least squares support vector machine and adaptive self-optimizing kernel structure according to the input training samples. Experimental results on UCI datasets, ORL and YALE face databases, and Wisconsin Breast Cancer database show that it is feasible to improve KPCA on saving consuming space and optimizing kernel structure.

WBCD breast cancer database classification applying artificial metaplasticity neural network

The correct diagnosis of breast cancer is one of the major problems in the medical field. From the literature it has been found that different pattern recognition techniques can help them to improve in this domain. These techniques can help doctors form a second opinion and make a better diagnosis. In this paper we present a novel improvement in neural network training for pattern classification. The proposed training algorithm is inspired by the biological metaplasticity property of neurons and Shannon’s information theory. During the training phase the Artificial metaplasticity Multilayer Perceptron (AMMLP) algorithm gives priority to updating the weights for the less frequent activations over the more frequent ones. In this way metaplasticity is modeled artificially. AMMLP achieves a more effcient training, while maintaining MLP performance. To test the proposed algorithm we used the Wisconsin Breast Cancer Database (WBCD). AMMLP performance is tested using classification accuracy, sensitivity and specificity analysis, and confusion matrix. The obtained AMMLP classification accuracy of 99.26%, a very promising result compared to the Backpropagation Algorithm (BPA) and recent classification techniques applied to the same database.

Breast cancer classification applying artificial metaplasticity algorithm

A novel improvement in neural network training for pattern classification is presented in this paper. The proposed training algorithm is inspired by the biological metaplasticity property of neurons and Shannon's information theory. This algorithm is applicable to artificial neural networks (ANNs) in general, although here it is applied to a multilayer perceptron (MLP). During the training phase, the artificial metaplasticity multilayer perceptron (AMMLP) algorithm assigns higher values for updating the weights in the less frequent activations than in the more frequent ones. AMMLP achieves a more efficient training and improves MLP performance. The well-known and readily available Wisconsin Breast Cancer Database (WBCD) has been used to test the algorithm. Performance of the AMMLP was tested through classification accuracy, sensitivity and specificity analysis, and confusion matrix analysis. The results obtained by AMMLP are compared with the backpropagation algorithm (BPA) and other recent classification techniques applied to the same database. The best result obtained so far with the AMMLP algorithm is 99.63%.