Graph factorization machine based recommendation algorithm with graph construction and attention mechanism

Shang-hang Song; Bing Kong; Li-hua Zhou

doi:10.1117/12.2680552

31 May 2023 Graph factorization machine based recommendation algorithm with graph construction and attention mechanism

Shang-hang Song, Bing Kong, Li-hua Zhou

Proceedings Volume 12704, Eighth International Symposium on Advances in Electrical, Electronics, and Computer Engineering (ISAEECE 2023); 127043K (2023) https://doi.org/10.1117/12.2680552
Event: 8th International Symposium on Advances in Electrical, Electronics and Computer Engineering (ISAEECE 2023), 2023, Hangzhou, China

Abstract

Graphs, as a type of data structure that exists in numerous scenarios, are applied in various fields of the internet, such as recommendation algorithms, community detection, path search, and so on. In recent years, with the rapid development of the internet, the amount of graph data has greatly increased, and analyzing and utilizing these graph data to establish graph network models and apply them to various real-life production and living scenarios is of significant importance, such as using user-item data to establish a recommendation algorithm model for recommendations. Currently, many graph neural network models have achieved good results, but there is still room for improvement. Better algorithms can more accurately understand the user's needs and bring a better recommendation experience to the user. The paper designs a new way of constructing graphs and improves the graph network message-passing algorithm. A new graph neural network algorithm, GAFM (Graph Attention Factorization Machines), is proposed. Compared with traditional algorithms, this algorithm will construct graph structures of users and items based on original data, and can also construct item graph data by linking to a knowledge base to introduce new items. When this algorithm performs message passing between nodes, it will consider the first-order neighbor set of the central node and the second-order cross-item of the first-order neighbor set, and use an attention mechanism to regulate the weight in the message passing process to capture high-dimensional neighbor information and improve accuracy. The experimental results on real-world datasets show that the algorithm has better performance compared to existing graph recommendation algorithms.

Citation Download Citation

Shang-hang Song, Bing Kong, and Li-hua Zhou "Graph factorization machine based recommendation algorithm with graph construction and attention mechanism", Proc. SPIE 12704, Eighth International Symposium on Advances in Electrical, Electronics, and Computer Engineering (ISAEECE 2023), 127043K (31 May 2023); https://doi.org/10.1117/12.2680552

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
8 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Data modeling

Matrices

Machine learning

Fermium

Deep learning

Frequency modulation

Evolutionary algorithms

Show All Keywords

Keywords/Phrases

Search In:

Publication Years