关键词: 散列函数, 原始聚类中心, 近邻局部图, 约束目标函数, 代数签名, 哈希树, 网络信道

Abstract: Eliminating duplicate data is an indispensable step to ensure efficient network operation. But this process is susceptible to interference from signal strength, network device, router performance and other problems. Therefore, a minimum-hashing algorithm for single channel data elimination is proposed. First the hash function in the hash algorithm network is used for single channel data clustering, and then supervision discriminant projection algorithm is applied for clustering of data dimension reduction after processing, finally the algebraic sign estimate is used to guarantee the data between the computing cost minimum and to construct minimum hash tree generated calibration value, in the update to heavy tags. The repeated data in a single channel is completely eliminated by double-layer culling mechanism. Experimental results show that the algorithm has short execution time and low computation and storage cost.

Key words: hash function')">

hash function, original cluster center, nearby local graph, constrained objective function, algebraic signature, hash tree, network channel