Evidence map›Paper›PMID 36072720›Full record

ArticleComputational intelligence and neuroscience2022

TAFM: A Recommendation Algorithm Based on Text-Attention Factorization Mechanism.

Xianrong Zhang, Ran Li, Simin Wang, Xintong Li, Zhe Sun

Abstract read
In one paragraph

Article in Computational intelligence and neuroscience, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Xianrong ZhangCyberspace Institute of Advanced Technology (CIAT), Guangzhou University, Guangzhou 510006, China.ORCID https://orcid.org/0000-0002-3596-3785
Ran LiCyberspace Institute of Advanced Technology (CIAT), Guangzhou University, Guangzhou 510006, China.ORCID https://orcid.org/0000-0002-7649-6546
Simin WangCyberspace Institute of Advanced Technology (CIAT), Guangzhou University, Guangzhou 510006, China.
Xintong LiShenyang Institute of Computing Technology, University of Chinese Academy of Sciences, Shenyang 110168, China.
Zhe SunCyberspace Institute of Advanced Technology (CIAT), Guangzhou University, Guangzhou 510006, China.ORCID https://orcid.org/0000-0002-4633-7675

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The click-through rate (CTR) prediction task is used to estimate the probabilities of users clicking on recommended items, which are extremely important in recommender systems. Recently, the deep factorization machine (DeepFM) algorithm was proposed. The DeepFM algorithm incorporates a factorization machine (FM) to learn not only low-order features but also the interactions of higher-order features. However, DeepFM lacks user diversity representations and does not consider the text. In view of this, we propose a text-attention FM (TAFM) based on the DeepFM algorithm. First, the attention mechanism in the TAFM algorithm is used to address the diverse representations of users and goods and to mine the features that are most interesting to users. Second, the TAFM model can fully learn text features through its text component, text attention component, and N-gram text feature extraction component, which can fully explore potential user preferences and the diversity among user interests. In addition, the convolutional autoencoder in the TAFM can learn some higher-level features, and the higher-order feature mining process is more comprehensive. On the public dataset, the better performing models in the existing models are deep cross network (DCN), DeepFM, and product-based neural network (PNN), respectively, and the AUC score metrics of these models hover between 0.698 and 0.699. The AUC score of our design model is 0.730, which is at least 3% higher than that of the existing models. The accuracy metric of our model is at least 0.1 percentage points higher than that of existing models.

Indexed as

AlgorithmsNeural Networks, ComputerLearning

Identifiers

PMID36072720
PMCPMC9444371

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.