Artificial intelligence modeling and experimental studies of oily pollutants uptake from water using ZIF-8/carbon fiber nanostructure

In this study, the experimental and modeling of oily pollutants (crude oil, asphaltene, and maltene) uptake by ZIF-8/carbon fiber nanostructure was investigated. The influence of pollutant type, concentration, ionic strength, and sorption time on uptake was systematically examined using a batch absorption system. Then, the experimental data of uptake was modeled using cascade forward (CFNN), multi-layer perceptron (MLP), radial basis function (RBF), and generalized regression (GRNN) neural networks. ZIF-8/carbon fiber nanostructure distinguished by its high hydrophobicity (WCA of 150°) and a complex meso-micro pore structure, demonstrated remarkable efficiency in oil pollutant uptake. Furthermore, the modeling results unveiled that the CFNN-LM model yielded superior predictions, achieving an impressive accuracy rate, as approximately 98% of the uptake data demonstrated an average absolute percent relative error (AAPRE,%) below 3%. Moreover, sensitivity analysis showed that the concentration of pollutants had the most notable impact on the pollutant uptake. Furthermore, the uptake values exhibited an upward trend with elevated concentrations of the pollutant and extended process time, while showing a decline with an increase in ionic strength. These results affirm the reliability of the proposed CFNN-LM model in accurately estimating uptake amounts during the separation process. In summary, the ZIF-8/carbon fiber nanostructure stands out as a highly promising remedy for eliminating oil pollutants from oil/water mixtures, with the added benefit of accurate uptake predictions facilitated by the CFNN-LM model.

Music Waveform Analysis Based on SOM Neural Network and Big Data

Music is an indispensable part of our life and study and is one of the most important forms of multimedia applications. With the development of deep learning and neural network in recent years, how to use cutting-edge technology to study and apply music has become a research hotspot. Music waveform is not only the main form of music frequency but also the basis of music feature extraction. This paper first designs a method of note extraction based on the fast Fourier transform principle of the audio signal packet route under the self-organizing map (SOM neural network) which can accurately extract the musical features of the note, such as amplitude, loudness, period, and so on. Secondly, the audio segments are divided into summary by adding window moving matching method, and the music features such as amplitude, loudness, and period of each bar are obtained according to the performance of audio signal in each bar. Finally, according to the similarity of the audio music theory of the adjacent summary of each bar, the audio segments are divided, and the music features of each segment are obtained. The traditional recurrent neural network (RNN) is improved, and the SOM neural network is used to recognize the audio emotion features. The final experimental results show that the proposed method based on SOM neural network and big data can effectively extract and analyze music waveform features. Compared with previous studies, this paper creatively proposed a new algorithm, which can more accurately and quickly extract and analyze the data sound waveform, and used SOM neural network to analyze the emotion model contained in music for the first time.

A Fuzzy Radial Basis Adaptive Inference Network and Its Application to Time-Varying Signal Classification

A fuzzy radial basis adaptive inference network (FRBAIN) is proposed for multichannel time-varying signal fusion analysis and feature knowledge embedding. The model which combines the prior signal feature embedding mechanism of the radial basis kernel function with the rule-based logic inference ability of fuzzy system is composed of a multichannel time-varying signal input layer, a radial basis fuzzification layer, a rule layer, a regularization layer, and a T-S fuzzy classifier layer. The dynamic fuzzy clustering algorithm was used to divide the sample set pattern class into several subclasses with similar features. The fuzzy radial basis neurons (FRBNs) were defined and used as parameterized membership functions, and typical feature samples of each pattern subclass were used as kernel centers of the FRBN to realize the embedding of the diverse prior feature knowledge and the fuzzification of the input signals. According to the signal categories of FRBN kernel centers, nodes in the rule layer were selectively connected with nodes in the FRBN layer. A fuzzy multiplication operation was used to achieve synthesis of pattern class membership information and establishment of fuzzy inference rules. The excitation intensity of each rule was used as the input of T-S fuzzy classifier to classify the input signals. The FRBAIN can adaptively establish fuzzy set membership functions, fuzzy inference, and classification rules based on the learning of sample set, realize structural and data constraints of the model, and improve the modeling properties of imbalanced datasets. In this paper, the properties of FRBAIN were analyzed and a comprehensive learning algorithm was established. Experimental validation was performed with classification diagnoses from four complex cardiovascular diseases based on 12-lead ECG signals. Results demonstrated that, in the case of small-scale imbalanced datasets, the proposed method significantly improved both classification accuracy and generalizability comparing with other methods in the experiment.

Development of Quantum Local Potential Function Networks Based on Quantum Assimilation and Subspace Division

The centers and radii of radial basis functions (RBFs) greatly affect the approximation capability of RBF networks (RBFNs). Traditional statistics-based approaches are widely used, but they may lack adaptivity to different data structures. Quantum clustering (QC), derived from quantum mechanics and the Schrödinger equation, demonstrates excellent capability in finding the structure and conformity toward data distribution. In this paper, a novel neural networks model called quantum local potential function networks (QLPFNs) is proposed. The QLPFN inherits the outstanding properties of QC by constructing the waves and the potential functions, and the level of data concentration can be discovered to obtain the inherent structures of the given data set. The local potential functions form the basic components of the QLPFN structure, which are automatically generated from the subsets of training data following specific subspace division procedures. Therefore, the QLPFN model in fact incorporates the level of data concentration as a computation technique, which is different from the classical RBFN model that exhibits radial symmetry toward specific centers. Some application examples are given in this paper to show the effectiveness of the QLPFN model.

A Structure-Adaptive Hybrid RBF-BP Classifier with an Optimized Learning Strategy

This paper presents a structure-adaptive hybrid RBF-BP (SAHRBF-BP) classifier with an optimized learning strategy. SAHRBF-BP is composed of a structure-adaptive RBF network and a BP network of cascade, where the number of RBF hidden nodes is adjusted adaptively according to the distribution of sample space, the adaptive RBF network is used for nonlinear kernel mapping and the BP network is used for nonlinear classification. The optimized learning strategy is as follows: firstly, a potential function is introduced into training sample space to adaptively determine the number of initial RBF hidden nodes and node parameters, and a form of heterogeneous samples repulsive force is designed to further optimize each generated RBF hidden node parameters, the optimized structure-adaptive RBF network is used for adaptively nonlinear mapping the sample space; then, according to the number of adaptively generated RBF hidden nodes, the number of subsequent BP input nodes can be determined, and the overall SAHRBF-BP classifier is built up; finally, different training sample sets are used to train the BP network parameters in SAHRBF-BP. Compared with other algorithms applied to different data sets, experiments show the superiority of SAHRBF-BP. Especially on most low dimensional and large number of data sets, the classification performance of SAHRBF-BP outperforms other training SLFNs algorithms.

Function approximation using combined unsupervised and supervised learning

Function approximation is one of the core tasks that are solved using neural networks in the context of many engineering problems. However, good approximation results need good sampling of the data space, which usually requires exponentially increasing volume of data as the dimensionality of the data increases. At the same time, often the high-dimensional data is arranged around a much lower dimensional manifold. Here we propose the breaking of the function approximation task for high-dimensional data into two steps: (1) the mapping of the high-dimensional data onto a lower dimensional space corresponding to the manifold on which the data resides and (2) the approximation of the function using the mapped lower dimensional data. We use over-complete self-organizing maps (SOMs) for the mapping through unsupervised learning, and single hidden layer neural networks for the function approximation through supervised learning. We also extend the two-step procedure by considering support vector machines and Bayesian SOMs for the determination of the best parameters for the nonlinear neurons in the hidden layer of the neural networks used for the function approximation. We compare the approximation performance of the proposed neural networks using a set of functions and show that indeed the neural networks using combined unsupervised and supervised learning outperform in most cases the neural networks that learn the function approximation using the original high-dimensional data.

Using Radial Basis Function Networks for Function Approximation and Classification

The radial basis function (RBF) network has its foundation in the conventional approximation theory. It has the capability of universal approximation. The RBF network is a popular alternative to the well-known multilayer perceptron (MLP), since it has a simpler structure and a much faster training process. In this paper, we give a comprehensive survey on the RBF network and its learning. Many aspects associated with the RBF network, such as network structure, universal approimation capability, radial basis functions, RBF network learning, structure optimization, normalized RBF networks, application to dynamic system modeling, and nonlinear complex-valued signal processing, are described. We also compare the features and capability of the two models.

Modeling Multivariate Time Series on Manifolds with Skew Radial Basis Functions

We present an approach for constructing nonlinear empirical mappings from high-dimensional domains to multivariate ranges. We employ radial basis functions and skew radial basis functions for constructing a model using data that are potentially scattered or sparse. The algorithm progresses iteratively, adding a new function at each step to refine the model. The placement of the functions is driven by a statistical hypothesis test that accounts for correlation in the multivariate range variables. The test is applied on training and validation data and reveals nonstatistical or geometric structure when it fails. At each step, the added function is fit to data contained in a spatiotemporally defined local region to determine the parameters—in particular, the scale of the local model. The scale of the function is determined by the zero crossings of the autocorrelation function of the residuals. The model parameters and the number of basis functions are determined automatically from the given data, and there is no need to initialize any ad hoc parameters save for the selection of the skew radial basis functions. Compactly supported skew radial basis functions are employed to improve model accuracy, order, and convergence properties. The extension of the algorithm to higher-dimensional ranges produces reduced-order models by exploiting the existence of correlation in the range variable data. Structure is tested not just in a single time series but between all pairs of time series. We illustrate the new methodologies using several illustrative problems, including modeling data on manifolds and the prediction of chaotic time series.

Reformulated radial basis neural networks trained by gradient descent

This paper presents an axiomatic approach for constructing radial basis function (RBF) neural networks. This approach results in a broad variety of admissible RBF models, including those employing Gaussian RBF's. The form of the RBF's is determined by a generator function. New RBF models can be developed according to the proposed approach by selecting generator functions other than exponential ones, which lead to Gaussian RBF's. This paper also proposes a supervised learning algorithm based on gradient descent for training reformulated RBF neural networks constructed using the proposed approach. A sensitivity analysis of the proposed algorithm relates the properties of RBF's with the convergence of gradient descent learning. Experiments involving a variety of reformulated RBF networks generated by linear and exponential generator functions indicate that gradient descent learning is simple, easily implementable, and produces RBF networks that perform considerably better than conventional RBF models trained by existing algorithms.

Prediction of influenza vaccination outcome by neural networks and logistic regression

The major challenge in influenza vaccination is to predict vaccine efficacy. The purpose of this study was to design a model to enable successful prediction of the outcome of influenza vaccination based on real historical medical data. A non-linear neural network approach was used, and its performance compared to logistic regression. The three neural network algorithms were tested: multilayer perceptron, radial basis and probabilistic in conjunction with parameter optimization and regularization techniques in order to create an influenza vaccination model that could be used for prediction purposes in the medical practice of primary health care physicians, where the vaccine is usually dispensed. The selection of input variables was based on a model of the vaccine strain which has frequently been changed and on which a poor influenza vaccine response is expected. The performance of models was measured by the average hit rate of negative and positive vaccine outcome. In order to test the generalization ability of the models, a 10-fold cross-validation procedure revealed that the model obtained by multilayer perceptron produced the highest average hit rate among neural network algorithms, and also outperformed the logistic regression model with regard to sensitivity and specificity. Sensitivity analysis was performed on the best model and the importance of input variables was discussed. Further research should focus on improving the performance of the model by combining neural networks with other intelligent methods in this field.

Using unsupervised analysis to constrain generalization bounds for support vector classifiers

A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generalization bounds can prove effective, provided that they are tight and track the validation error correctly. The maximal discrepancy (MD) approach is a very promising technique for model selection for support vector machines (SVM), and estimates a classifier's generalization performance by multiple training cycles on random labeled data. This paper presents a general method to compute the generalization bounds for SVMs, which is based on referring the SVM parameters to an unsupervised solution, and shows that such an approach yields tight bounds and attains effective model selection. When one estimates the generalization error, one uses an unsupervised reference to constrain the complexity of the learning machine, thereby possibly decreasing sharply the number of admissible hypothesis. Although the methodology has a general value, the method described in the paper adopts vector quantization (VQ) as a representation paradigm, and introduces a biased regularization approach in bound computation and learning. Experimental results validate the proposed method on complex real-world data sets.

Research on an online self-organizing radial basis function neural network

A new growing and pruning algorithm is proposed for radial basis function (RBF) neural network structure design in this paper, which is named as self-organizing RBF (SORBF). The structure of the RBF neural network is introduced in this paper first, and then the growing and pruning algorithm is used to design the structure of the RBF neural network automatically. The growing and pruning approach is based on the radius of the receptive field of the RBF nodes. Meanwhile, the parameters adjusting algorithms are proposed for the whole RBF neural network. The performance of the proposed method is evaluated through functions approximation and dynamic system identification. Then, the method is used to capture the biochemical oxygen demand (BOD) concentration in a wastewater treatment system. Experimental results show that the proposed method is efficient for network structure optimization, and it achieves better performance than some of the existing algorithms.

Representation and generalization properties of class-entropy networks

Using conditional class entropy (CCE) as a cost function allows feedforward networks to fully exploit classification-relevant information. CCE-based networks arrange the data space into partitions, which are assigned unambiguous symbols and are labeled by class information. By this labeling mechanism the network can model the empirical data distribution at the local level. Region labeling evolves with the network-training process, which follows a plastic algorithm. The paper proves several theoretical properties about the performance of CCE-based networks, and considers both convergence during training and generalization ability at run-time. In addition, analytical criteria and practical procedures are proposed to enhance the generalization performance of the trained networks. Experiments on artificial and real-world domains confirm the accuracy of this class of networks and witness the validity of the described methods.

Function approximation--a fast-convergence neural approach based on spectral analysis

We propose a constructive approach to building single-hidden-layer neural networks for nonlinear function approximation using frequency domain analysis. We introduce a spectrum-based learning procedure that minimizes the difference between the spectrum of the training data and the spectrum of the network's estimates. The network is built up incrementally during training and automatically determines the appropriate number of hidden units. This technique achieves similar or better approximation with faster convergence times than traditional techniques such as backpropagation.

Training reformulated radial basis function neural networks capable of identifying uncertainty in data classification

This paper introduces a learning algorithm that can be used for training reformulated radial basis function neural networks (RBFNNs) capable of identifying uncertainty in data classification. This learning algorithm trains a special class of reformulated RBFNNs, known as cosine RBFNNs, by updating selected adjustable parameters to minimize the class-conditional variances at the outputs of their radial basis functions (RBFs). The experiments verify that quantum neural networks (QNNs) and cosine RBFNNs trained by the proposed learning algorithm are capable of identifying uncertainty in data classification, a property that is not shared by cosine RBFNNs trained by the original learning algorithm and conventional feed-forward neural networks (FFNNs). Finally, this study leads to a simple classification strategy that can be used to improve the classification accuracy of QNNs and cosine RBFNNs by rejecting ambiguous feature vectors based on their responses.