The Fractional Differential Polynomial Neural Network for Approximation of Functions

In this work, we introduce a generalization of the differential polynomial neural network utilizing fractional calculus. Fractional calculus is taken in the sense of the Caputo differential operator. It approximates a multi-parametric function with particular polynomials characterizing its functional output as a generalization of input patterns. This method can be employed on data to describe modelling of complex systems. Furthermore, the total information is calculated by using the fractional Poisson process.


Introduction
The Polynomial Neural Network (PNN) algorithm is one of the most important methods for extracting knowledge from experimental data and to locate its best mathematical characterization.The proposed algorithm can be utilized to analyze complex data sets with the objective to conclude internal data relationships and to impose knowledge about these relationships in the form of mathematical formulations (polynomial regressions).One of the most common types of PNN is the Group Method of Data Handling (GMDH) polynomial neural network created in 1968 by Professor Ivakhnenko at the Institute of Cybernetics in Kyiv (Ukraine).
Based on GMDH, Zjavka developed a new type of neural network called Differential Polynomial Neural Network (D-PNN) [1][2][3][4].It organizes and designs some special partial differential equations, performing a complex system model of dependent variables.It makes a sum of fractional polynomial formulas, determining partial mutual derivative alterations of input variable combinations.This kind of

OPEN ACCESS
retreatment is based on learning generalized data connections.Furthermore, it offers dynamic system models a standard time-series prediction, as the character of relative data allow it to employ a wider range of input interval values than defined by the trained data.In addition, the advantages of differential equation solutions facilitate a major variety of model styles.The principle of this type is similar to the artificial neural network (ANN) construction [5,6].
Fractional calculus is a section of mathematical analysis that deals with considering real number powers or complex number powers of the differentiation and integration operators.The integrals are of convoluted form and exhibit power-law type kernels.It can be viewed as an experimenter for special functions and integral transforms [7][8][9][10][11][12].It is well known that the physical interview of the fractional derivative is an open problem today.In [13], the author utilized fractional operators, in the sense of the Caputo differential operator, to define and study the stability of recurrent neural network (NN).In [14], Gardner employed a discrete fractional calculus to study Artificial Neural Network Augmentation.In [15], Almarashi used neural networks with a radial basis function method to solve a class of initial boundary values of fractional partial differential equations.Recently, Jalab et al., applied the neural network method for finding the numerical solution for some special fractional differential equations [16].Zhou et al. propoced a fractional time-domain identification algorithm based on a genetic algorithm [17], while Chen et al. studied the synchronization problem for a class of fractional-order chaotic neural networks [18].
Here, our aim is to introduce a generalization of the differential polynomial neural network utilizing fractional calculus.The fractional calculus is assumed in the sense of the Caputo differential operator.It approximates a multi-parametric function with particular polynomials characterizing its functional output as a generalization of input patterns.This method can be employed on data to describe modelling of complex systems [19].

Preliminaries
This section concerns with some basic preliminaries and notations regarding the fractional calculus.One of the most considerably utilized instruments in the theory of fractional calculus is provided by the Caputo differential operator.
Definition 2.1 The fractional (arbitrary) order integral of the function of order 0 is defined by: When 0, we write , where denoted the convolution product (see [7]), , 0 and 0, 0 and as 0 where is the delta function.

Definition 2.2
The Riemann-Liouville fractional derivative of the function of order 0 1 is defined by: and: The Leibniz rule is: .
Definition 2.3.The Caputo fractional derivative fractional derivative of order β>0 is defined, for a smooth function f by: (6) The local fractional Taylor formula has been generalized by many authors [20][21][22].This generalization admits the following formula: where c x D  is the Caputo differential operator and: ...

Proposed Method
The fractional differential polynomial neural network (FD-PNN) is based on an equation of the form: where : , , . . ., is a function of all input variables, , , , are the polynomial coefficients.Solutions of fractional differential equations can be expressed in term of the Mittag-Leffler function: . ) ( Recently, numerical routines for Mittag-Leffler functions have been developed, e.g., by Freed et al. [23], Gorenflo et al. [24] (with MATHEMATICA), Podlubny [25] (with MATLAB), Seybold and Hilfer [26].
We proceed to form sum derivative terms changing the fractional partial differential equation ( 9) by applying different math techniques, e.g.fractional wave series, [27]: where refers to the combined degree of input variable polynomial of numerator; while indicates to the combined degree of denominator -weights of terms and is the output neuron.
Note that when 1, Equation ( 11) reduces to Equation ( 4) in [4].The fractional polynomials of fractional power (11), determining relations of -input variables, appear summation derivative terms (neurons) of a fractional differential equation.The numerator of Equation ( 11) is a complete -variable polynomial, which recognizes a new partial function of Equation ( 9).The denominator of Equation ( 11) is a fractional derivative part, which implies a fractional partial change of some input variables combination.Equation ( 11) indicates a aingle output for fixed fractional power.Each layer of the FD-PNN contains blocks.These blocks stress fractional derivative neurons.For each fractional polynomial of fractional order formulates the fractional partial derivative depending on the change of some input variables.Each block implicates a unique fractional polynomial which forms its output access into the next hidden layer (Figure 1).For example of a system of the form : input layer, first hidden layer, second hidden layer and output layer; we may use y 1 1/4 to perform its output to the first layer; y 2 1/2 to execute its output to the second hidden layer and y 3 3/4 to carry out the last y of the system in the output layer.Let there be a network with two inputs, formulating one functional output value , then, for special values of , the sum derivative terms is: we realize that includes only one block of two neurons, terms of both fractional derivative variables and .Table 1 shows approximation errors (y-axis) of the trained network, i.e. differences of the true and estimated function, to random input vectors with dependent variables.We proceed to compute approximations for non-linear functions.We let : , be a function with square power variables, then we have: For example, for 1, we get [4]: In general, for fractional power , we have: For example:

Modified Information Theory
In this section, we try to measure the learning of the neuron of the system in Figure 1.We wish to improve a applicable measure of the information we get from observing the appearance of an event having probability p.The approach depends on the probability of extinction, which describes by the fractional Poisson process as follows [28]: where σ R is a physical coefficient, β (0,1].Let N be the number of neurons, I be the average information and further that the source emits the symbols with probabilities P 1 , P 2 , ... , P N , respectively such that P i =P β (i,y).Thus we may compute the total information as follows: The last assertion is modified work due to Shannon [29].For example, to compute the average information of the system with N=3, for the last fractional derivative in Table 3, we have: where P i converged to a hypergeometric function, which computed with the help of Maple.

Discussion
The presented 2-variable FD-PNN (Table 1) is able to approximate any linear function, e.g., the simple sum , .The comparison processes with respect to D-PNN (normal case) showed that the proposed method converged to the exact values rapidly.For example, the case (1,1) implied ABE=0.01 at / .In this experiment, we let 1, 1. Figure 2 shows the approximation of the fractional derivative for the function , .The x-axis represents to the values when .It is clear that the interval of convergence is 0.2,1 .The endowed 3-variable FD-PNN (Table 2) is qualified to approximate any linear function e.g.simple sum , , .The comparison procedure with respect to D-PNN displayed that the proposed method, of 3-variables, is converged swiftly to the exact values.For example, the case (1,1,0), with 3/2 and (1,1,1), with 1 yield ABE=0.063 and 0.0755 respectively at / .Furthermore, Figure 3 shows the interval of convergence at 0.3,1 .Here, we let x 1 = x 2 = x 3 .Comparable argument can be concluded from the non-linear case, where Table 3 computes approximation values, by utilizing FD-PNN.For example, the data (1,1) give the best approximation at / when 1.5.In Figure 4, the x-axis performs to the value when .Obviously, the interval of convergence is [0.4,2].

Conclusions
Based on GMDH-PNN (Figure 1) and modifying the work described in [4], we suggested a generalized D-PNN, called FD-PNN.The experimental results showed that the proposed method satisfies a quick approximation to the exact value comparison with the normal method.The generalization depended on the Riemann-Liouville differential operator.This method can be employed on data to describe modelling of complex systems.Next step, our aim is to modify this work by utilizing mixed D-PNN and FD-PNN, e.g. one can consider a function of the form:

Table 3 .
The approximation errors for , .