Feature Selection Using Neighborhood Component Analysis with Support Vector Machine for Classification of Breast Mammograms

An automated faults classification method based on binary pattern and neighborhood component analysis using induction motor

Automated accurate fire detection system using ensemble pretrained residual network

This paper presents a supervised machine learning (ML)-based approach to detect power system transmission lines faults. The measured signals at one end of the protected line were transformed into a time-frequency domain using spectrograms. Statistical features were extracted from spectrograms. Three datasets were considered to find the best classification models: the original dataset that was unbalanced with a complete set of features, a balanced dataset with a complete set of features, and a balanced dataset with a reduced number of features. Synthetic minority class oversampling technique (SMOTE) was used to balance the data to prevent biases toward the majority class. Four feature selection algorithms were applied to reduce the number of features, namely, neighborhood component analysis (NCA), minimum redundancy maximum relevance (mRMR), fit ensemble of learners, and forward sequential feature selection. Decision trees (DT), support vector machines (SVM), k-nearest neighbors (k-NN), ensemble trees classifiers were used to classify faults and non-fault events. The results showed that ensemble bagged trees of the balanced dataset and complete set of features achieved the maximum accuracy and the minimum false-negative rate. The proposed feature selection algorithms showed no improvement in the performance of the classifiers. The best classifier was then tested using an unseen scenario and showed accurate detection of the fault events for the system without inverter-based generators (IBGs). The classifier, however, was not able to detect faults during power swing after integrating IBGs such as PV plant and type-3 Wind farm behind the relay point in the protected line.

Surface‐enhanced Raman scattering (SERS) has been historically considered a tool for physical scientists. Recently, however, a new avenue has opened for the application of SERS in the medical field, mainly spurred by the implementation of SERS tags. SERS tags are employed for the indirect identification of target molecules, similarly to what fluorescent dyes do, but with several intrinsic advantages. They have proven very useful in in vivo, ex vivo, and in vitro identification of cancerous cells and tissues, with targeting selectivity that can be tuned to recognize individual markers. It has also been demonstrated for the first time that surgical outcomes may be improved via the use of SERS tags, leading to complete tumor resection. Herein, I will explain how SERS tags can aid in the identification of cancerous tissues at the single cell level and how they promise to render SERS a powerful tool for personalized cancer detection.

Classification of focal and non-focal EEG signals using neighborhood component analysis and machine learning algorithms

Machine learning models have been successfully employed in the diagnosis of Schizophrenia disease. The impact of classification models and the feature selection techniques on the diagnosis of Schizophrenia have not been evaluated. Here, we sought to access the performance of classification models along with different feature selection approaches on the structural magnetic resonance imaging data. The data consist of 72 subjects with Schizophrenia and 74 healthy control subjects. We evaluated different classification algorithms based on support vector machine (SVM), random forest, kernel ridge regression and randomized neural networks. Moreover, we evaluated T-Test, Receiver Operator Characteristics (ROC), Wilcoxon, entropy, Bhattacharyya, Minimum Redundancy Maximum Relevance (MRMR) and Neighbourhood Component Analysis (NCA) as the feature selection techniques. Based on the evaluation, SVM based models with Gaussian kernel proved better compared to other classification models and Wilcoxon feature selection emerged as the best feature selection approach. Moreover, in terms of data modality the performance on integration of the grey matter and white matter proved better compared to the performance on the grey and white matter individually. Our evaluation showed that classification algorithms along with the feature selection approaches impact the diagnosis of Schizophrenia disease. This indicates that proper selection of the features and the classification models can improve the diagnosis of Schizophrenia.

Cancer is one of the leading causes of death, and breast cancer is the second leading cause of cancer death in women. One method to realize the level of malignancy of breast cancer from an early age is by classifying the cancer malignancy using data mining. One of the widely used data mining methods with a good level of accuracy is the Support Vector Machine (SVM) and K-Nearest Neighbors (KNN). Evaluation techniques of percentage split and cross-validation were used to evaluate and compare the SVM and KNN classification models. The result was that the accuracy level of the SVM classification method was better than the KNN classification method when using the cross-validation technique, which is 95,7081%. Meanwhile, the KNN classification method was better than the SVM classification method when using the percentage split technique, which is 95,4220%. From the comparison results, it can be seen that the KNN and SVM methods work well in the classification of breast cancer.

Smoothing methods, extensively used for solving important mathematical programming problems and applications, are applied here to generate and solve an unconstrained smooth reformulation of the support vector machine for pattern classification using a completely arbitrary kernel. We term such reformulation a smooth support vector machine (SSVM). A fast Newton–Armijo algorithm for solving the SSVM converges globally and quadratically. Numerical results and comparisons are given to demonstrate the effectiveness and speed of the algorithm. On six publicly available datasets, tenfold cross validation correctness of SSVM was the highest compared with four other methods as well as the fastest. On larger problems, SSVM was comparable or faster than SVMlight (T. Joachims, in Advances in Kernel Methods—Support Vector Learning, MIT Press: Cambridge, MA, 1999), SOR (O.L. Mangasarian and David R. Musicant, IEEE Transactions on Neural Networks, vol. 10, pp. 1032–1037, 1999) and SMO (J. Platt, in Advances in Kernel Methods—Support Vector Learning, MIT Press: Cambridge, MA, 1999). SSVM can also generate a highly nonlinear separating surface such as a checkerboard.

The inclusion in workplaces of video display terminals has brought multiple benefits for the organization of work. Nevertheless, it also implies a series of risks for the health of the workers, since it can cause ocular and visual disorders, among others. In this research, a group of eye and vision-related problems associated with prolonged computer use (known as computer vision syndrome) are studied. The aim is to select the characteristics of the subject that are most relevant for the occurrence of this syndrome, and then, to develop a classification model for its prediction. The estimate of this problem is made by means of support vector machines for classification. This machine learning technique will be trained with the support of a genetic algorithm. This provides the training of the support vector machine with different patterns of parameters, improving its performance. The model performance is verified in terms of the area under the ROC curve, which leads to a model with high accuracy in the classification of the syndrome.

In the context of Industry 4.0, managing large amounts of data is essential to ensure informed decision-making in intelligent production environments. It enables, for example, predictive maintenance, which is essential for anticipating and identifying causes of failures in machines and equipment, optimizing processes, and promoting proactive management of human, financial, and material resources. However, generating accurate information for decision-making requires adopting suitable data preprocessing and analysis techniques. This study explores the identification of machine failures based on synthetic industrial data. Initially, we applied the feature selection techniques Principal Component Analysis (PCA), Minimum Redundancy Maximum Relevance (mRMR), Neighborhood Component Analysis (NCA), and Denoising Autoencoder (DAE) to the collected data and compared their results. In the sequence, a comparison among three widely known machine learning classifiers, namely Random Forest (RF), Support Vector Machine (SVM), and Multilayer Perceptron neural network (MLP), was conducted, with and without considering feature selection. The results showed that PCA and RF were superior to the other techniques, allowing the classification of failures with rates of 0.98, 0.97, and 0.98 for the accuracy, precision, and recall metrics, respectively. Thus, this work contributes by solving an industrial problem and detailing techniques to identify the most relevant variables and machine learning algorithms for predicting machine failures that negatively impact production planning. The findings provided by this study can assist industries in giving preference to employing sensors and collecting data that can contribute more effectively to machine failure predictions.

Abstract: This work explores a novel approach to accurately identify brain tumors from magnetic resonance imaging (MRI) images by utilizing the complementary capabilities of fuzzy C-Means (FCM) clustering and support vector machines (SVM). Using the soft clustering approach, MRI images are meticulously segregated in the first stage, known as FCM clustering. By giving individual voxels varying degrees of membership, FCM deftly handles the inherent ambiguities and complexity of medical pictures to produce a nuanced representation of tissue kinds. SVM, a potent supervised learning technique for binary classification applications, comes after segmentation. uses this information in the second phase of classification. Through the creation of a hyperplane that divides tumor and non-tumor regions to the greatest extent possible, support vector machines (SVM) are able to optimize the margin between these classes and improve their ability to generalize. We deliberately integrate FCM clustering with SVM classification in order to take use of the complementary characteristics that each of these techniques possesses. While SVM's strong classification skills enable it to fine-tune the identification of tumor regions, FCM's sophisticated segmentation captures the spatial distribution of tissues.

Automated EEG-based language detection using directed quantum pattern technique

The dynamic time warping (DTW) is state-of-the-art distance measure widely used in sequential pattern matching and it outperforms Euclidean distance in most cases because its matching is elastic and robust. It is tempting to substitute DTW distance for Euclidean distance in the Gaussian RBF kernel and plug it into the state-of-the art classifier support vector machines (SVMs) for sequence classification. However, it is not straightforward that DTW also outperforms Euclidean distance in kernel machines. While counter-examples can be found to numerically prove that DTW is not positive definite symmetric (PDS)acceptable by SVM, little is known why it can not be PDS theoretically. We analyze the DTW kernel and complete a theoretical proof via the connection between PDS kernel and reproducing kernel Hilbert space (RKHS). Our analysis leads to a better understanding that all Hilbertian metrics can be be converted to a PDS kernel in the Gaussian form, while the reverse is not true. The proof can be extended to conclude that elastic matching distance is not eligible to construct PDS kernels (e.g., Edit distance). Experiments were conducted to compare the RBF-kernel and DTW kernel in SVM classifications and the results show that simple Euclidean distance outperforms DTW in kernel machines.

A cooperative blind spectrum detection with the Doolittle decomposition and support vector machine (SVM) classification is proposed to improve the performance and reduce the complexity and latency of spectrum detection in hybrid Geostationary Earth Orbit and Low Earth Orbit (GEO-LEO) satellite constellation networks. First, a principal component analysis (PCA) algorithm is adopted to process perceive signals. Second, the maximum-to-minimum eigenvalue ratio of a covariance matrix is utilized to construct statistics with self-learning ability by using the Doolittle decomposition. Third, primary user and noise signals are labeled with “+1” and “$-$1” as training labels, respectively. Finally, a high-performance PCA-SVM classification is generated by training the labels and the corresponding statistics. Innovations mainly include the Doolittle decomposition of the covariance matrix in the SVM and the PCA to preprocess the perceived signals. Simulation results show that the detection probability of the proposed scheme outperforms the energy detection and the SVM algorithm by 55 and 15% at a signal-to-noise ratio (SNR) of $-$15 dB, respectively. The average error probability of the proposed scheme is 20% lower than that of the SVM at an SNR of $-$20 dB. Therefore, in hybrid GEO-LEO satellite constellation networks, the cooperative blind spectrum detection with the Doolittle decomposition and SVM classification can detect the spectrum with low complexity and high performance effectively.

This paper proposes to use border training patterns in order to improve Support Vector Machine (SVM) classification accuracy of hyperspectral images. In the proposed approach, border training patterns which are close to the separating hyperplane, are obtained in two consecutive steps and considered as final training set. In the first step, clustering is performed to the full initial training data of each class. Then, cluster centers of each class are taken as the reduced size training data and forwarded to the second step. In the second step, this reduced size training data is used in the training of SVM and cluster centers which are obtained as support vectors at this step are regarded to be located close to the hyperplane border. Finally, cluster centers which are found as support vectors and original training samples contained in these clusters only are assigned as border training patterns. Experimental results are presented to show that the proposed approach improves SVM classification accuracy.