메뉴 건너뛰기




Volumn 61, Issue 2, 2000, Pages 217-235

Latent semantic indexing: A probabilistic analysis

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DATABASE SYSTEMS; INFORMATION RETRIEVAL SYSTEMS; INFORMATION SCIENCE; LINGUISTICS;

EID: 0034297382     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2000.1711     Document Type: Article
Times cited : (433)

References (30)
  • 1
    • 0029546874 scopus 로고
    • Using linear algebra for intelligent information retrieval
    • Berry M. W., Dumais S. T., O'Brien G. W. Using linear algebra for intelligent information retrieval. SIAM Rev. 37:1995;573-595.
    • (1995) SIAM Rev. , vol.37 , pp. 573-595
    • Berry, M.W.1    Dumais, S.T.2    O'Brien, G.W.3
  • 3
    • 0343493906 scopus 로고    scopus 로고
    • Invited talk, 1997, PODS/SIGMOD
    • E. Brewer, Invited talk, 1997, PODS/SIGMOD, 1997.
    • (1997)
    • Brewer, E.1
  • 10
    • 0742306577 scopus 로고
    • Improving the retrieval of information from external sources
    • Dumais S. T. Improving the retrieval of information from external sources. Behav. Res. Meth. Instr. Comput. 23:1991;229-236.
    • (1991) Behav. Res. Meth. Instr. Comput. , vol.23 , pp. 229-236
    • Dumais, S.T.1
  • 11
    • 0029706597 scopus 로고    scopus 로고
    • Combining fuzzy information from multiple sources
    • p. 216-223
    • Fagin R. Combining fuzzy information from multiple sources. Proc. 1996 PODS. 1996;. p. 216-223.
    • (1996) Proc. 1996 PODS
    • Fagin, R.1
  • 14
    • 38249031101 scopus 로고
    • The Johnson-Lindenstrauss lemma and the sphericity of some graphs
    • Frankl P., Maehara H. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Combin. Theory B. 44:1988;355-362.
    • (1988) J. Combin. Theory B , vol.44 , pp. 355-362
    • Frankl, P.1    Maehara, H.2
  • 15
    • 0032308232 scopus 로고    scopus 로고
    • Fast Monte-Carlo algorithms for finding low-rank approximations
    • p. 370-378
    • Frieze A., Kannan R., Vempala S. Fast Monte-Carlo algorithms for finding low-rank approximations. Proc. 1998 FOCS. 1998;. p. 370-378.
    • (1998) Proc. 1998 FOCS
    • Frieze, A.1    Kannan, R.2    Vempala, S.3
  • 16
    • 77957175435 scopus 로고
    • Probabilistic models of information retrieval
    • Fuhr N. Probabilistic models of information retrieval. Comput. J. 35:1992;244-255.
    • (1992) Comput. J. , vol.35 , pp. 244-255
    • Fuhr, N.1
  • 20
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • Hoeffding W. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58:1963;13-30.
    • (1963) J. Amer. Statist. Assoc. , vol.58 , pp. 13-30
    • Hoeffding, W.1
  • 21
    • 0001654702 scopus 로고
    • Extensions of Lipshitz mapping into Hilbert space
    • Johnson W. B., Lindenstrauss J. Extensions of Lipshitz mapping into Hilbert space. Contemp. Math. 26:1984;189-206.
    • (1984) Contemp. Math. , vol.26 , pp. 189-206
    • Johnson, W.B.1    Lindenstrauss, J.2
  • 22
    • 0024904712 scopus 로고
    • Approximating the permanent
    • Jerrum M., Sinclair A. Approximating the permanent. SIAM J. Comput. 18:1989;1149-1178.
    • (1989) SIAM J. Comput. , vol.18 , pp. 1149-1178
    • Jerrum, M.1    Sinclair, A.2
  • 29
    • 0003136577 scopus 로고
    • A comparison of text retrieval methods
    • Turtle H. R., Croft W. B. A comparison of text retrieval methods. Comput. J. 35:1992;279-289.
    • (1992) Comput. J. , vol.35 , pp. 279-289
    • Turtle, H.R.1    Croft, W.B.2


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