메뉴 건너뛰기




Volumn 6393 LNCS, Issue , 2010, Pages 25-36

Fingerprinting ratings for collaborative filtering - Theoretical and empirical analysis

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION SCENARIO; COLLABORATIVE FILTERING; COLLABORATIVE FILTERING SYSTEMS; DATA SETS; EMPIRICAL ANALYSIS; RANK CORRELATION; RANK CORRELATION COEFFICIENT; RECOMMENDER SYSTEMS; FINGERPRINTING METHODS; HIGH-ACCURACY; NETFLIX;

EID: 78449303897     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16321-0_3     Document Type: Conference Paper
Times cited : (8)

References (24)
  • 1
    • 0038166193 scopus 로고    scopus 로고
    • Database-friendly random projections: Johnson-Lindenstrauss with binary coins
    • Achlioptas, D.: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. JCSS 66 (2003)
    • (2003) JCSS , vol.66
    • Achlioptas, D.1
  • 2
    • 37549058056 scopus 로고    scopus 로고
    • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
    • Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117-122 (2008)
    • (2008) Commun. ACM , vol.51 , Issue.1 , pp. 117-122
    • Andoni, A.1    Indyk, P.2
  • 3
    • 78449287362 scopus 로고    scopus 로고
    • Probabilistic possible winner determination
    • Bachrach, Y., Betzler, N., Faliszewski, P.: Probabilistic possible winner determination. AAAI 38 (2010)
    • (2010) AAAI , vol.38
    • Bachrach, Y.1    Betzler, N.2    Faliszewski, P.3
  • 6
    • 70350625168 scopus 로고    scopus 로고
    • Sketching algorithms for approximating rank correlations in collaborative filtering systems
    • Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. Springer, Heidelberg
    • Bachrach, Y., Herbrich, R., Porat, E.: Sketching algorithms for approximating rank correlations in collaborative filtering systems. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 344-352. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5721 , pp. 344-352
    • Bachrach, Y.1    Herbrich, R.2    Porat, E.3
  • 8
    • 57349146373 scopus 로고    scopus 로고
    • Lessons from the netflix prize challenge
    • Bell, R.M., Koren, Y.: Lessons from the netflix prize challenge. SIGKDD Explor. Newsl. 9(2), 75-79 (2007)
    • (2007) SIGKDD Explor. Newsl. , vol.9 , Issue.2 , pp. 75-79
    • Bell, R.M.1    Koren, Y.2
  • 9
    • 0002051628 scopus 로고    scopus 로고
    • Empirical analysis of predictive algorithms for collaborative filtering
    • Morgan Kaufmann, San Francisco
    • Breese, J.S., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative filtering. In: Proceedings of UAI 1998, pp. 43-52. Morgan Kaufmann, San Francisco (1998)
    • (1998) Proceedings of UAI 1998 , pp. 43-52
    • Breese, J.S.1    Heckerman, D.2    Kadie, C.3
  • 11
    • 38049048802 scopus 로고    scopus 로고
    • K-mismatch with don't cares
    • Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. Springer, Heidelberg
    • Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: K-mismatch with don't cares. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 151-162. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4698 , pp. 151-162
    • Clifford, R.1    Efremenko, K.2    Porat, E.3    Rothschild, A.4
  • 13
    • 0037943836 scopus 로고    scopus 로고
    • An approximate L1-difference algorithm for massive data streams
    • Feigenbaum, J., Kannan, S., Strauss, M., Viswanathan, M.: An approximate L1-difference algorithm for massive data streams. SIAM J. Comput 32(1), 131-151 (2002)
    • (2002) SIAM J. Comput , vol.32 , Issue.1 , pp. 131-151
    • Feigenbaum, J.1    Kannan, S.2    Strauss, M.3    Viswanathan, M.4
  • 15
    • 78449270441 scopus 로고    scopus 로고
    • An introduction to modern nonparametric statistics
    • Higgins, J.J.: An introduction to modern nonparametric statistics. Thomson Learning (2004)
    • (2004) Thomson Learning
    • Higgins, J.J.1
  • 16
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301), 13-30 (1963)
    • (1963) Journal of the American Statistical Association , vol.58 , Issue.301 , pp. 13-30
    • Hoeffding, W.1
  • 17
    • 0344612511 scopus 로고    scopus 로고
    • A small approximately min-wise independent family of hash functions
    • Indyk, P.: A small approximately min-wise independent family of hash functions. Journal of Algorithms 38(1), 84-90 (2001)
    • (2001) Journal of Algorithms , vol.38 , Issue.1 , pp. 84-90
    • Indyk, P.1
  • 18
    • 33846834126 scopus 로고    scopus 로고
    • A survey of trust and reputation systems for online service provision
    • DOI 10.1016/j.dss.2005.05.019, PII S0167923605000849
    • Jusang, A., Ismail, R., Boyd, C.: A survey of trust and reputation systems for online service provision. Decision Support Systems 43(2), 618-644 (2007) (Pubitemid 46216533)
    • (2007) Decision Support Systems , vol.43 , Issue.2 , pp. 618-644
    • Josang, A.1    Ismail, R.2    Boyd, C.3
  • 19
    • 0002282074 scopus 로고
    • A new measure of rank correlation
    • Kendall, M.G.: A new measure of rank correlation. Biometrika 30, 81-93 (1938)
    • (1938) Biometrika , vol.30 , pp. 81-93
    • Kendall, M.G.1
  • 22
    • 0029179043 scopus 로고
    • Social information filtering: Algorithms for automating "word of mouth"
    • Shardan, U., Maes, P.: Social information filtering: Algorithms for automating "word of mouth". In: ACM CHI 1995, vol. 1, pp. 210-217 (1995)
    • (1995) ACM CHI 1995 , vol.1 , pp. 210-217
    • Shardan, U.1    Maes, P.2
  • 23
    • 0023411964 scopus 로고
    • The proof and measurement of association between two things 1904
    • Spearman, C.: The proof and measurement of association between two things 1904. The American Journal of Psychology 100(3-4), 441-471 (1987)
    • (1987) The American Journal of Psychology , vol.100 , Issue.3-4 , pp. 441-471
    • Spearman, C.1


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