1 resultado para Average Rank
em Massachusetts Institute of Technology
Filtro por publicador
- Aberdeen University (2)
- Aquatic Commons (3)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (6)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (14)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (4)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (27)
- Boston University Digital Common (3)
- Brock University, Canada (2)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (2)
- Cambridge University Engineering Department Publications Database (21)
- CentAUR: Central Archive University of Reading - UK (23)
- Central European University - Research Support Scheme (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (27)
- Cochin University of Science & Technology (CUSAT), India (3)
- Collection Of Biostatistics Research Archive (3)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (4)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- CUNY Academic Works (2)
- Deakin Research Online - Australia (35)
- Digital Archives@Colby (3)
- Digital Commons at Florida International University (13)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (5)
- Diposit Digital de la UB - Universidade de Barcelona (2)
- Duke University (4)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (3)
- Greenwich Academic Literature Archive - UK (1)
- Harvard University (1)
- Helda - Digital Repository of University of Helsinki (4)
- Indian Institute of Science - Bangalore - Índia (46)
- Instituto Politécnico de Viseu (1)
- Instituto Politécnico do Porto, Portugal (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Martin Luther Universitat Halle Wittenberg, Germany (1)
- Massachusetts Institute of Technology (1)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (3)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (5)
- Portal de Revistas Científicas Complutenses - Espanha (3)
- Publishing Network for Geoscientific & Environmental Data (453)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (44)
- Queensland University of Technology - ePrints Archive (45)
- Repositório digital da Fundação Getúlio Vargas - FGV (5)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (53)
- Research Open Access Repository of the University of East London. (1)
- School of Medicine, Washington University, United States (3)
- South Carolina State Documents Depository (1)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (7)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Pará (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universitat de Girona, Spain (3)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (6)
- University of Michigan (45)
- University of Queensland eSpace - Australia (17)
- University of Washington (2)
- WestminsterResearch - UK (2)
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).