2020
DOI: 10.1109/tmm.2019.2949434
|View full text |Cite
|
Sign up to set email alerts
|

Learning-Based User Clustering and Link Allocation for Content Recommendation Based on D2D Multicast Communications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 40 publications
0
8
0
Order By: Relevance
“…Figure 2 plots the COP of SU receivers N and M versus SNR for different power allocation ratio a 2 =a 1 , where Q = 20dB and T N , T M ð Þ= 2, 4 ð Þ. The analysis points are calculated from equations (25) and (32). We observe that the COP of user N and user M decreases with the increasing of SNR.…”
Section: Numerical Resultsmentioning
confidence: 96%
See 2 more Smart Citations
“…Figure 2 plots the COP of SU receivers N and M versus SNR for different power allocation ratio a 2 =a 1 , where Q = 20dB and T N , T M ð Þ= 2, 4 ð Þ. The analysis points are calculated from equations (25) and (32). We observe that the COP of user N and user M decreases with the increasing of SNR.…”
Section: Numerical Resultsmentioning
confidence: 96%
“…The COP of user M can be written as equation (32). Remark 1: In the above analysis, it can be easily found that connection outage would occur at user N when u 1 \0 and u 2 \0.…”
Section: Lemmamentioning
confidence: 99%
See 1 more Smart Citation
“…Several other researchers argued different users may have similar preferences to items. Consequently, Yang et al [16] and Chen et al [17] clustered the users into several groups according to their historical item interactions and separately captured the common preferences of users in each group. Recently, due to the great performance of graph convolutional networks, many approaches have resorted to constructing a graph of users and items according to their historical interactions, and exploring the high-order connectivity from user-item interaction [5], [6], [7], [18], [19].…”
Section: Related Workmentioning
confidence: 99%
“…( 9) from 0 to 1 with the stride of 0.1 for each dataset, and the dimension D in Eqn. (2) from [2,4,8,16,32].…”
Section: Experimental Settingsmentioning
confidence: 99%