Neural Networks with Configurable Affinity Functions for Binary Object Classification

Authors

  • S.Yu. Leonov National Technical University "Kharkiv Polytechnic Institute" image/svg+xml Author
  • O.V. Lipchanska National Technical University "Kharkiv Polytechnic Institute" image/svg+xml Author

Keywords:

computer systems for recognition; computing systems; data transmission; Hamming neural network; affinity functions; diagnostics of systems for determining operability; classification of discrete objects; binary vectors.

Abstract

The paper addresses computer systems for the recognition of discrete objects encoded by binary and bipolar feature vectors. It is shown that the well-known Hamming neural network, which uses the scalar product of bipolar vectors and the Hamming distance for recognition, does not allow the application of more refined similarity functions when object features are binary-encoded. Modifications of the network architecture are proposed, implementing computing systems for evaluating object similarity using the Jaccard, Russell-Rao, Sokal-Michener, Kulczynski, and Yule functions. Neuron and neural block structures are developed that ensure data transmission between the network's layers and perform diagnostics of systems for determining the operability of recognition algorithms through the parallel computation of match/mismatch variables for the features of compared binary vectors. A numerical example is given, confirming the correctness of the proposed computer tools for classification. It is shown that the developed approach extends the scope of application of neural-network-based computer systems for recognition and makes it possible to synthesize networks that determine several equally valid solutions simultaneously.

References

[1] Ke-Lin Du , M.N.S. Swamy. Neural Networks and Statistical Learning, 2nd edition. Springer (2019).

[2] M.T. Hagan, H.B. Demuth, M.H. Beale, O. De Jesús. Neural Network Design, 2nd edition (2014).

[3] Dmitrienko, V.D., Zakovorotny, A.Yu., and Leonov, S.Yu. Hamming neural network for solving problems with several solutions, Bulletin of NTU "KPI, , Kharkiv, NTU "KPI", No. 50 (1271) (2017). 119-129.

[4] Babichev, S.A. Theoretical and practical principles of information technology for processing gene expression profiles for gene network reconstruction. Dissertation for the degree of Doctor of Technical Sciences (2018).

[5] Dmitrienko, V.D., Khavina, I.P., Zakovorotny, A.Yu., Lipchansky, M.V., and Mezentsev, N.V. Methods and algorithms of artificial intelligence systems, Kiev, Kafedra, (2014).

[6] Richard O. Duda, Peter E. Hart, David G. Stork — Pattern Classification, 2nd edition. Wiley (2001).

[7] Christopher M. Bishop. Pattern Recognition and Machine Learning. Springer (2006).

[8] Andrew R. Webb, Keith D. Copsey. Statistical Pattern Recognition, 3rd edition. Wiley (2011).

[9] Lynne Billard, Edwin Diday. Symbolic Data Analysis: Conceptual Statistics and Data Mining. Wiley (2006).

[10] Charu C. Aggarwal, Chandan K. Reddy (eds.) Data Clustering: Algorithms and Applications. CRC Press (2013).

[11] N. Ikeda, P. Watta, M. Artiklar, M. Hassoun. A two-level Hamming network for high performance associative memory. Neural Networks (2001).

Published

2026-07-05