메뉴 건너뛰기




Volumn 5721 LNCS, Issue , 2009, Pages 344-352

Sketching algorithms for approximating rank correlations in collaborative filtering systems

Author keywords

[No Author keywords available]

Indexed keywords

COLLABORATIVE FILTERING; COLLABORATIVE FILTERING SYSTEMS; HIGH CONFIDENCE; KENDALL'S TAU; MASSIVE DATA SETS; RANK CORRELATION;

EID: 70350625168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03784-9_34     Document Type: Conference Paper
Times cited : (10)

References (12)
  • 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
    • 77957061059 scopus 로고    scopus 로고
    • Sketching techniques for collaborative filtering
    • Pasadena, California July, to appear
    • Bachrach, Y., Porat, E., Rosenschein, J.S.: Sketching techniques for collaborative filtering. In: IJCAI 2009, Pasadena, California (July 2009) (to appear)
    • (2009) IJCAI
    • Bachrach, Y.1    Porat, E.2    Rosenschein, J.S.3
  • 4
    • 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
  • 6
    • 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
  • 7
    • 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
  • 8
    • 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
  • 11
    • 0029179043 scopus 로고    scopus 로고
    • Shardan, U., Maes, P.: Social information filtering: Algorithms for automating word of mouth. In: ACM CHI 1995, 1, pp. 210-217 (1995)
    • Shardan, U., Maes, P.: Social information filtering: Algorithms for automating "word of mouth". In: ACM CHI 1995, vol. 1, pp. 210-217 (1995)


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