Hash Bit Selection Based on Collaborative Neurodynamic Optimization

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

11 Scopus Citations
View graph of relations

Detail(s)

Original languageEnglish
Pages (from-to)11144-11155
Number of pages12
Journal / PublicationIEEE Transactions on Cybernetics
Volume52
Issue number10
Online published20 Aug 2021
Publication statusPublished - Oct 2022

Abstract

Hash bit selection determines an optimal subset of hash bits from a candidate bit pool. It is formulated as a zero-one quadratic programming problem subject to binary and cardinality constraints. In this article, the problem is equivalently reformulated as a global optimization problem. A collaborative neurodynamic optimization (CNO) approach is applied to solve the problem by using a group of neurodynamic models initialized with particle swarm optimization iteratively in the CNO. Lévy mutation is used in the CNO to avoid premature convergence by ensuring initial state diversity. A theoretical proof is given to show that the CNO with the Lévy mutation operator is almost surely convergent to global optima. Experimental results are discussed to substantiate the efficacy and superiority of the CNO-based hash bit selection method to the existing methods on three benchmarks.

Research Area(s)

  • Data models, Global optimization, hash bit selection, Lagrangian functions, Neural networks, neurodynamic optimization., Neurodynamics, Optimization, Particle swarm optimization, Symmetric matrices