메뉴 건너뛰기




Volumn , Issue , 2015, Pages

1-bit matrix completion under exact low-rank constraint

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; RELAXATION PROCESSES;

EID: 84929193222     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2015.7086879     Document Type: Conference Paper
Times cited : (58)

References (13)
  • 1
    • 85008044987 scopus 로고    scopus 로고
    • Matrix factorization techniques for recommender systems
    • Y. Koren, R. Bell, and C. Volinsky, "Matrix factorization techniques for recommender systems," Computer, Vol. 42, No. 8, pp. 30-37, 2009.
    • (2009) Computer , vol.42 , Issue.8 , pp. 30-37
    • Koren, Y.1    Bell, R.2    Volinsky, C.3
  • 3
    • 84882618114 scopus 로고    scopus 로고
    • Robust localization from incomplete local information
    • August
    • A. Karbasi and S. Oh, "Robust localization from incomplete local information," IEEE Transactions on Networking, Vol. 21, pp. 1131-1144, August 2013.
    • (2013) IEEE Transactions on Networking , vol.21 , pp. 1131-1144
    • Karbasi, A.1    Oh, S.2
  • 5
    • 84893492266 scopus 로고    scopus 로고
    • A max-norm constrained minimization approach to 1-bit matrix completion
    • T. Cai and W.-X. Zhou, "A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion," Journal of Machine Learning Research, Vol. 14, pp. 3619-3647, 2013.
    • (2013) Journal of Machine Learning Research , vol.14 , pp. 3619-3647
    • Cai, T.1    Zhou, W.-X.2
  • 6
    • 84929196892 scopus 로고    scopus 로고
    • Matrix recovery from quantized and corrupted measurements
    • Florence, Italy, May
    • A. S. Lan, C. Studer, and R. G. Baraniuk, "Matrix recovery from quantized and corrupted measurements," in IEEE ICASSP, Florence, Italy, May 2014.
    • (2014) IEEE ICASSP
    • Lan, A.S.1    Studer, C.2    Baraniuk, R.G.3
  • 11
    • 1542337156 scopus 로고    scopus 로고
    • A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
    • S. Burer and R. D. Monteiro, "A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization," Mathematical Programming (series B), Vol. 95, pp. 329-357, 2003.
    • (2003) Mathematical Programming (Series B) , vol.95 , pp. 329-357
    • Burer, S.1    Monteiro, R.D.2
  • 12
    • 84880089568 scopus 로고    scopus 로고
    • Parallel stochastic gradient algorithms for largescale matrix completion
    • B. Recht and C. Re, "Parallel stochastic gradient algorithms for largescale matrix completion," Math. Program. Comput., Vol. 5, No. 2, pp. 201-226, 2013.
    • (2013) Math. Program. Comput. , vol.5 , Issue.2 , pp. 201-226
    • Recht, B.1    Re, C.2


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