메뉴 건너뛰기




Volumn 3720 LNAI, Issue , 2005, Pages 715-723

Learning models of relational stochastic processes

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MARKOV PROCESSES; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBABILISTIC LOGICS; PROBABILITY; RANDOM PROCESSES; UNCERTAIN SYSTEMS;

EID: 33646420073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564096_73     Document Type: Conference Paper
Times cited : (3)

References (17)
  • 1
    • 0242456818 scopus 로고    scopus 로고
    • Relational Markov models and their application to adaptive Web navigation
    • C. Anderson, P. Domingos, and D. Weld. Relational Markov models and their application to adaptive Web navigation. In KDD'02, pages 143-152, 2002.
    • (2002) KDD'02 , pp. 143-152
    • Anderson, C.1    Domingos, P.2    Weld, D.3
  • 2
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • A. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286, 1999.
    • (1999) Science , pp. 286
    • Barabasi, A.1    Albert, R.2
  • 3
    • 0000582521 scopus 로고
    • Statistical analysis of non-lattice data
    • J. Besag. Statistical analysis of non-lattice data. The Statistician, 24:179-195, 1975.
    • (1975) The Statistician , vol.24 , pp. 179-195
    • Besag, J.1
  • 4
  • 9
    • 33744459255 scopus 로고    scopus 로고
    • 'Say EM' for selecting probabilistic models of logical sequences
    • Edinburgh, Scotland, Morgan Kaufmann
    • K. Kersting and T. Raiko. 'Say EM' for selecting probabilistic models of logical sequences. In UAI-05, Edinburgh, Scotland, 2005. Morgan Kaufmann.
    • (2005) UAI-05
    • Kersting, K.1    Raiko, T.2
  • 10
    • 0242540464 scopus 로고    scopus 로고
    • Bursty and hierarchical structure in streams
    • Jon Kleinberg. Bursty and hierarchical structure in streams. In KDD '02, 2002.
    • (2002) KDD '02
    • Kleinberg, J.1
  • 11
    • 31844432693 scopus 로고    scopus 로고
    • Learning the structure of Markov logic networks
    • Bonn, Germany, ACM Press
    • S. Kok and P. Domingos. Learning the structure of Markov logic networks. In ICML'05, Bonn, Germany, 2005. ACM Press.
    • (2005) ICML'05
    • Kok, S.1    Domingos, P.2
  • 13
    • 13444256714 scopus 로고    scopus 로고
    • Learning probabilistic relational planning rules
    • Whistler, Canada
    • Hanna Pasula, Luke S. Zettlemoyer, and Leslie Pack Kaelbling. Learning probabilistic relational planning rules. In ICAPS'04, pages 683-691, Whistler, Canada, 2004.
    • (2004) ICAPS'04 , pp. 683-691
    • Pasula, H.1    Zettlemoyer, L.S.2    Kaelbling, L.P.3
  • 15
    • 84880816720 scopus 로고    scopus 로고
    • Dynamic probabilistic relational models
    • Acapulco, Mexico, Morgan Kaufmann
    • S. Sanghai, P. Domingos, and D. Weld. Dynamic probabilistic relational models. In IJCAI'03, pages 992-1002, Acapulco, Mexico, 2003. Morgan Kaufmann.
    • (2003) IJCAI'03 , pp. 992-1002
    • Sanghai, S.1    Domingos, P.2    Weld, D.3


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