메뉴 건너뛰기




Volumn , Issue , 2004, Pages 732-735

Focused crawling by learning HMM from user's topic-specific browsing

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; INFORMATION ANALYSIS; MARKOV PROCESSES; MATHEMATICAL MODELS; SEARCH ENGINES; SEMANTICS; WEB BROWSERS; WORLD WIDE WEB;

EID: 15544365705     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (13)

References (8)
  • 4
    • 0003918928 scopus 로고    scopus 로고
    • School of Information Management and Systems.Univ. of California at Berkeley, Accessed Mar. 2004
    • P. Lyman, H. Varian, J. Dunn, A. Strygin, and K. Swearingen. How much information? 2003. http://www.sims.berkeley.edu/research/projects/how-much-info- 2003/, School of Information Management and Systems.Univ. of California at Berkeley, Accessed Mar. 2004.
    • (2003) How Much Information?
    • Lyman, P.1    Varian, H.2    Dunn, J.3    Strygin, A.4    Swearingen, K.5
  • 5
    • 0033904351 scopus 로고    scopus 로고
    • Adaptive retrieval agents: Internalizing local context and scaling up to the web
    • F. Menczer and R. Belew. Adaptive retrieval agents: Internalizing local context and scaling up to the web. Machine Learning, 39(2/3):203-242, 2000.
    • (2000) Machine Learning , vol.39 , Issue.2-3 , pp. 203-242
    • Menczer, F.1    Belew, R.2


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