Extension neural network
Extension neural network is a pattern recognition method found by M.
≈ 4 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Extension neural network is a pattern recognition method found by M. H. Wang and C. P. Hung in 2003 to classify instances of data sets. Extension neural network is composed of artificial neural network and extension theory concepts.
It uses the fast and adaptive learning capability of neural network and correlation estimation property of extension theory by calculating extension distance. ENN was used in: * Failure detection in machinery. * Tissue classification through MRI. * Fault recognition in automotive engine. * State of charge estimation in lead-acid battery. * Classification with incomplete survey data.
Extension neural network is a pattern recognition method found by M. H. Wang and C. P. Hung in 2003 to classify instances of data sets. Extension neural network is composed of artificial neural network and extension theory concepts.
It uses the fast and adaptive learning capability of neural network and correlation estimation property of extension theory by calculating extension distance. ENN was used in: Failure detection in machinery. Tissue classification through MRI.
Fault recognition in automotive engine. State of charge estimation in lead-acid battery. Classification with incomplete survey data.
K(x)= \begin{cases} -\rho(x,X_{in}) &x\in{X_{in}} \\ \frac{\rho(x,X_{in})}{\rho(x,X_{out})-\rho(x,X_{in})} &x\not \in{X_{in}} \end{cases} | }} ED_{ik}=\sum\limits_{j=0}^n \left( \frac +1 \right) k=1,2,....,n_c | }} Estimated class is found through searching for the minimum extension distance among the calculated extension distance for all classes as summarized in equation 7, where k^* is the estimated class. w_{kj}^U = \max_i\{x_{ij}^k\} w_{kj}^L = \min_i\{x_{ij}^k\} i=1,...,N_p k=1,...,n_c j=1,2,....,n | }} where, i is the instance number and j is represents number of input. This initialization provides classes' ranges according to given training data.
After maintaining weights, center of clusters are found through the equation 9. {{NumBlk|:| Z_k = \{z_{k1},z_{k2},...,z_{kn}\} z_{kj} = \frac{w_{kj}^U+w_{kj}^L}{2} k=1,2,....,n_c j=1,2,....,n | }} Before learning process begins, predefined learning performance rate is given as shown in equation 10 where, N_m is the misclassified instances and N_p is the total number of instances. Initialized parameters are used to classify instances with using equation 6.
If the initialization is not sufficient due to the learning performance rate, training is required. In the training step weights are adjusted to classify training data more accurately, therefore reducing learning performance rate is aimed. In each iteration, E_\tau is checked to control if required learning performance is reached.
In each iteration every training instance is used for training. Instance i , belongs to class p is shown by: X_{i}^p=\{x_{i1}^p,x_{i2}^p,...,x_{in}^p\} 1\leq p\leq n_c Every input data point of X_i^p is used in extension distance calculation to estimate the class of X_i^p . If the estimated class k^*=p then update is not needed. Whereas, if k^* \neq p then update is done.
In update case, separators which show the relationship between inputs and classes, are shifted proportional to the distance between the center of clusters and the data points. The update formula: z_{pj}^{new} = z_{pj}^{old} + \eta (x_{ij}^p-z_{pj}^{old}) z_{k^*j}^{new} = z_{k^*j}^{old} - \eta (x_{ij}^p-z_{k^*j}^{old}) w_{pj}^{L(new)} = w_{pj}^{L(old)} + \eta (x_{ij}^p-z_{pj}^{old}) w_{pj}^{U(new)} = w_{pj}^{U(old)} + \eta (x_{ij}^p-z_{pj}^{old}) w_{k^*j}^{L(new)} = w_{k^*j}^{L(old)} - \eta (x_{ij}^p-z_{k^*j}^{old}) w_{k^*j}^{U(new)} = w_{k^*j}^{U(old)} - \eta (x_{ij}^p-z_{k^*j}^{old}) To classify the instance i accurately, separator of class p for input j moves close to data-point of instance i , whereas separator of class k^* for input j moves far away.
In the above image, an update example is given. Assume that instance i belongs to class A, whereas it is classified to class B because extension distance calculation gives out ED_A>ED_B . After the update, separator of class A moves close to the data-point of instance i whereas separator of class B moves far away.
Consequently, extension distance gives out ED_B>ED_A , therefore after update instance i is classified to class A.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1310896653 under CC BY-SA 4.0; modifications have been made.