Nonlinear Data Classification Research Articles

Quantum-enhanced learning with a controllable bosonic variational sensor network

Abstract The emergence of quantum sensor networks has presented opportunities for enhancing complex sensing tasks, while simultaneously introducing significant challenges in designing and analyzing quantum sensing protocols due to the intricate nature of entanglement and physical processes. Supervised learning assisted by an entangled sensor network (SLAEN) (Zhuang and Zhang 2019 Phys. Rev. X 9 041023) represents a promising paradigm for automating sensor-network design through variational quantum machine learning. However, the original SLAEN, constrained by the Gaussian nature of quantum circuits, is limited to learning linearly separable data. Leveraging the universal quantum control available in cavity quantum electrodynamics experiments, we propose a generalized SLAEN capable of handling nonlinear data classification tasks. We establish a theoretical framework for physical-layer data classification to underpin our approach. Through training quantum probes and measurements, we uncover a threshold phenomenon in classification error across various tasks—when the energy of probes exceeds a certain threshold, the error drastically diminishes to zero, providing a significant improvement over the Gaussian SLAEN. Despite the non-Gaussian nature of the problem, we offer analytical insights into determining the threshold and residual error in the presence of noise. Our findings carry implications for radio-frequency photonic sensors and microwave dark matter haloscopes.

Analysis of Cross Validation on Classification of Mangosteen Maturity Stages using Support Vector Machine

This study explores the efficacy of the Support Vector Machine (SVM) method in classifying mangosteen fruit images based on six ripeness levels. Employing SVM enables nonlinear data classification and simultaneous utilization of multiple feature extractions, resulting in enhanced accuracy. Analysis reveals that models integrating three feature extractions outperform those with only two. With ample training data and optimized parameters, SVM achieves detection accuracy exceeding 90%. However, algorithmic enhancements are necessary to compute RGB color index values for all pixels on mangosteen skin surfaces, possibly through circular-shaped windows approximating the fruit's contour. Moreover, comparative assessments of RGB color system calculations against alternative systems such as HSI are crucial for selecting the most suitable color model in alignment with human perception.

An Advanced Decision Tree-Based Deep Neural Network in Nonlinear Data Classification

Deep neural networks (DNNs), the integration of neural networks (NNs) and deep learning (DL), have proven highly efficient in executing numerous complex tasks, such as data and image classification. Because the multilayer in a nonlinearly separable data structure is not transparent, it is critical to develop a specific data classification model from a new and unexpected dataset. In this paper, we propose a novel approach using the concepts of DNN and decision tree (DT) for classifying nonlinear data. We first developed a decision tree-based neural network (DTBNN) model. Next, we extend our model to a decision tree-based deep neural network (DTBDNN), in which the multiple hidden layers in DNN are utilized. Using DNN, the DTBDNN model achieved higher accuracy compared to the related and relevant approaches. Our proposal achieves the optimal trainable weights and bias to build an efficient model for nonlinear data classification by combining the benefits of DT and NN. By conducting in-depth performance evaluations, we demonstrate the effectiveness and feasibility of the proposal by achieving good accuracy over different datasets.

Iteratively Divide-and-Conquer Learning for Nonlinear Classification and Ranking

Nonlinear classifiers (i.e., kernel support vector machines (SVMs)) are effective for nonlinear data classification. However, nonlinear classifiers are usually prohibitively expensive when dealing with large nonlinear data. Ensembles of linear classifiers have been proposed to address this inefficiency, which is called the ensemble linear classifiers for nonlinear data problem. In this article, a new iterative learning approach is introduced that involves two steps at each iteration: partitioning the data into clusters according to Gaussian mixture models with local consistency and then training basic classifiers (i.e., linear SVMs) for each cluster. The two divide-and-conquer steps are combined into a graphical model. Meanwhile, with training, each classifier is regarded as a task; clustered multitask learning is employed to capture the relatedness among different tasks and avoid overfitting in each task. In addition, two novel extensions are introduced based on the proposed approach. First, the approach is extended for quality-aware web data classification. In this problem, the types of web data vary in terms of information quality. The ignorance of the variations of information quality of web data leads to poor classification models. The proposed approach can effectively integrate quality-aware factors into web data classification. Second, the approach is extended for listwise learning to rank to construct an ensemble of linear ranking models, whereas most existing listwise ranking methods construct a solely linear ranking model. Experimental results on benchmark datasets show that our approach outperforms state-of-the-art algorithms. During prediction for nonlinear classification, it also obtains comparable classification performance to kernel SVMs, with much higher efficiency.

An improved harmony search-based functional link higher order ANN for nonlinear data classification

An improved harmony search-based functional link higher order ANN for nonlinear data classification

An improved harmony search-based functional link higher order ANN for nonlinear data classification

To obtain the optimal set of weights in any higher order artificial neural network, it is often laborious to adjust the set of weights by using appropriate learning algorithm. In this paper, an improved variant of harmony search (HS), called improved harmony search (IHS) along with gradient descent learning (GDL) is used with functional link artificial neural network (FLANN) for the task of classification in data mining. IHS performs better than HS by eliminating constant parameters [bandwidth (bw), pitch adjustment rate (PAR)] in HS algorithm and incorporating changes dynamically in PAR and bw with iteration. The searching capability of IHS to obtain optimal harmony is used along with GDL to discover optimal set of weights for FLANN model. The proposed IHS-GDL-FLANN is implemented in MATLAB and compared with other alternatives. In order to get statistical correctness of results, the proposed method is analysed by using various statistical analysis under null-hypothesis.

A self adaptive harmony search based functional link higher order ANN for non-linear data classification

In the data classification process involving higher order ANNs, it’s a herculean task to determine the optimal ANN classification model due to non-linear nature of real world datasets. To add to the woe, it is tedious to adjust the set of weights of ANNs by using appropriate learning algorithm to obtain better classification accuracy. In this paper, an improved variant of harmony search (HS), called self-adaptive harmony search (SAHS) along with gradient descent learning is used with functional link artificial neural network (FLANN) for the task of classification in data mining. Using its past experiences, SAHS adjusts the harmonies according to the maximum and minimum values in the current harmony memory. The powerful combination of this unique strategy of SAHS and searching capabilities of gradient descent search is used to obtain optimal set of weights for FLANN. The proposed method (SAHS–FLANN) is implemented in MATLAB and the results are contrasted with other alternatives (FLANN, GA based FLANN, PSO based FLANN, HS based FLANN, improved HS based FLANN and TLBO based FLANN). To illustrate its effectiveness, SAHS–FLANN is tested on various benchmark datasets from UCI machine learning repository by using 5-fold cross validation technique. Under the null-hypothesis, the proposed method is analyzed by using various statistical tests for statistical correctness of results. The performance of the SAHS–FLANN is found to be better and statistically significant in comparison with other alternatives. The SAHS–FLANN differs from HS–FLANN (HS based FLANN) by the elimination of constant parameters (bandwidth and pitch adjustment rate). Furthermore, it leads to the simplification of steps for the improvisation of weight-sets in IHS–FLANN (improved HS based FLANN) by incorporating adjustments of new weight-sets according to the weight-sets with maximum and minimum fitness.