메뉴 건너뛰기




Volumn 178, Issue , 2008, Pages 251-255

Web page prediction based on conditional random fields

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORECASTING; HIDDEN MARKOV MODELS; NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 85039608141     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-251     Document Type: Conference Paper
Times cited : (7)

References (29)
  • 3
    • 0342368782 scopus 로고
    • Technical Report CSD-95-875, Computer Science Department, University of California at Berkeley
    • Venkata N., Padmanabhan. Improving World Wide Web Latency, Technical Report CSD-95-875, Computer Science Department, University of California at Berkeley, 1995.
    • (1995) Improving World Wide Web Latency
    • Venkata, N.1    Padmanabhan2
  • 12
    • 0033723107 scopus 로고    scopus 로고
    • Link prediction and path analysis using markov chains
    • Ramesh R. Sarukkai. Link Prediction and Path Analysis Using Markov Chains, Computer Networks, 33(1-6), 377-386, 2000.
    • (2000) Computer Networks , vol.33 , Issue.1-6 , pp. 377-386
    • Sarukkai, R.R.1
  • 13
    • 0002000090 scopus 로고    scopus 로고
    • Web usage mining: Discovery and applications of usage patterns from web data
    • Jaideep Srivastava, Robert Cooley, Mukund Deshpande, Pang-Ning Tan. Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data, SIGKDD Explorations, Vol. 1, Issue 2, 12-23, 2000.
    • (2000) SIGKDD Explorations , vol.1 , Issue.2 , pp. 12-23
    • Srivastava, J.1    Cooley, R.2    Deshpande, M.3    Tan, P.-N.4
  • 15
    • 0024610919 scopus 로고
    • A tutorial on hidden markov models and selected applications in speech recognition
    • Lawrence R. Rabiner. A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition, In: Proceedings of the IEEE, 257-286, 1989.
    • (1989) Proceedings of The IEEE , pp. 257-286
    • Rabiner, L.R.1
  • 21
    • 84935113569 scopus 로고
    • Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
    • Andrew J. Viterbi. Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm, IEEE Transactions on Information Theory, 260-269, 1967.
    • (1967) IEEE Transactions on Information Theory , pp. 260-269
    • Viterbi, A.J.1
  • 22
    • 84966262179 scopus 로고
    • Updating quasi-Newton matrices with limited storage
    • Jorge Nocedal. Updating Quasi-Newton Matrices with Limited Storage, Mathematics of Computation, 773-782, 1980.
    • (1980) Mathematics of Computation , pp. 773-782
    • Nocedal, J.1
  • 26
    • 85182313769 scopus 로고    scopus 로고
    • last accessible on February 10
    • UCI KDD Archive: msnbc.com anonymous Web data. http://kdd.ics.uci.edu/databases/msnbc/msnbc.html, last accessible on February 10, 2008.
    • (2008) Msnbc.Com Anonymous Web Data
  • 27
    • 46249127243 scopus 로고    scopus 로고
    • last accessible on February 10
    • CRF++: Yet another CRF toolkit. http://crfpp.sourceforge.net/, last accessible on February 10, 2008.
    • (2008) CRF++: Yet Another CRF Toolkit
  • 29
    • 70049084130 scopus 로고    scopus 로고
    • last accessible on February 10
    • PEW Internet & American Life Project, http://www.pewinternet.org/, last accessible on February 10, 2008.
    • (2008) PEW Internet & American Life Project


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