Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/6105
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Fikir, O. Bora | - |
dc.contributor.author | Yaz, İlker O. | - |
dc.contributor.author | Özyer, Tansel | - |
dc.date.accessioned | 2021-09-11T15:34:57Z | - |
dc.date.available | 2021-09-11T15:34:57Z | - |
dc.date.issued | 2010 | en_US |
dc.identifier.citation | International Conference on Advances in Social Network Analysis and Mining (ASONAM) -- AUG 09-11, 2010 -- Odense, DENMARK | en_US |
dc.identifier.isbn | 978-0-7695-4138-9 | - |
dc.identifier.uri | https://doi.org/10.1109/ASONAM.2010.64 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/6105 | - |
dc.description.abstract | Recommendation systems are one of the research areas studied intensively in the last decades and several solutions have been elicited for problems in different domains for recommending. Recommendation may differ as content, collaborative filtering or both. Other than known challenges in collaborative filtering techniques, accuracy and computational cost at a large scale data are still at saliency. In this paper we proposed an approach by utilizing matrix value factorization for predicting rating i by user j with the sub matrix as k-most similar items specific to user i for all users who rated them all. In an attempt, previously predicted values are used for subsequent predictions. In order to investigate the accuracy of neighborhood methods we applied our method on Netflix Prize [1]. We have considered both items and users relationships on Netflix dataset for predicting movie ratings. We have conducted several experiments. | en_US |
dc.description.sponsorship | IEEE Comp Soc, Univ S Denmark, Univ Calgary, Hellenic Amer Univ, Global Univ, Assoc Comp Machinery, Special Interest Grp Human Interact, IEEE Comp Soc Tech Comm Data Engn, SpringerWienNewyork | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE Computer Soc | en_US |
dc.relation.ispartof | 2010 International Conference On Advances In Social Networks Analysis And Mining (Asonam 2010) | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Collaborative filtering | en_US |
dc.subject | QR factorization | en_US |
dc.subject | k-nearest neighborhood | en_US |
dc.title | A Movie Rating Prediction Algorithm With Collaborative Filtering | en_US |
dc.type | Conference Object | en_US |
dc.department | Faculties, Faculty of Engineering, Department of Computer Engineering | en_US |
dc.department | Fakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | tr_TR |
dc.identifier.startpage | 321 | en_US |
dc.identifier.endpage | 325 | en_US |
dc.identifier.wos | WOS:000393301300045 | en_US |
dc.identifier.scopus | 2-s2.0-77958163103 | en_US |
dc.institutionauthor | Fikir, O. Bora | - |
dc.institutionauthor | Yaz, İlker O. | - |
dc.institutionauthor | Özyer, Tansel | - |
dc.identifier.doi | 10.1109/ASONAM.2010.64 | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.relation.conference | International Conference on Advances in Social Network Analysis and Mining (ASONAM) | en_US |
item.openairetype | Conference Object | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.1. Department of Artificial Intelligence Engineering | - |
Appears in Collections: | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
15
checked on Dec 21, 2024
WEB OF SCIENCETM
Citations
10
checked on Aug 31, 2024
Page view(s)
74
checked on Dec 16, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.