[英]How do I find the least hamming distance matrix from a set of matrices for a given matrix?
I have a very large set of 400x400 binary matrices M .我有一组非常大的 400x400 二进制矩阵M 。 For a given binary matrix A , how do I find the matrix B within the set M such that it has the least hamming distance from A ?
对于给定的二进制矩阵A ,如何在集合M中找到矩阵B ,使其与A的汉明距离最小?
This is probably a duplicate of this question:这可能是这个问题的重复:
Efficiently find binary strings with low Hamming distance in large set 在大集合中有效地找到具有低汉明距离的二进制字符串
The fact that your string represents a matrix does not change anything to the hamming distance.您的字符串表示矩阵这一事实不会改变汉明距离。
For something fancier, you can also look at this recent paper:对于更高级的内容,您还可以查看最近的这篇论文:
https://www.cas.mcmaster.ca/ashtiani/papers/online-nearest-neighbor.pdf https://www.cas.mcmaster.ca/ashtiani/papers/online-nearest-neighbor.pdf
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.