메뉴 건너뛰기




Volumn , Issue , 2005, Pages 708-713

Inferring useful heuristics from the dynamics of iterative relational classifiers

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CLASSIFICATION PROBLEMS; BINARY CLASSIFIERS; CLASS LABELS; DYNAMICAL PROPERTIES; NON-TRIVIAL; NUMERICAL EXPERIMENTS; RELATIONAL NETWORK; SYNTHETIC DATA;

EID: 84880759180     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (5)

References (11)
  • 5
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
    • (1999) Journal of the ACM , vol.46 , Issue.5 , pp. 604-632
    • Kleinberg, J.M.1
  • 7
    • 0000806922 scopus 로고    scopus 로고
    • Automating the construction of internet portals with machine learning
    • Andrew McCallum, Kamal Nigam, Jason Rennie, and Kristie Seymore. Automating the construction of internet portals with machine learning. Information Retrieval Journal, 3:127-163, 2000.
    • (2000) Information Retrieval Journal , vol.3 , pp. 127-163
    • McCallum, A.1    Nigam, K.2    Rennie, J.3    Seymore, K.4
  • 10
    • 0003228830 scopus 로고    scopus 로고
    • Discovering test set regularities in relational domains
    • Stanford, US
    • Seán Slattery and Mark Craven. Discovering test set regularities in relational domains. In Proceedings of ICML-2000, pages 895-902, Stanford, US, 2000.
    • (2000) Proceedings of ICML-2000 , pp. 895-902
    • Slattery, S.1    Craven, M.2


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