Melola Discovery

← Melola Discovery

Jurnal Tanpa peringkat SINTA

Sort Filter Skyline in Movie Recommendation Based on Individual Preferences: Performance and Time Complexity Analysis

Scientific Journal of Informatics · Vol. 11 No. 3 (2024) · hlm. 789–802

DOI
10.15294/sji.v11i3.8474
ISSN
2407-7658, 2460-0040
Terbit
2024-09-29
Penerbit
Universitas Negeri Semarang
Bahasa
eng

Abstrak

Purpose: This study seeks to deliver accurate, customized movie recommendations using the Sort Filter Skyline (SFS) algorithm. The approach considers factors like budget, box office earnings, popularity, runtime, and audience ratings to align closely with each user's specific preferences. Methods: The Sort Filter Skyline (SFS) algorithm is employed, designed to identify and recommend items different from others within the dataset. Initially, the data undergoes preparation through pre-processing before being analyzed to compute entropy using the entropy formula. Before carrying out the dominance test, the SFS algorithm organizes the data based on entropy values. Result: In this research, 176 skyline objects were identified from a dataset containing 4,803 movies, including well-known titles like "Avatar" and "Titanic." The Skyline Filter Sort (SFS) algorithm pinpointed these objects within 4 seconds. Additionally, evaluation results using synthetic data, as depicted in the data visualization, revealed that the number of attributes increased from 1 to 7. The dataset size grew, and the execution time also rose—from 18 seconds to 170 minutes. Despite this increase, the algorithm demonstrated efficient performance with optimized processing times. Novelty: This study showcases the successful application of the SFS algorithm for generating personalized movie recommendations while tackling the difficulty of aligning viewer preferences with the extensive selection of films available. The findings offer important insights into enhancing recommendation systems by implementing algorithms efficiently and managing execution time complexity, contributing fresh perspectives to the field.

Kata kunci

Jaringan kolaborasi para penulis

8 penulis · 18 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universitas Muhammadiyah Jember
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Iwang Moeslem Andika SuryaAfiliasi tidak diketahui1
Triawan Adi CahyantoAfiliasi tidak diketahui1
Lutfi Ali MuharomAfiliasi tidak diketahui1
Iwang Moeslem Andika SuryaUniversitas Muhammadiyah Jember1
Lutfi Ali MuharomUniversitas Muhammadiyah Jember1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unnes.ac.id/journals/sji/oai, pertama di-harvest 6 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (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">Sort Filter Skyline in Movie Recommendation Based on Individual Preferences: Performance and Time Complexity Analysis</dc:title>
	<dc:creator xml:lang="en">Fadhilah, Alvi Nur</dc:creator>
	<dc:creator xml:lang="en">Cahyanto, Triawan Adi </dc:creator>
	<dc:creator xml:lang="en">Saifudin, Ilham </dc:creator>
	<dc:subject xml:lang="en">Skyline query</dc:subject>
	<dc:subject xml:lang="en">Sort filter skyline</dc:subject>
	<dc:subject xml:lang="en">Recommendation system</dc:subject>
	<dc:subject xml:lang="en">Individual preference</dc:subject>
	<dc:subject xml:lang="en">Complexity analysis</dc:subject>
	<dc:description xml:lang="en">Purpose: This study seeks to deliver accurate, customized movie recommendations using the Sort Filter Skyline (SFS) algorithm. The approach considers factors like budget, box office earnings, popularity, runtime, and audience ratings to align closely with each user's specific preferences.
Methods: The Sort Filter Skyline (SFS) algorithm is employed, designed to identify and recommend items different from others within the dataset. Initially, the data undergoes preparation through pre-processing before being analyzed to compute entropy using the entropy formula. Before carrying out the dominance test, the SFS algorithm organizes the data based on entropy values.
Result: In this research, 176 skyline objects were identified from a dataset containing 4,803 movies, including well-known titles like "Avatar" and "Titanic." The Skyline Filter Sort (SFS) algorithm pinpointed these objects within 4 seconds. Additionally, evaluation results using synthetic data, as depicted in the data visualization, revealed that the number of attributes increased from 1 to 7. The dataset size grew, and the execution time also rose—from 18 seconds to 170 minutes. Despite this increase, the algorithm demonstrated efficient performance with optimized processing times.
Novelty: This study showcases the successful application of the SFS algorithm for generating personalized movie recommendations while tackling the difficulty of aligning viewer preferences with the extensive selection of films available. The findings offer important insights into enhancing recommendation systems by implementing algorithms efficiently and managing execution time complexity, contributing fresh perspectives to the field.</dc:description>
	<dc:publisher xml:lang="en">Universitas Negeri Semarang</dc:publisher>
	<dc:date>2024-09-29</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unnes.ac.id/journals/sji/article/view/8474</dc:identifier>
	<dc:identifier>10.15294/sji.v11i3.8474</dc:identifier>
	<dc:source xml:lang="en">Scientific Journal of Informatics; Vol. 11 No. 3: Special Issue; 789-802</dc:source>
	<dc:source>2407-7658</dc:source>
	<dc:source>2460-0040</dc:source>
	<dc:source>10.15294/sji.v11i3</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.unnes.ac.id/journals/sji/article/view/8474/1564</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2024 Scientific Journal of Informatics</dc:rights>
</oai_dc:dc>