메뉴 건너뛰기




Volumn , Issue , 2013, Pages 57-64

Trading-off among accuracy, similarity, diversity, and long-tail: A graph-based recommendation approach

(1)  Shi, Lei a  


Author keywords

Collaborative filtering; Contraction mapping; Fixed point stability; Graph based cost flow; Orthogonal sparse orthogonal nonnegative matrix tri factorization

Indexed keywords

CONTRACTION MAPPINGS; COST FLOW; EMPIRICAL EXPERIMENTS; FIXED POINTS; MULTIPLE CRITERIA; NON-NEGATIVE MATRIX; RECOMMENDATION ACCURACY; TRANSITION PROBABILITIES;

EID: 84887584821     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2507157.2507165     Document Type: Conference Paper
Times cited : (61)

References (29)
  • 3
    • 67651164565 scopus 로고    scopus 로고
    • A random walks perspective on maximizing satisfaction and profit
    • M. Brand. A random walks perspective on maximizing satisfaction and profit. In SIAM International Conference on Data Mining, pages 12-19, 2005.
    • (2005) SIAM International Conference on Data Mining , pp. 12-19
    • Brand, M.1
  • 6
    • 78649914423 scopus 로고    scopus 로고
    • Performance of recommender algorithms on top-n recommendation tasks
    • P. Cremonesi, Y. Koren, and R. Turrin. Performance of recommender algorithms on top-n recommendation tasks. In Proc. ACM RecSys, pages 39-46, 2010.
    • (2010) Proc. RecSys , pp. 39-46
    • Cremonesi, P.1    Koren, Y.2    Turrin, R.3
  • 7
    • 33749255098 scopus 로고    scopus 로고
    • On the equivalence of nonnegative matrix factorization and spectral clustering
    • C. Ding, X. He, H. Zha, and H. Simon. On the equivalence of nonnegative matrix factorization and spectral clustering. In Proc. SIAM Data Mining, 2005.
    • (2005) Proc. SIAM Data Mining
    • Ding, C.1    He, X.2    Zha, H.3    Simon, H.4
  • 8
    • 33749575326 scopus 로고    scopus 로고
    • Orthogonal nonnegative matrix tri-factorizations for clustering
    • C. Ding, T. Li, W. Peng, and H. Park. Orthogonal nonnegative matrix tri-factorizations for clustering. In Proc. 12th ACM SIGKDD, pages 126-135, 2006.
    • (2006) Proc. 12th SIGKDD , pp. 126-135
    • Ding, C.1    Li, T.2    Peng, W.3    Park, H.4
  • 9
    • 0032216898 scopus 로고    scopus 로고
    • The geometry of algorithms with orthogonality constraints
    • A. Edelman, T. Arias, and S. Smith. The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl., 20(2):303-353, 1998.
    • (1998) SIAM J. Matrix Anal. Appl , vol.20 , Issue.2 , pp. 303-353
    • Edelman, A.1    Arias, T.2    Smith, S.3
  • 11
    • 33748869142 scopus 로고    scopus 로고
    • A novel way of computing similarities between nodes of a graph, with application to collaborative recommendation
    • F. Fouss, A. Pirotte, and M. Saerens. A novel way of computing similarities between nodes of a graph, with application to collaborative recommendation. In Proc. IEEE/WIC/ACM WI'2005, pages 550-556, 2005.
    • (2005) Proc IEEE/WIC/ACM WI'2005 , pp. 550-556
    • Fouss, F.1    Pirotte, A.2    Saerens, M.3
  • 13
    • 84885621082 scopus 로고    scopus 로고
    • Relation between PLSA and NMF and implications
    • E. Gaussier and C. Goutte. Relation between PLSA and NMF and implications. In Proc. SIGIR, 2005.
    • (2005) Proc. SIGIR
    • Gaussier, E.1    Goutte, C.2
  • 14
    • 75249088154 scopus 로고    scopus 로고
    • A survey of accuracy evaluation metrics of recommendation tasks
    • A. Gunawardana and G. Shani. A survey of accuracy evaluation metrics of recommendation tasks. JMLR, 10:2935-2962, 2009.
    • (2009) JMLR , vol.10 , pp. 2935-2962
    • Gunawardana, A.1    Shani, G.2
  • 15
    • 77953061730 scopus 로고    scopus 로고
    • Topic-sensitive pagerank
    • T. H. Haveliwala. Topic-sensitive pagerank. In Proc. WWW, pages 517-526, 2002.
    • (2002) Proc. WWW , pp. 517-526
    • Haveliwala, T.H.1
  • 16
    • 84900510076 scopus 로고    scopus 로고
    • Non-negative matrix factorization with sparseness constraints
    • P. O. Hoyer. Non-negative matrix factorization with sparseness constraints. Journal of Machine Learning Research, 5:1457-1469, 2004.
    • (2004) Journal of Machine Learning Research , vol.5 , pp. 1457-1469
    • Hoyer, P.O.1
  • 17
    • 79953246287 scopus 로고    scopus 로고
    • Novelty and diversity in top-n recommendation - Analysis and evaluation
    • N. Hurley and M. Zhang. Novelty and diversity in top-n recommendation - analysis and evaluation. ACM Trans. Internet Technol., 10(4):14:1-14:30, 2011.
    • (2011) Trans. Internet Technol , vol.10 , Issue.4 , pp. 141-1430
    • Hurley, N.1    Zhang, M.2
  • 20
    • 85008044987 scopus 로고    scopus 로고
    • Matrix factorization techniques for recommender systems
    • Y. Koren, R. Bell, and C. 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
  • 21
    • 0033592606 scopus 로고    scopus 로고
    • Learning the parts of objects by non-negative matrix factorization
    • D. D. Lee and H. S. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401:788-791, 1999.
    • (1999) Nature , vol.401 , pp. 788-791
    • Lee, D.D.1    Seung, H.S.2
  • 22
    • 85167435647 scopus 로고    scopus 로고
    • Diversitying query suggestion results
    • H. Ma, M. R. Lyu, and I. King. Diversitying query suggestion results. In Proc. AAAI, 2010.
    • (2010) Proc. AAAI
    • Ma, H.1    Lyu, M.R.2    King, I.3
  • 23
    • 84869147060 scopus 로고    scopus 로고
    • Being accurate is not enough: How accuracy metrics have hurt recommender systems
    • S. M. McNee, J. Riedl, and J. A. Konstan. Being accurate is not enough: how accuracy metrics have hurt recommender systems. In Proc. CHI EA'06, pages 1097-1101, 2006.
    • (2006) Proc. CHI EA'06 , pp. 1097-1101
    • McNee, S.M.1    Riedl, J.2    Konstan, J.A.3
  • 24
    • 0003781238 scopus 로고    scopus 로고
    • Cambridge University Press
    • J. Norris. Markov Chains. Cambridge University Press, 1997.
    • (1997) Markov Chains
    • Norris, J.1
  • 25
    • 63449136183 scopus 로고    scopus 로고
    • The long tail of recommender systems and how to leverage it
    • Y.-J. Park and A. Tuzhilin. The long tail of recommender systems and how to leverage it. In Proc. ACM RecSys, pages 11-18, 2008.
    • (2008) Proc. RecSys , pp. 11-18
    • Park, Y.-J.1    Tuzhilin, A.2
  • 27
    • 84863735354 scopus 로고    scopus 로고
    • Challenging the long tail recommendation
    • H. Yin, B. Cui, J. Li, J. Yao, and C. Chen. Challenging the long tail recommendation. In Proc. VLDB'2012, volume 5, pages 896-907. 2012.
    • (2012) Proc. VLDB'2012 , vol.5 , pp. 896-907
    • Yin, H.1    Cui, B.2    Li, J.3    Yao, J.4    Chen, C.5
  • 28
    • 80052997006 scopus 로고    scopus 로고
    • Nonnegative matrix factorization with orthogonality constraints
    • J. Yoo and S. Choi. Nonnegative matrix factorization with orthogonality constraints. Journal of Computing Science and Engineering, 4(2):97-109, 2010.
    • (2010) Journal of Computing Science and Engineering , vol.4 , Issue.2 , pp. 97-109
    • Yoo, J.1    Choi, S.2
  • 29
    • 63449126087 scopus 로고    scopus 로고
    • Avoiding monotony: Improving the diversity of recommendation lists
    • M. Zhang and N. Hurley. Avoiding monotony: improving the diversity of recommendation lists. In Proc. ACM RecSys, pages 123-130, 2008.
    • (2008) Proc. RecSys , pp. 123-130
    • Zhang, M.1    Hurley, N.2


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