Endüstri Mühendisliği Bölümü Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12573/204
Browse
2 results
Search Results
Article Movie Recommendation Systems Based on Collaborative Filtering: A Case Study on Netflix(Erciyes Üniversitesi, 2021) Sütçü, Muhammed; Erdem, Oğuzkan; Kaya, EcemUser ratings on items like movies, songs, and shopping products are used_x000D_ by Recommendation Systems (RS) to predict user preferences for items that have_x000D_ not been rated. RS has been utilized to give suggestions to users in various domains_x000D_ and one of the applications of RS is movie recommendation. In this domain, three_x000D_ general algorithms are applied; Collaborative Filtering that provides prediction_x000D_ based on similarities among users, Content-Based Filtering that is fed from the_x000D_ relation between item-user pairs and Hybrid Filtering one which combines these_x000D_ two algorithms. In this paper, we discuss which methods are more efficient in movie_x000D_ recommendation in the framework of Collaborative Filtering. In our analysis, we use_x000D_ Netflix Prize dataset and compare well-known Collaborative Filtering methods_x000D_ which are Singular Value Decomposition, Singular Value Decomposition++, KNearest Neighbour and Co-Clustering. The error of each method is calculated by_x000D_ using Root Mean Square Error (RMSE). Finally, we conclude that K-Nearest_x000D_ Neighbour method is more successful in our dataset.Article Citation - WoS: 23Citation - Scopus: 29A Simulation-Based Approximate Dynamic Programming Approach to Dynamic and Stochastic Resource-Constrained Multi-Project Scheduling Problem(Elsevier, 2024) Satic, U.; Jacko, P.; Kirkbride, C.We consider the dynamic and stochastic resource -constrained multi -project scheduling problem which allows for the random arrival of projects and stochastic task durations. Completing projects generates rewards, which are reduced by a tardiness cost in the case of late completion. Multiple types of resource are available, and projects consume different amounts of these resources when under processing. The problem is modelled as an infinite -horizon discrete -time Markov decision process and seeks to maximise the expected discounted long -run profit. We use an approximate dynamic programming algorithm (ADP) with a linear approximation model which can be used for online decision making. Our approximation model uses project elements that are easily accessible by a decision -maker, with the model coefficients obtained offline via a combination of Monte Carlo simulation and least squares estimation. Our numerical study shows that ADP often statistically significantly outperforms the optimal reactive baseline algorithm (ORBA). In experiments on smaller problems however, both typically perform suboptimally compared to the optimal scheduler obtained by stochastic dynamic programming. ADP has an advantage over ORBA and dynamic programming in that ADP can be applied to larger problems. We also show that ADP generally produces statistically significantly higher profits than common algorithms used in practice, such as a rule -based algorithm and a reactive genetic algorithm.