Data Classification Problems Research Articles

DK-MS: an efficient method for solving imbalanced Big Data classification problems

DK-MS: an efficient method for solving imbalanced Big Data classification problems

A [formula omitted]-means triangular synthesis large margin classifier with unified pinball loss for imbalanced data

Large Margin Distribution Machine (LDM) improves the Support Vector Machine (SVM) by integrating the marginal distribution of samples into the objective function, which exhibits excellent classification and generalization performance. However, most of the existing LDM-based models exhibit inherent flaws: (1) The assumption of a category uniform distribution, resulting in an inability to effectively address the issue of class imbalance. (2) The inheritance of the hinge loss in SVM, leading to inferior anti-noise performance. Given the shortcomings above, this paper constructs a novel K-means Triangular Synthesis (KTS) method for imbalanced data classification and introduces Unified Pinball (UP) loss to ensure robust performance, demonstrated as a novel KTS large margin classifier with UP Loss (KTS-UPLMC) model. Specifically, the KTS method utilizes the triangular synthesis and generates samples based on the cluster density, effectively mitigating the problems of introducing noise samples and strip-shaped sample distribution in the traditional synthetic minority oversampling technique, further alleviating the LDM’s classification line offset. In addition, the UP Loss considers quantile distance, improving the anti-noise performance of the model. Comparative experiments on artificial datasets and benchmark datasets validate the effectiveness and noise resistance of the proposed KTS-UPLMC in imbalanced data classification problems. Furthermore, the stability of the KTS-UPLMC is substantiated by the parameter sensitivity analysis experiment. In conclusion, the KTS method effectively addresses category imbalance, while the integration of the UP Loss enhances noise resistance.

An evolutionary algorithm‐based classification method for high‐dimensional imbalanced mixed data with missing information

AbstractThe data scale keeps growing by leaps and the majority of it is high‐dimensional imbalanced data, which is hard to classify. Data missing often happens in software which further aggravates the difficulty of classifying the data. In order to resolve high‐dimensional imbalanced mixed‐variables missing data classification problem, a novel method based on particle swarm optimization is developed. It has three original components including multiple feature selection, mixed attribute imputation, and quantum oversampling. Multiple feature selection uses a two‐stage strategy to obtain stable relevant features. Mixed attribute imputation separates features into continuous and discrete features and fills missing values with different models. Quantum oversampling chooses instances to balance data based on the quantum operator. Furthermore, particle swarm optimization is employed to optimize the parameters of the components to obtain preferable classification results. Six representative classification datasets, six typical algorithms, and four measures are taken to conduct exhaust experiments, and results indicate that the proposed method is superior to the comparison algorithms.

Discriminative Deep Canonical Correlation Analysis for Multi-View Data.

Over the past few years, multimodal data analysis has emerged as an inevitable method for identifying sample categories. In the multi-view data classification problem, it is expected that the joint representation should include the supervised information of sample categories so that the similarity in the latent space implies the similarity in the corresponding concepts. Since each view has different statistical properties, the joint representation should be able to encapsulate the underlying nonlinear data distribution of the given observations. Another important aspect is the coherent knowledge of the multiple views. It is required that the learning objective of the multi-view model efficiently captures the nonlinear correlated structures across different modalities. In this context, this article introduces a novel architecture, termed discriminative deep canonical correlation analysis (D2CCA), for classifying given observations into multiple categories. The learning objective of the proposed architecture includes the merits of generative models to identify the underlying probability distribution of the given observations. In order to improve the discriminative ability of the proposed architecture, the supervised information is incorporated into the learning objective of the proposed model. It also enables the architecture to serve as both a feature extractor as well as a classifier. The theory of CCA is integrated with the objective function so that the joint representation of the multi-view data is learned from maximally correlated subspaces. The proposed framework is consolidated with corresponding convergence analysis. The efficacy of the proposed architecture is studied on different domains of applications, namely, object recognition, document classification, multilingual categorization, face recognition, and cancer subtype identification with reference to several state-of-the-art methods.

Nearest neighbors and density-based undersampling for imbalanced data classification with class overlap

While addressing the problem of imbalanced data classification, most existing resampling methods primarily focus on balancing class distribution. However, they often overlook class overlap and fail to adequately consider the feature distributions of different classes. Consequently, when resampling is performed under such conditions, samples within areas of overlap remain susceptible to misclassification, failing to substantially improve overall performance. To address these shortcomings, we propose a novel data resampling technique, Nearest Neighbors and Density-based Undersampling (NDU). This method employs within-class k-nearest neighbors and between-class probability densities to design a weight assignment strategy. Leveraging this strategy, we establish an exclusive metric, the F_factor, to evaluate the importance of majority class samples in overlap areas. Subsequently, NDU promotes a gradient-based segmented undersampling strategy, which applies varying degrees of undersampling to majority class samples across segmented regions. Through experiments on binary imbalanced datasets with class overlap, we evaluate the efficiency of diverse resampling methods concerning classification performance. The results demonstrate that our proposed method effectively addresses class overlap challenges.

A fused grey wolf and artificial bee colony model for imbalanced data classification problems

A fused grey wolf and artificial bee colony model for imbalanced data classification problems

An improved random forest model for music genre classification algorithm based on sparrow search algorithm

In this study, a random forest model optimised based on the sparrow search algorithm is explored for the music genre classification problem. By introducing the sparrow search algorithm, the model is able to search the feature space more comprehensively during the training process, which improves the learning ability of complex data relationships. After 15 iterations of optimisation, the fitness value of the model is improved from 0.2002 to 0.197, showing better convergence. The performance on the training set shows that the model predicts 2,543 music genres with an accuracy of 99.59% and only 10 incorrect predictions, which verifies its excellent performance on the training data. While on the test set, the model's prediction accuracy for 623 music genres is 79.78%, which is slightly lower than the result of the training set, but still reflects good generalisation ability. The results of this paper imply that the improved random forest model based on the sparrow search algorithm has potential application prospects in the music genre classification task. By optimising the parameter settings and feature selection, we not only improve the prediction accuracy and generalisation ability of the model, but also provide new ideas for solving other complex data classification problems. In the future, we can further expand the sample size, try different feature combinations, and conduct in-depth research by combining more domain knowledge in order to further improve the model performance and promote the development of related fields.

Handwritten Digit Recognition

Handwritten digit recognition is the intelligence of computers to recognize digits written by humans. But it becomes one of the most challenging tasks for machines as handwritten digits are not perfect and can be made with many different: flavors, size, thickness. Thus, as a solution to this problem, Handwriting digit recognition model comes into picture. Many machine learning techniques have been employed to solve the handwritten digit recognition problem. This paper focuses on Neural Network (NN) approaches. Among the three famous NN approaches: deep neural network (DNN), deep belief network (DBN) and convolutional neural network (CNN), the specialization of CNN as compared to other NN of being able to detect pattern is what makes it so useful for recognizing handwritten digits. Humans can very easily see, read & write any handwritten digits, when written in proper format. Even if the digits are not written in proper format we can use our logic and predict what digit it could be. But It is a hard task for the machine to recognize handwritten digits as these are not perfect and can be made with many different flavors. Thus handwritten digit recognition is the solution to this problem which uses the image of a digit and recognizes the digit present in the image. The handwritten digit recognition is the ability of computers to recognize human handwritten digits. The goal is to build a model that can efficiently and reliably recognize the digits and output the proper result. Amongst all the other neural networks, working and implementing a model using Convolution Neural Network gives out the most precise results. It is most popularly used for analyzing images as well as for other data analysis or classification problems. CNN has hidden layers called convolutional layers. These layers work the same way as other layers do but here we need to specify the no of filters each layer should have These filters are actually what detects the pattern. Patterns could be edges, corners, circles or any complex other objects like eyes, ears or even deeper full dogs, cats, etc. Thus, the specialization of CNN as compared to other NN of being able to detect patterns is what makes it so useful for recognizing handwritten digits Key Word: Neural Networks; Convolutional Neural Networks (CNN); Image Processing; Optical Character Recognition (OCR); MNIST Dataset

Approximate complex amplitude encoding algorithm and its application to data classification problems

Approximate complex amplitude encoding algorithm and its application to data classification problems

Conditional Generative Adversarial Network for Early Classification of Longitudinal Datasets Using an Imputation Approach

Early classification of longitudinal data remains an active area of research today. The complexity of these datasets and the high rates of missing data caused by irregular sampling present data-level challenges for the Early Longitudinal Data Classification (ELDC) problem. Coupled with the algorithmic challenge of optimising the opposing objectives of early classification (i.e., earliness and accuracy), ELDC becomes a non-trivial task. Inspired by the generative power and utility of the Generative Adversarial Network (GAN), we propose a novel context-conditional, longitudinal early classifier GAN (LEC-GAN). This model utilises informative missingness, static features and earlier observations to improve the ELDC objective. It achieves this by incorporating ELDC as an auxiliary task within an imputation optimization process. Our experiments on several datasets demonstrate that LEC-GAN outperforms all relevant baselines in terms of F1 scores while increasing the earliness of prediction.

A novel automatic detection and classification algorithm for elderly cognitive impairment using CSVM

Alzheimer’s disease (AD) is a degenerative disease with insidious onset and chronic nervous system, which can be roughly classified into three stages: preclinical AD, mild cognitive impairment (MCI), and clinical AD. Given that timely treatment of MCI can delay the course of AD, identifying what stage of the disease is at the time of early diagnosis is critical in clinical practice. Based on the survey data of elderly residents in Changsha community, this paper constructs the cognitive impairment data set and explores the application of the emerging classification algorithm Convolutional Support Vector Machine(CSVM) in identifying elderly cognitive impairment, a small data classification problem. CSVM is an improved Support Vector Machine classification(SVC) algorithm, which uses the convolution filtering idea of the Convolutional Neural Networks(CNN) algorithm to preprocess the nonlinearly separable sample set to improve the classification ability of SVM. In addition, the optimal convolution filter (solution) is found by the Simplified Swarm Optimization(SSO) algorithm and orthogonal array experimental design. A variable update amplitude method is also proposed to optimize the SSO update strategy further. Aiming at the problem of an unbalanced sample set, a stratified sampling method is used to divide and cross-validate the sample data, and a variety of evaluation indicators are used to evaluate the performance of the model. Experimental results show that the data set processed by a specific convolution filter can significantly improve the classification performance of linear SVM. The accurate differentiation of normal cognition(NC), MCI, and AD helps intervene in adjuvant treatment for potential patients timely.

Deep convolutional neural networks with genetic algorithm-based synthetic minority over-sampling technique for improved imbalanced data classification

Imbalanced data classification presents a challenge in machine learning, inducing biased model learning. Moreover, data dimensionality poses another challenge as it highly impacts classifier performance. This paper proposes a new deep-learning method that combines feature selection with oversampling to address these challenges. The proposed approach, GA-SMOTE-DCNN, integrates a genetic algorithm (GA) for feature selection, SMOTE for oversampling, and a deep 1D-convolutional neural network (DCNN) for classification. This study reveals that pre-splitting the data into training and testing sets before applying SMOTE results in higher accuracy, showing an improvement in accuracy ranging between 1.94% and 3.98% compared to post-SMOTE splitting for each dataset. This method achieved accuracy rates of 86.81% for the Balance Scale dataset, 86.15% for the Oil Spill dataset, 89.21% for the Yeast dataset, 91.32% for the Mammography dataset, 88.23% for the Australian credit dataset, and 89.53% for the German Credit dataset when compared with benchmark methods, underscoring its significance in tackling high-dimensional and imbalanced data classification problems. This method demonstrates scalability in effectively addressing challenges associated with high-dimensional and imbalanced data classification across various domains.

Research on text classification based on neural networks

With the rapid development of information technology, the processing of massive text data has become increasingly important. As a common computer information processing task, text classification has attracted a wide range of research interests. This paper aims to explore the text classification method based on neural network and analyze the key technologies. In order to solve the problem of text time series data classification, this paper uses the text time series data of occupancy detection and applies these neural network models in deep learning, including recurrent neural network, long short-term memory and gated recurrent unit, and trains the neural network through supervised learning. Inputting the room attribute data to these trained neural network models and judging the occupancy of the room. At the same time, observing the experimental results of these neural network models, including training loss, test loss and accuracy, to further study the performance of neural network in processing text time series data classification. This papers experiment aims to evaluate the performance of neural network in text classification and makes a detailed analysis through the experimental results. The goal of the research is to find an effective solution based on neural networks for the classification of text sequence data. Through the analysis of the experimental results, it can be concluded that the method based on neural network is feasible and effective in text sequence data classification. These analysis results will help to further promote the development of text classification technology and provide guidance and reference for practical application.

Edge computing-based proactive control method for industrial product manufacturing quality prediction

With the emergence of intelligent manufacturing, new-generation information technologies such as big data and artificial intelligence are rapidly integrating with the manufacturing industry. One of the primary applications is to assist manufacturing plants in predicting product quality. Traditional predictive models primarily focus on establishing high-precision classification or regression models, with less emphasis on imbalanced data. This is a specific but common scenario in practical industrial environments concerning quality prediction. A SMOTE-XGboost quality prediction active control method based on joint optimization hyperparameters is proposed to address the problem of imbalanced data classification in product quality prediction. In addition, edge computing technology is introduced to address issues in industrial manufacturing, such as the large bandwidth load and resource limitations associated with traditional cloud computing models. Finally, the practicality and effectiveness of the proposed method are validated through a case study of the brake disc production line. Experimental results indicate that the proposed method outperforms other classification methods in brake disc quality prediction.

A novel classification method for GPR B-scan images based on weak-shot learning

Ground Penetrating Radar (GPR) is extensively employed for underground target detection, and the advancements in this domain have been hastened by the utilization of deep learning methodologies. Despite advancements in deep learning, practical engineering applications often face challenges in meeting the demanding requirements of large-scale data and high data quality. In this study, based on cross-domain transfer learning, we proposed a method for underground target classification of weak labeled GPR data. It combined strongly annotated source domain data with weakly annotated target domain data through adversarial learning to leverage the prior knowledge from existing large datasets and addressed the classification problem of small-sample GPR data. By employing adversarial learning to integrate strongly labeled source domain data with weakly labeled target domain data, we leverage prior knowledge from existing large datasets, thereby enhancing classification accuracy on a small GPR dataset. This approach reduces the requirements for annotation quality and sample quantity in the GPR B-scan dataset of underground targets. Additionally, it exhibits robustness to label noise, making it applicable to real-world GPR data classification tasks. Compared to some well-known networks, the proposed model achieved the best classification performance in multiclass classification problems, with an accuracy of 87.62% and an F1macro score of 87.60% on the test set. These results represent an improvement of 17.14 and 17.20 percentage points, respectively, over the best-performing classical classification networks. Additionally, the proposed model's reliability in cross-domain transfer learning, even with limited data, was substantiated through a comparison with other few-shot learning networks.

A hybrid multi-criteria meta-learner based classifier for imbalanced data

Numerous imbalanced datasets exist in modern machine learning dilemmas. Challenges of generalization and fairness stem from the existence of underrepresented classes with sensitive characteristics. Additionally, defining an optimal criterion is crucial when dealing with imbalanced data. To address this, it is common in practice to employ composite metrics and loss functions that evenly distribute the cost across each class.However, relying solely on a single metric or loss function, frequently yields sub-par outcomes due to the tendency of the optimization criteria to be overly responsive to imbalanced data, resulting in excessive adaptation and flawed generalization. In order to overcome these limitations, various heuristics can be applied to optimize the criterion.To this end, we aim at addressing the problem of imbalanced data classification by leveraging a multicriteria ensemble procedure, the Hybrid Multi-criteria Meta-learner (HML). The suggested approach focuses on optimizing precision, recall together with balanced accuracy in the Multi-Objective optimization phase and brings forth optimal ensembles, from which the concluding Meta-learner can be chosen after a clustering step, based on a multicriteria decision-making aspect contingent on the selected metrics. Comprehensive experiments portrayed the effectiveness of HML, offering both quality assurance and addresses a vast array of imbalanced data problems.

A new two-step inertial algorithm for solving convex bilevel optimization problems with application in data classification problems

<abstract><p>In this paper, we propose a new accelerated algorithm for solving convex bilevel optimization problems using some fixed point and two-step inertial techniques. Our focus is on analyzing the convergence behavior of the proposed algorithm. We establish a strong convergence theorem for our algorithm under some control conditions. To demonstrate the effectiveness of our algorithm, we utilize it as a machine learning algorithm to solve data classification problems of some noncommunicable diseases, and compare its efficacy with BiG-SAM and iBiG-SAM.</p></abstract>

Support Matrix Machine via Joint l2,1 and Nuclear Norm Minimization Under Matrix Completion Framework for Classification of Corrupted Data.

Traditional support vector machines (SVMs) are fragile in the presence of outliers; even a single corrupt data point can arbitrarily alter the quality of the approximation. If even a small fraction of columns is corrupted, then classification performance will inevitably deteriorate. This article considers the problem of high-dimensional data classification, where a number of the columns are arbitrarily corrupted. An efficient Support Matrix Machine that simultaneously performs matrix Recovery (SSMRe) is proposed, i.e. feature selection and classification through joint minimization of l2,1 (the nuclear norm of L ). The data are assumed to consist of a low-rank clean matrix plus a sparse noisy matrix. SSMRe works under incoherence and ambiguity conditions and is able to recover an intrinsic matrix of higher rank in the presence of data densely corrupted. The objective function is a spectral extension of the conventional elastic net; it combines the property of matrix recovery along with low rank and joint sparsity to deal with complex high-dimensional noisy data. Furthermore, SSMRe leverages structural information, as well as the intrinsic structure of data, avoiding the inevitable upper bound. Experimental results on different real-time applications, supported by the theoretical analysis and statistical testing, show significant gain for BCI, face recognition, and person identification datasets, especially in the presence of outliers, while preserving a reasonable number of support vectors.

Using machine learning algorithms to solve data classification problems using multi-attribute dataset

This paper discusses various machine learning techniques such as decision trees, Kohonen maps neural network method, and correlation analysis. The training of neural networks and further comparative analysis was carried out using a real estate price segment classification dataset. The overall quality of the data collected in the dataset was evaluated using the correlation analysis method, while the other methods were used to predict the target variable. The obtained data were summarized in a comparative table. As a result of the work done, a relatively high accuracy was obtained using a large number of parameters in the work of almost all methods, the only exception is the neural network method, which does not work very correctly in the selected software product

KARMA VERİ İKİLİLEŞTİRME YÖNTEMİ İLE YENİ BİR RASYONEL SINIFLANDIRMA YAKLAŞIMI

Classification algorithm is a supervised learning technique that is used to identify the category of new observations. However, in some cases, quantitative and qualitative data must be used together. With this approach, we tried to overcome the problems encountered in using quantitative and qualitative data together. In this paper, we model a new classification technique by converting all types of data to binary data because in real world, data are classified in different types such as binary, numeric or categorical. By this way, we develop a more accurate and efficient mixed data binarization approach for multi-attribute data classification problems. First, we determine the classes from available dataset and then we classify the new instances into these predetermined classes by using the new proposed data binarization approach. We show how each step of this algorithm could be performed efficiently with a numeric example. Then, we apply the proposed approach on a well-known iris dataset and our model show promising results and improvements over previous approaches.