Melola Discovery

← Melola Discovery

Jurnal SINTA 2

SGCF: Inductive Movie Recommendation System with Strongly Connected Neighborhood Sampling

Jurnal Ilmu Komputer dan Informasi (JIKI) · Vol. 15 No. 1 (2022) · pp. 55–67

DOI
10.21609/jiki.v15i1.1066
ISSN
2502-9274, 2088-7051
Published
2022-02-27
Publisher
Faculty of Computer Science - Universitas Indonesia
Language
eng

Abstract

User and item embeddings are key resources for the development of recommender systems. Recent works has exploited connectivity between users and items in graphs to incorporate the preferences of local neighborhoods into embeddings. Information inferred from graph connections is very useful, especially when interaction between user and item is sparse. In this paper, we propose graphSAGE Collaborative Filtering (SGCF), an inductive graph-based recommendation system with local sampling weight. We conducted an experiment to investigate recommendation performance for SGCF by comparing its performance with baseline and several SGCF variants in Movielens dataset, which are commonly used as recommendation system benchmark data. Our experiment shows that weighted SGCF perform 0.5% higher than benchmark in NDCG@5 and NDCG@10, and 0.8% in NDCG@100. Weighted SGCF perform 0.79% higher than benchmark in recall@5, 0.4% increase for recall@10 and 1.85% increase for recall@100. All the improvements are statistically significant with p-value < 0.05.

Keywords

Collaboration network of the authors

11 authors · 21 co-authorship links · 9 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Indonesia
  • Institut Teknologi Bacharuddin Jusuf Habibie
  • Taylor's University
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Muhammad Rizki SyazaliUniversity of Indonesia1
Nicholas PangestuUniversity of Indonesia1
Meganingrum Arista JiwanggiUniversity of Indonesia1
Nuzulul Khairu NissaUniversity of Indonesia1
Naradhipa BharyUniversity of Indonesia1
Jafar AbdurrohmanUniversity of Indonesia1
Fariz Wahyuzan DwitilasUniversity of Indonesia1
Eka Qadri NurantiInstitut Teknologi Bacharuddin Jusuf Habibie1
Husna Sarirah HusinTaylor's University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://jiki.cs.ui.ac.id/index.php/jiki/oai, first harvested 26 Okt 2026, last seen 1 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SGCF: Inductive Movie Recommendation System with Strongly Connected Neighborhood Sampling</dc:title>
	<dc:creator>Baskoro, Jatmiko Budi</dc:creator>
	<dc:creator>Yulianti, Evi</dc:creator>
	<dc:subject xml:lang="en-US">recommendation system</dc:subject>
	<dc:subject xml:lang="en-US">collaborative filtering</dc:subject>
	<dc:subject xml:lang="en-US">graph neural network</dc:subject>
	<dc:description xml:lang="en-US">User and item embeddings are key resources for the development of recommender systems. Recent works has exploited connectivity between users and items in graphs to incorporate the preferences of local neighborhoods into embeddings. Information inferred from graph connections is very useful, especially when interaction between user and item is sparse. In this paper, we propose graphSAGE Collaborative Filtering (SGCF), an inductive graph-based recommendation system with local sampling weight. We conducted an experiment to investigate recommendation performance for SGCF by comparing its performance with baseline and several SGCF variants in Movielens dataset, which are commonly used as recommendation system benchmark data. Our experiment shows that weighted SGCF perform 0.5% higher than benchmark in NDCG@5 and NDCG@10, and 0.8% in NDCG@100. Weighted SGCF perform 0.79% higher than benchmark in recall@5, 0.4% increase for recall@10 and 1.85% increase for recall@100. All the improvements are statistically significant with p-value &amp;lt; 0.05.</dc:description>
	<dc:publisher xml:lang="en-US">Faculty of Computer Science  - Universitas Indonesia</dc:publisher>
	<dc:date>2022-02-27</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/1066</dc:identifier>
	<dc:identifier>10.21609/jiki.v15i1.1066</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Ilmu Komputer dan Informasi; Vol. 15 No. 1 (2022): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information); 55-67</dc:source>
	<dc:source>2502-9274</dc:source>
	<dc:source>2088-7051</dc:source>
	<dc:source>10.21609/jiki.v15i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/1066/456</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2022 Jurnal Ilmu Komputer dan Informasi</dc:rights>
</oai_dc:dc>