1 resultado para rank filter
em Massachusetts Institute of Technology
Filtro por publicador
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (3)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (64)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (5)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (9)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (28)
- Boston University Digital Common (4)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (2)
- Cambridge University Engineering Department Publications Database (88)
- CentAUR: Central Archive University of Reading - UK (60)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (73)
- Cochin University of Science & Technology (CUSAT), India (9)
- Collection Of Biostatistics Research Archive (2)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (2)
- CUNY Academic Works (2)
- Deakin Research Online - Australia (47)
- Digital Commons - Michigan Tech (9)
- Digital Commons @ Winthrop University (2)
- Digital Commons at Florida International University (2)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (5)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (1)
- Duke University (2)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (5)
- Indian Institute of Science - Bangalore - Índia (78)
- Instituto Politécnico do Porto, Portugal (1)
- Martin Luther Universitat Halle Wittenberg, Germany (1)
- Massachusetts Institute of Technology (1)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Memorial University Research Repository (1)
- National Center for Biotechnology Information - NCBI (3)
- Nottingham eTheses (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (10)
- Portal de Revistas Científicas Complutenses - Espanha (3)
- Publishing Network for Geoscientific & Environmental Data (11)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (72)
- Queensland University of Technology - ePrints Archive (131)
- RCAAP - Repositório Científico de Acesso Aberto de Portugal (1)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (2)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional da Universidade Federal do Rio Grande - FURG (1)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (1)
- Repositorio Institucional de la Universidad Pública de Navarra - Espanha (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (42)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- School of Medicine, Washington University, United States (3)
- Universidad de Alicante (1)
- Universidad Politécnica de Madrid (16)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (6)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (6)
- Université de Lausanne, Switzerland (1)
- Université de Montréal (1)
- Université de Montréal, Canada (3)
- University of Michigan (43)
- University of Queensland eSpace - Australia (16)
- WestminsterResearch - UK (6)
Resumo:
We study the frequent problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving {\\em weighted} low rank approximation problems, which, unlike simple matrix factorization problems, do not admit a closed form solution in general. We analyze, in addition, the nature of locally optimal solutions that arise in this context, demonstrate the utility of accommodating the weights in reconstructing the underlying low rank representation, and extend the formulation to non-Gaussian noise models such as classification (collaborative filtering).