Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong.
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong; School of Data Science, City University of Hong Kong, Kowloon, Hong Kong.
Neural Netw. 2024 Aug;176:106348. doi: 10.1016/j.neunet.2024.106348. Epub 2024 Apr 30.
Binary matrix factorization is an important tool for dimension reduction for high-dimensional datasets with binary attributes and has been successfully applied in numerous areas. This paper presents a collaborative neurodynamic optimization approach to binary matrix factorization based on the original combinatorial optimization problem formulation and quadratic unconstrained binary optimization problem reformulations. The proposed approach employs multiple discrete Hopfield networks operating concurrently in search of local optima. In addition, a particle swarm optimization rule is used to reinitialize neuronal states iteratively to escape from local minima toward better ones. Experimental results on eight benchmark datasets are elaborated to demonstrate the superior performance of the proposed approach against six baseline algorithms in terms of factorization error. Additionally, the viability of the proposed approach is demonstrated for pattern discovery on three datasets.
二进制矩阵分解是一种用于高维二进制属性数据集降维的重要工具,已成功应用于许多领域。本文提出了一种基于原始组合优化问题公式和二次无约束二进制优化问题公式的二进制矩阵分解协同神经动力学优化方法。该方法采用多个离散的 Hopfield 网络同时运行,以寻找局部最优解。此外,还使用粒子群优化规则来迭代地重新初始化神经元状态,以从局部极小值逃离到更好的状态。通过对八个基准数据集的实验结果进行详细阐述,证明了与六种基线算法相比,该方法在分解误差方面具有更好的性能。此外,还通过三个数据集的模式发现验证了该方法的可行性。