<?xml version="1.0" encoding="UTF-8"?><feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>İşletme ve Ekonomi İçin Veri Bilimi Ana Bilim Dalı Tez Koleksiyonu</title>
<link href="https://hdl.handle.net/20.500.12573/219" rel="alternate"/>
<subtitle/>
<id>https://hdl.handle.net/20.500.12573/219</id>
<updated>2026-05-08T09:29:37Z</updated>
<dc:date>2026-05-08T09:29:37Z</dc:date>
<entry>
<title>Movie Recommendation Systems Based on Collaborative Filtering: A Case Study on Netflix</title>
<link href="https://hdl.handle.net/20.500.12573/1348" rel="alternate"/>
<author>
<name>Sütçü, Muhammed</name>
</author>
<author>
<name>Erdem, Oğuzkan</name>
</author>
<author>
<name>Kaya, Ecem</name>
</author>
<id>https://hdl.handle.net/20.500.12573/1348</id>
<updated>2022-08-08T11:47:50Z</updated>
<published>2021-01-01T00:00:00Z</published>
<summary type="text">Movie Recommendation Systems Based on Collaborative Filtering: A Case Study on Netflix
Sütçü, Muhammed; Erdem, Oğuzkan; Kaya, Ecem
User ratings on items like movies, songs, and shopping products are used&#13;
by Recommendation Systems (RS) to predict user preferences for items that have&#13;
not been rated. RS has been utilized to give suggestions to users in various domains&#13;
and one of the applications of RS is movie recommendation. In this domain, three&#13;
general algorithms are applied; Collaborative Filtering that provides prediction&#13;
based on similarities among users, Content-Based Filtering that is fed from the&#13;
relation between item-user pairs and Hybrid Filtering one which combines these&#13;
two algorithms. In this paper, we discuss which methods are more efficient in movie&#13;
recommendation in the framework of Collaborative Filtering. In our analysis, we use&#13;
Netflix Prize dataset and compare well-known Collaborative Filtering methods&#13;
which are Singular Value Decomposition, Singular Value Decomposition++, KNearest Neighbour and Co-Clustering. The error of each method is calculated by&#13;
using Root Mean Square Error (RMSE). Finally, we conclude that K-Nearest&#13;
Neighbour method is more successful in our dataset.
</summary>
<dc:date>2021-01-01T00:00:00Z</dc:date>
</entry>
</feed>
