Design and Application of Deep Hash Embedding Algorithm with Fusion Entity Attribute Information(FADH)

preprint OA: closed CC-BY-4.0
🔓 Open OA copy View at publisher

Abstract

Most machine learning and deep learning algorithms can only use low-dimensional data as input, but the data that must be processed in practical applications is diverse and irregular. There are two main problems with big dynamic data. (1) The size of the embedding table grows linearly with the vocabulary size, resulting in massive memory consumption. (2) For different newly added vocabularies. To solve these two problems, this paper proposes a novel embedding algorithm that can learn attribute associations with entities based on deep and hash algorithms. Taking movie data as an example, the encoding method and the specific flow of the algorithm are presented in detail, and the effect of dynamic reuse of data models is realized. Compared with the four existing embedding algorithms which can fuse entity attribute information, the deep hash embedding algorithm proposed in this paper has obvious optimization of time and space complexity.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-28T02:00:01.590549+00:00
License: CC-BY-4.0