ICANN ’93 pp 1021-1021 | Cite as

Minimum Distance Pattern Classifiers Based On A New Distance Metric

  • N. Gaitanis
  • G. Kapogianopoulos
  • D. A. Karras
Conference paper

Abstract

A method for the design of minimum distance bipolar pattern classifiers based on a new distance metric between the bipolar patterns is described. The new distance metric is defined and its properties are demonstrated. Neural Networks with the Nearest-neighbor recall mechanism [2], trained according to this method, distinguish the images of a prototype pattern X kfrom the images of the opponent prototype functions X q, taking into account not only the erroneous pattern elements but also their distinguishing ability. A Neural pattern classifier can be defined by R linear discriminant functions [1] {F 1(X),..,FR(X)} with \(F_k(X)=X*W^k=x_1*W^k_1+x_2*W^k_2+...+x_n*W^k_n\) where, x i are bipolar variables \(F_k(X)=X*W^k=x_1*W^k_1+x_2*W^k_2+...+x_n*W^k_n\) and the weights W i k are real numbers and -1 ≤ W i k ≤ +1. In the proposed neural net architecture, the discriminant function F k(X) is then, followed by an output function T k (F) defined as
$$T_k(F) = \begin{cases} 1, & \textup{if} F_k(\textup{X})> 1 -mND(\textup{X}^k)/2 \, k = 1,..., R\;\textup{and m}ND() \textup{ is the new distance}\\ -1, & \text{otherwise} \end{cases}$$
is the new distance metric defined next. Let \(X^k=(x^k_1,x^k_2,...,x^k_n)\) be a prototype pattern with k = 1,2,...,R and X = (x 1,…,x n) be an unknown pattern. Their Hamming distance D(Xk,X) can then be obtained from the Hamming Discriminant Junction \(H F_k(X)=x_1\ast x^k_1+x_2\ast x^k_2+...+x_n\ast x^k_n\) with \(W^k_i=x^k_i\) , i = 1,...,n, as \(D(X^k,X)=(H F_k(X_k)-H F_k(X))/2\). Then, in the case of a finite set of R prototype patterns X k , k = 1,., R, a new Discriminant Function \(F_k(X)=x_1\ast W^k_1+...+x_n\ast W^k_n\) can be defined for every pattern Xk, k = 1,., R with respect to its opponent patterns Xq, q = 1,., R and q ≠ k as follows: The weights Wk 1 i = 1,…, n of the Discriminant function F k(X) are calculated according to the formula
$$W^k_i=(x^k_i)\ast {\sum_{q\neq k}(1-x^k_i\ast x^q_i)/(2\ast R\ast D(X^k,X^q))}$$
Erom the above formula we can see that the minimum value of a weight W i k will be equal to W i k = 0, in the case where x i k = x i q for every q= 1,…, R with q ≠ k and the maximum value of the weight W i k when x i k = -x i k for every q, will be equal to \( W_{i}^{k}=(2*x_{i}^{k})*\left \{\sum_{q=k}1/\left(2\ * R*D\left(\textup{X}^{k},\textup{X}^{q}\right)\right)\right\} \). The properties of the new Discriminant Junction can be demonstrated using the above formula of the weights W i k written as \(W_{i}^{k}=(x_{i}^{k})*\left \{\sum_{q=k}1/\left(2\ * R*D\left(\textup{X}^{k},\textup{X}^{q}\right)\right)\right\}-\left \{\sum_{q=k}(x_{i}^{q})/\left(2\ * R*D\left(\textup{X}^{k},\textup{X}^{q}\right)\right)\right\}\).

According to the above, the output of the Discriminant Junction F k(Xk) for the pattern Xk will be equal to the maximum value F k(Xk) = 1. Also, the output of the Discriminant Function F k(Xk′) for the complement Xk of the prototype pattern Xk will be equal to the minimum value F k(Xk′) = -1. Finally, the minimum New Distance mND(Xk) between pattern Xk and its opponent patterns Xq, q= 1,…, R, q ≠ kwill be equal to mND(Xk) = 1-max{F k(Xq)}, q ≠ k.

References

  1. [1]
    N. Nilsson. Learning Machines. McGraw-Hill, 1965.Google Scholar
  2. [2]
    P. K. Simpson. Artificial Neural Systems. Pergamon Press, 1990.Google Scholar

Copyright information

© Springer-Verlag London Limited 1993

Authors and Affiliations

  • N. Gaitanis
    • 1
  • G. Kapogianopoulos
    • 1
  • D. A. Karras
    • 1
  1. 1.Institute of Informatics and TelecommunicationsNational Research Center “Demokritos”Greece

Personalised recommendations