메뉴 건너뛰기




Volumn 42, Issue 1-2, 2006, Pages 37-53

Learning Bayesian network parameters under order constraints

Author keywords

Bayesian networks; Order constrained estimation; Parameter learning

Indexed keywords

CONSTRAINT THEORY; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; STATISTICAL METHODS;

EID: 33645966244     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2005.10.003     Document Type: Article
Times cited : (79)

References (16)
  • 2
    • 33646000537 scopus 로고    scopus 로고
    • M. Druzdzel, Probabilistic reasoning in decision support systems: from computation to common sense, Ph.D. thesis, Department of Engineering and Public Policy, Carnegie Mellon University, 1993.
  • 3
    • 85008015613 scopus 로고    scopus 로고
    • Building probabilistic networks: where do the numbers come from? Guest editors introduction
    • Druzdzel M., and van der Gaag L. Building probabilistic networks: where do the numbers come from? Guest editors introduction. IEEE Transactions on Knowledge and Data Engineering 12 (2000) 481-486
    • (2000) IEEE Transactions on Knowledge and Data Engineering , vol.12 , pp. 481-486
    • Druzdzel, M.1    van der Gaag, L.2
  • 5
    • 0025471633 scopus 로고
    • Fundamental concepts of qualitative probabilistic networks
    • Wellman M. Fundamental concepts of qualitative probabilistic networks. Artificial Intelligence 44 (1990) 257-303
    • (1990) Artificial Intelligence , vol.44 , pp. 257-303
    • Wellman, M.1
  • 6
    • 33645980591 scopus 로고    scopus 로고
    • G. Cooper, NESTOR: a computer-based medical diagnostic aid that integrates causal and probabilistic knowledge, Tech. Rep. HPP-84-48, Stanford University, 1984.
  • 8
    • 0001336210 scopus 로고
    • Conditional expectation given a σ-lattice and applications
    • Brunk H. Conditional expectation given a σ-lattice and applications. Annals of Mathematical Statistics 36 (1965) 1339-1350
    • (1965) Annals of Mathematical Statistics , vol.36 , pp. 1339-1350
    • Brunk, H.1
  • 10
    • 0035463786 scopus 로고    scopus 로고
    • A fast scaling algorithm for minimizing separable convex functions subject to chain constraints
    • Ahuja R., and Orlin J. A fast scaling algorithm for minimizing separable convex functions subject to chain constraints. Operations Research 49 5 (2001) 784-789
    • (2001) Operations Research , vol.49 , Issue.5 , pp. 784-789
    • Ahuja, R.1    Orlin, J.2
  • 11
    • 0001262212 scopus 로고
    • Maximum likelihood estimates of monotone parameters
    • Brunk H. Maximum likelihood estimates of monotone parameters. Annals of Mathematical Statistics 26 (1955) 607-616
    • (1955) Annals of Mathematical Statistics , vol.26 , pp. 607-616
    • Brunk, H.1
  • 12
    • 33645987861 scopus 로고    scopus 로고
    • C. van Eeden, Maximum likelihood estimation of ordered probabilities, in: Proceedings Koninklijke Nederlandse Akademie van Wetenschappen A, 1956, pp. 444-455.
  • 13
    • 34249761849 scopus 로고
    • Learning Bayesian networks: the combination of knowledge and statistical data
    • Heckerman D., Geiger D., and Chickering D. Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning 20 (1995) 197-243
    • (1995) Machine Learning , vol.20 , pp. 197-243
    • Heckerman, D.1    Geiger, D.2    Chickering, D.3
  • 15
    • 33645984216 scopus 로고    scopus 로고
    • N. Sloane, The on-line encyclopedia of integer sequences. Available from: .
  • 16
    • 0022906930 scopus 로고
    • An algorithm to generate the ideals of a partial order
    • Steiner G. An algorithm to generate the ideals of a partial order. Operations Research Letters 5 6 (1986) 317-320
    • (1986) Operations Research Letters , vol.5 , Issue.6 , pp. 317-320
    • Steiner, G.1


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