2017
DOI: 10.1007/s11280-017-0454-0
|View full text |Cite
|
Sign up to set email alerts
|

Recommendations based on a heterogeneous spatio-temporal social network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
23
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 35 publications
(24 citation statements)
references
References 19 publications
0
23
0
Order By: Relevance
“…Moreover, in Kefalas et al. ( 2018 ), a recommendation system was proposed that incorporates user time-varying preferences as well. In particular, the recommendation was based on a tripartite graph, consisting of users, locations and sessions .…”
Section: Related Workmentioning
confidence: 99%
“…Moreover, in Kefalas et al. ( 2018 ), a recommendation system was proposed that incorporates user time-varying preferences as well. In particular, the recommendation was based on a tripartite graph, consisting of users, locations and sessions .…”
Section: Related Workmentioning
confidence: 99%
“…Previous models were failed to adequately capture user time-varying preferences, so Kefalas et al [192] focused on the time dimension for the friend recommendation system. They constructed a hybrid tripartite graph with the heterogeneous spatio-temporal method consisting of sessions, users, and locations to capture the similarity between users and user location.…”
Section: ) Location-based Friend Recommendationsmentioning
confidence: 99%
“…Ma et al [29] proposed two meta-path based proximities to learn vertex representations in the heterogeneous graphs. Some studies [30]- [32] considered the time information of interactions on a bipartite graph and proposed dynamic graph embedding methods, but they focused more on selecting all the edges connected to a vertex in chronological order, and the sequences they obtained only contained one type of vertex, so the dynamic interaction process was ignored.…”
Section: B Graph Embeddingmentioning
confidence: 99%