图卷积宽度跨域推荐系统.pdfVIP

计算机研究与发展DOI：10.7544/issn1000-1239.202330617

Journal

of

Computer

Research

and

Development61（7）：1713−1729，2024

图卷积宽度跨域推荐系统

黄玲黄镇伟黄梓源关灿荣高月芳王昌栋111112

1

（华南农业大学数学与信息学院广州510642）

2

（中山大学计算机学院广州510006）

（huanglinghl@）

GraphConvolutionalBroadCross-DomainRecommenderSystem

1

1

1

1

1

2

Huang

Ling,

Huang

Zhenwei,

Huang

Ziyuan,

Guan

Canrong,

Gao

Yuefang,

and

Wang

Changdong

1

（CollegeofMathematicsandInformatics,SouthChinaAgriculturalUniversity,Guangzhou510642）

2

（SchoolofComputerScienceandEngineering,SunYat-senUniversity,Guangzhou510006）

AbstractCross-domain

recommendation

(CDR)

can

effectively

alleviate

the

data

sparsity

problem

suffered

by

the

traditional

recommendation

systems

via

leveraging

additional

knowledge

from

other

domains.

How

to

model

the

interaction

information

of

users

and

items

from

the

source

to

target

domains

is

a

key

issue

in

CDR.

In

the

current

CDR

methods,

the

higher-order

information

implied

by

the

user-item

interaction

graph

is

ignored.

To

this

end,

we

propose

a

new

framework

called

graph

convolutional

broad

cross-domain

recommender

system

(GBCD).

Specifically,

we

extend

the

traditional

bipartite

graph

of

user-item

interactions

to

a

(D

+

1)-partite

graph

to

model

the

relationship

between

users

and

items

in

each

domain,

and

then

use

common

users

as

a

bridge

between

the

source

domain

and

target

domain

to

transfer

information.

The

higher-order

relationships

between

users

and

items

are

learned

by

graph

convolutional

network

(GCN)

to

aggregate

neighbor

information.

However,

GCN

converges