1 resultado para model complexity
em Repositório do ISCTE - Instituto Universitário de Lisboa
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (3)
- Academic Archive On-line (Karlstad University; Sweden) (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (6)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (3)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (2)
- Aston University Research Archive (12)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (7)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (15)
- Brock University, Canada (1)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (3)
- CaltechTHESIS (4)
- Cambridge University Engineering Department Publications Database (19)
- CentAUR: Central Archive University of Reading - UK (40)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (5)
- Cochin University of Science & Technology (CUSAT), India (4)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (44)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (6)
- Digital Commons at Florida International University (6)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (5)
- DigitalCommons@University of Nebraska - Lincoln (2)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (2)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (2)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (22)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico do Porto, Portugal (2)
- Massachusetts Institute of Technology (3)
- National Center for Biotechnology Information - NCBI (6)
- Nottingham eTheses (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Publishing Network for Geoscientific & Environmental Data (3)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (23)
- Queensland University of Technology - ePrints Archive (629)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório do ISCTE - Instituto Universitário de Lisboa (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (12)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (1)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- Universidad de Alicante (5)
- Universidad Politécnica de Madrid (23)
- Universidade Complutense de Madrid (2)
- Universidade Federal de Uberlândia (1)
- Universitat de Girona, Spain (1)
- Université de Lausanne, Switzerland (2)
- Université de Montréal, Canada (4)
- Université Laval Mémoires et thèses électroniques (1)
- University of Queensland eSpace - Australia (4)
- WestminsterResearch - UK (1)
Resumo:
Matrix factorization (MF) has evolved as one of the better practice to handle sparse data in field of recommender systems. Funk singular value decomposition (SVD) is a variant of MF that exists as state-of-the-art method that enabled winning the Netflix prize competition. The method is widely used with modifications in present day research in field of recommender systems. With the potential of data points to grow at very high velocity, it is prudent to devise newer methods that can handle such data accurately as well as efficiently than Funk-SVD in the context of recommender system. In view of the growing data points, I propose a latent factor model that caters to both accuracy and efficiency by reducing the number of latent features of either users or items making it less complex than Funk-SVD, where latent features of both users and items are equal and often larger. A comprehensive empirical evaluation of accuracy on two publicly available, amazon and ml-100 k datasets reveals the comparable accuracy and lesser complexity of proposed methods than Funk-SVD.