메뉴 건너뛰기




Volumn 2015-August, Issue , 2015, Pages 1025-1034

Matrix completion with queries

Author keywords

Active querying; Matrix completion; Recommender systems

Indexed keywords

DATA MINING; MONITORING; RECOMMENDER SYSTEMS;

EID: 84954191047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2783258.2783259     Document Type: Conference Paper
Times cited : (30)

References (19)
  • 2
    • 84863765049 scopus 로고    scopus 로고
    • Exact matrix completion via convex optimization
    • E. J. Candès and B. Recht. Exact matrix completion via convex optimization. Commun. ACM, 2012.
    • (2012) Commun. ACM
    • Candès, E.J.1    Recht, B.2
  • 6
    • 0004236492 scopus 로고    scopus 로고
    • Johns Hopkins Studies in the Mathematical Sciences
    • G. H. Golub and C. F. V. Loan. Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences, 2012.
    • (2012) Matrix Computations
    • Golub, G.H.1    Loan, C.F.V.2
  • 7
    • 84879826396 scopus 로고    scopus 로고
    • Low-rank matrix completion using alternating minimization
    • P. Jain, P. Netrapalli, and S. Sanghavi. Low-rank matrix completion using alternating minimization. In STOC, pages 665-674, 2013.
    • (2013) STOC , pp. 665-674
    • Jain, P.1    Netrapalli, P.2    Sanghavi, S.3
  • 9
  • 11
    • 84867134129 scopus 로고    scopus 로고
    • A combinatorial algebraic approach for the identifiability of low-rank matrix completion
    • F. J. Király and R. Tomioka. A combinatorial algebraic approach for the identifiability of low-rank matrix completion. In ICML, 2012.
    • (2012) ICML
    • Király, F.J.1    Tomioka, R.2
  • 12
    • 0020781464 scopus 로고
    • Smallest-last ordering and clustering and graph coloring algorithms
    • D. W. Matula and L. L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM (JACM), 30(3):417-427, 1983.
    • (1983) Journal of the ACM (JACM) , vol.30 , Issue.3 , pp. 417-427
    • Matula, D.W.1    Beck, L.L.2
  • 13
    • 84858731284 scopus 로고    scopus 로고
    • Matrix completion from power-law distributed samples
    • R. Meka, P. Jain, and I. S. Dhillon. Matrix completion from power-law distributed samples. In NIPS, 2009.
    • (2009) NIPS
    • Meka, R.1    Jain, P.2    Dhillon, I.S.3
  • 14
    • 84862020232 scopus 로고    scopus 로고
    • Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
    • S. Negahban and M. J. Wainwright. Restricted strong convexity and weighted matrix completion: Optimal bounds with noise. JMLR, 2012.
    • (2012) JMLR
    • Negahban, S.1    Wainwright, M.J.2
  • 19
    • 84869205493 scopus 로고    scopus 로고
    • Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
    • Z. Wen, W. Yin, and Y. Zhang. Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Program. Comput., 2012.
    • (2012) Math. Program. Comput.
    • Wen, Z.1    Yin, W.2    Zhang, Y.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.