메뉴 건너뛰기




Volumn 45, Issue 1-2, 1997, Pages 9-18

Constructing probabilistic models

Author keywords

Bayesian network; Graph models; Learning; Probability theory; Uncertainty

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; GRAPHIC METHODS; LEARNING SYSTEMS;

EID: 0343144835     PISSN: 13865056     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1386-5056(97)00026-9     Document Type: Article
Times cited : (8)

References (22)
  • 1
    • 85017343247 scopus 로고
    • Probabilistic network construction using the minimum description length principle
    • Granada
    • R.R. Bouckaert, Probabilistic network construction using the minimum description length principle, in: Transactions of ESQARU'93, Granada, 1993, pp. 41-48.
    • (1993) Transactions of ESQARU'93 , pp. 41-48
    • Bouckaert, R.R.1
  • 2
    • 0020879288 scopus 로고
    • A method of computing generalized bayesian probability values for expert systems
    • Karlsruhe, FRG
    • P. Cheeseman, A method of computing generalized Bayesian probability values for expert systems, in: Proc. 6th Int. Conf. AI (IJCAI 83), Karlsruhe, FRG, 1983, pp. 198-202.
    • (1983) Proc. 6th Int. Conf. AI (IJCAI 83) , pp. 198-202
    • Cheeseman, P.1
  • 3
    • 0041547089 scopus 로고
    • In defense of probability
    • Los Angeles, CA
    • P. Cheeseman, In defense of probability, in: Proc. 8th Int. Conf. AI (IJCAI 85), Los Angeles, CA, 1985, pp. 1002-1007.
    • (1985) Proc. 8th Int. Conf. AI (IJCAI 85) , pp. 1002-1007
    • Cheeseman, P.1
  • 4
    • 0000546609 scopus 로고
    • I-divergence geometry of probability distributions and minimization problems
    • I. Csiszár, I-divergence geometry of probability distributions and minimization problems, Ann. Probab. 3 (1975) 146-158.
    • (1975) Ann. Probab. , vol.3 , pp. 146-158
    • Csiszár, I.1
  • 5
    • 0000695960 scopus 로고
    • On a least square adjustment of a sampled frequency table when the expected marginal totals are known
    • W.E. Deming, F.F. Stephan, On a least square adjustment of a sampled frequency table when the expected marginal totals are known, Ann. Math. Stat. 11 (1940) 427-444.
    • (1940) Ann. Math. Stat. , vol.11 , pp. 427-444
    • Deming, W.E.1    Stephan, F.F.2
  • 10
    • 0003568668 scopus 로고
    • Solution of the marginal problem and decomposable distributions
    • R. Jiroušek, Solution of the marginal problem and decomposable distributions, Kybernetika 27 (1991) 403-412.
    • (1991) Kybernetika , vol.27 , pp. 403-412
    • Jiroušek, R.1
  • 11
    • 24544444088 scopus 로고
    • From learning bayesian networks to a decomposable model construction
    • George Mason University, Fairfax, Virginia
    • R. Jiroušek, From learning Bayesian networks to a decomposable model construction, in: Papers and Abstracts from the Fifth Annual Workshop on Normative Systems, George Mason University, Fairfax, Virginia, 1995, pp. 8-10.
    • (1995) Papers and Abstracts from the Fifth Annual Workshop on Normative Systems , pp. 8-10
    • Jiroušek, R.1
  • 13
    • 0003641246 scopus 로고
    • On the effective implementation of the iterative proportional fitting procedure
    • R. Jiroušek, S. Přeučil, On the effective implementation of the iterative proportional fitting procedure, Comput. Stat. Data Anal. 19 (1995) 177-189.
    • (1995) Comput. Stat. Data Anal. , vol.19 , pp. 177-189
    • Jiroušek, R.1    Přeučil, S.2
  • 14
    • 0343006398 scopus 로고
    • Technical Report, Institute of Information Theory and Automation, Academy of Science of the Czech Republic, Prague
    • N. Kushmerick, The Probabilistic Model Editor User's Manual. Technical Report, Institute of Information Theory and Automation, Academy of Science of the Czech Republic, Prague, 1995.
    • (1995) The Probabilistic Model Editor User's Manual
    • Kushmerick, N.1
  • 15
    • 0028482006 scopus 로고
    • Learning bayesian belief networks: An approach based on the MDL principle
    • W. Lam, F. Bacchus, Learning Bayesian belief networks: an approach based on the MDL principle, Comput. Intell. 10 (1994) 269-293.
    • (1994) Comput. Intell. , vol.10 , pp. 269-293
    • Lam, W.1    Bacchus, F.2
  • 17
    • 0001006209 scopus 로고
    • Local computations with probabilities on graphical structures and their applications to expert systems
    • S.L. Lauritzen, D. Spiegelhalter, Local computations with probabilities on graphical structures and their applications to expert systems, J. R. Stat. Soc. Ser. B. 50 (1988) 157-189.
    • (1988) J. R. Stat. Soc. Ser. B. , vol.50 , pp. 157-189
    • Lauritzen, S.L.1    Spiegelhalter, D.2
  • 18
    • 0343877739 scopus 로고
    • A probabilistic approach to the integration of partial knowledge for medical decisionmaking
    • Mariánské Lázně
    • A. Perez, A probabilistic approach to the integration of partial knowledge for medical decisionmaking (in Czech), in: Proc. 1st Czechoslovak Congress of Biomed. Eng. (BMI 83), Mariánské Lázně, 1983, pp. 221-226.
    • (1983) Proc. 1st Czechoslovak Congress of Biomed. Eng. (BMI 83) , pp. 221-226
    • Perez, A.1
  • 19
    • 0022818911 scopus 로고
    • Evaluating influence diagrams
    • R.D. Shachter, Evaluating influence diagrams, Oper. Res. 34 (1986) 871-882.
    • (1986) Oper. Res. , vol.34 , pp. 871-882
    • Shachter, R.D.1
  • 20
    • 0022847461 scopus 로고
    • Intelligent probabilistic inference
    • L.N. Kanal, J.F. Lemmer (Eds.), North Holland, Amsterdam
    • R.D. Shachter, Intelligent probabilistic inference, in: L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence, North Holland, Amsterdam, 1986, pp. 371-382.
    • (1986) Uncertainty in Artificial Intelligence , pp. 371-382
    • Shachter, R.D.1
  • 21
    • 0024038570 scopus 로고
    • Probabilistic inference and influence diagrams
    • R.D. Shachter, Probabilistic inference and influence diagrams, Oper. Res. 36 (1988) 589-604.
    • (1988) Oper. Res. , vol.36 , pp. 589-604
    • Shachter, R.D.1
  • 22
    • 0021473698 scopus 로고
    • Simple linear-time algorithms to test chordality of graphs, test acyclidity of hypergraphs, and selectively reduce acyclic hypergraphs
    • R.E. Tarjan, M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclidity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984) 566-591.
    • (1984) SIAM J. Comput. , vol.13 , pp. 566-591
    • Tarjan, R.E.1    Yannakakis, M.2


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