메뉴 건너뛰기




Volumn , Issue , 2013, Pages

Exact and stable recovery of pairwise interaction tensors

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVEX PROGRAMMING; ERROR ANALYSIS; RECOVERY;

EID: 84898966059     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (21)

References (26)
  • 3
    • 77951291046 scopus 로고    scopus 로고
    • A singular value thresholding algorithm for matrix completion
    • Jian-Feng Cai, Emmanuel J Candès, and Zuowei Shen. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4):1956-1982, 2010.
    • (2010) SIAMJournal on Optimization , vol.20 , Issue.4 , pp. 1956-1982
    • Cai, J.-F.1    Candès, E.J.2    Shen, Z.3
  • 4
    • 77952741387 scopus 로고    scopus 로고
    • Matrix completion with noise
    • Emmanuel J Candes and Yaniv Plan. Matrix completion with noise. Proceedings of the IEEE, 98(6):925-936, 2010.
    • (2010) Proceedings of the IEEE , vol.98 , Issue.6 , pp. 925-936
    • Candes, E.J.1    Plan, Y.2
  • 5
  • 7
    • 0034853839 scopus 로고    scopus 로고
    • A rank minimization heuristic with application to minimum order system approximation
    • Maryam Fazel, Haitham Hindi, and Stephen P Boyd. A rank minimization heuristic with application to minimum order system approximation. In American Control Conference, 2001, 2001.
    • (2001) American Control Conference , vol.2001
    • Fazel, M.1    Hindi, H.2    Boyd, S.P.3
  • 9
    • 0001424792 scopus 로고
    • Tensor rank is np-complete
    • Johan Håstad. Tensor rank is np-complete. Journal of Algorithms, 11(4):644-654, 1990.
    • (1990) Journal of Algorithms , vol.11 , Issue.4 , pp. 644-654
    • Håstad, J.1
  • 10
    • 84891614753 scopus 로고    scopus 로고
    • Most tensor problems are np hard
    • Christopher Hillar and Lek-Heng Lim. Most tensor problems are np hard. JACM, 2013.
    • (2013) JACM
    • Hillar, C.1    Lim, L.-H.2
  • 11
    • 85162034614 scopus 로고    scopus 로고
    • Guaranteed rank minimization via singular value projection
    • Prateek Jain, Raghu Meka, and Inderjit Dhillon. Guaranteed rank minimization via singular value projection. In NIPS, 2010.
    • (2010) NIPS
    • Jain, P.1    Meka, R.2    Dhillon, I.3
  • 12
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • Tamara G Kolda and Brett W Bader. Tensor decompositions and applications. SIAM review, 51(3):455-500, 2009.
    • (2009) SIAMreview , vol.51 , Issue.3 , pp. 455-500
    • Kolda, T.G.1    Bader, B.W.2
  • 13
    • 85008044987 scopus 로고    scopus 로고
    • Matrix factorization techniques for recommender systems
    • Yehuda Koren, Robert Bell, and Chris Volinsky. Matrix factorization techniques for recommender systems. Computer, 42(8):30-37, 2009.
    • (2009) Computer , vol.42 , Issue.8 , pp. 30-37
    • Koren, Y.1    Bell, R.2    Volinsky, C.3
  • 15
    • 85100063855 scopus 로고    scopus 로고
    • Tensor completion for estimating missing values in visual data
    • Ji Liu, Przemyslaw Musialski, Peter Wonka, and Jieping Ye. Tensor completion for estimating missing values in visual data. In ICCV, 2009.
    • (2009) ICCV
    • Liu, J.1    Musialski, P.2    Wonka, P.3    Ye, J.4
  • 16
    • 80052403470 scopus 로고    scopus 로고
    • Multi-hdp: A non-parametric bayesian model for tensor factorization
    • Ian Porteous, Evgeniy Bart, and Max Welling. Multi-hdp: A non-parametric bayesian model for tensor factorization. In AAAI, 2008.
    • (2008) AAAI
    • Porteous, I.1    Bart, E.2    Welling, M.3
  • 17
    • 70350663110 scopus 로고    scopus 로고
    • Learning optimal ranking with tensor factorization for tag recommendation
    • Steffen Rendle, Leandro Balby Marinho, Alexandros Nanopoulos, and Lars Schmidt-Thieme. Learning optimal ranking with tensor factorization for tag recommendation. In SIGKDD, 2009.
    • (2009) SIGKDD
    • Rendle, S.1    Balby Marinho, L.2    Nanopoulos, A.3    Schmidt-Thieme, L.4
  • 18
    • 77954599758 scopus 로고    scopus 로고
    • Factorizing personalized markov chains for next-basket recommendation
    • Steffen Rendle, Christoph Freudenthaler, and Lars Schmidt-Thieme. Factorizing personalized markov chains for next-basket recommendation. In WWW, 2010.
    • (2010) WWW
    • Rendle, S.1    Freudenthaler, C.2    Schmidt-Thieme, L.3
  • 19
    • 84898958974 scopus 로고    scopus 로고
    • Pairwise interaction tensor factorization for personalized tag recommendation
    • Steffen Rendle and Lars Schmidt-Thieme. Pairwise interaction tensor factorization for personalized tag recommendation. In ICDM, 2010.
    • (2010) ICDM
    • Rendle, S.1    Schmidt-Thieme, L.2
  • 20
    • 31844432834 scopus 로고    scopus 로고
    • Non-negative tensor factorization with applications to statistics and computer vision
    • Amnon Shashua and Tamir Hazan. Non-negative tensor factorization with applications to statistics and computer vision. In ICML, 2005.
    • (2005) ICML
    • Shashua, A.1    Hazan, T.2
  • 24
    • 85162510548 scopus 로고    scopus 로고
    • Statistical performance of convex tensor decomposition
    • Ryota Tomioka, Taiji Suzuki, Kohei Hayashi, and Hisashi Kashima. Statistical performance of convex tensor decomposition. NIPS, 2011.
    • (2011) NIPS
    • Tomioka, R.1    Suzuki, T.2    Hayashi, K.3    Kashima, H.4
  • 26
    • 80052121737 scopus 로고    scopus 로고
    • Temporal collaborative filtering with bayesian probabilistic tensor factorization
    • Liang Xiong, Xi Chen, Tzu-Kuo Huang, Jeff Schneider, and Jaime G Carbonell. Temporal collaborative filtering with bayesian probabilistic tensor factorization. In SDM, 2010.
    • (2010) SDM
    • Xiong, L.1    Chen, X.2    Huang, T.-K.3    Schneider, J.4    Carbonell, J.G.5


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