메뉴 건너뛰기




Volumn 3, Issue 2, 2000, Pages 127-163

Automating the construction of internet portals with machine learning

Author keywords

Crawling; Expectation maximization; Hidden markov models; Information extraction; Naive bayes; Reinforcement learning; Spidering; Text classification; Unlabeled data

Indexed keywords


EID: 0000806922     PISSN: 13864564     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009953814988     Document Type: Article
Times cited : (1147)

References (13)
  • 1
    • 0008660461 scopus 로고    scopus 로고
    • A hierarchical probabilistic model for novelty detection in text
    • Just Research
    • Baker D, Hofmann T, McCallum A and Yang Y “1999” A hierarchical probabilistic model for novelty detection in text. Tech. Rep., Just Research, http://www.cs.cmu.edu/̃mccallum.
    • (1999) Tech. Rep.
    • Baker, D.1    Hofmann, T.2    McCallum, A.3    Yang, Y.4
  • 2
    • 0001862769 scopus 로고
    • An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process
    • Baum LE “1972” An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process. Inequalities, 3:1-8.
    • (1972) Inequalities , vol.3 , pp. 1-8
    • Baum, L.E.1
  • 3
    • 0003787146 scopus 로고
    • Princeton University Press, Princeton, NJ
    • Bellman RE “1957” Dynamic Programming. Princeton University Press, Princeton, NJ.
    • (1957) Dynamic Programming
    • Bellman, R.E.1
  • 9
    • 0003396042 scopus 로고    scopus 로고
    • An empirical study of smoothing techniques for language modeling
    • Computer Science Group, Harvard University
    • Chen SF and Goodman JT “1998” An empirical study of smoothing techniques for language modeling. Tech. Rep. TR-10-98, Computer Science Group, Harvard University.
    • (1998) Tech. Rep. , vol.TR-10-98
    • Chen, S.F.1    Goodman, J.T.2


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