메뉴 건너뛰기




Volumn , Issue , 1990, Pages 762-769

Constructor: A System for the Induction of Probabilistic Models

Author keywords

[No Author keywords available]

Indexed keywords

DIAGNOSIS; GRAPH THEORY; KNOWLEDGE BASED SYSTEMS; MARKOV PROCESSES; PETROLEUM PROSPECTING; SEMANTICS;

EID: 84982403902     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (38)

References (16)
  • 2
    • 0344819767 scopus 로고
    • Node aggregation for distributed inference in bayesian networks
    • Detroit, Michigan, August
    • E. C. Chang and R. M. Fung. Node aggregation for distributed inference in bayesian networks. In Proceedings of the 11th IJCAI, Detroit, Michigan, August 1989.
    • (1989) Proceedings of the 11th IJCAI
    • Chang, E. C.1    Fung, R. M.2
  • 4
    • 84933530882 scopus 로고
    • Approximating discrete probability distributions with dependence trees
    • C. K. Chow and C. N. Liu. Approximating discrete probability distributions with dependence trees. IEEE Trans. on Info Theory, 1968.
    • (1968) IEEE Trans. on Info Theory
    • Chow, C. K.1    Liu, C. N.2
  • 5
    • 0343442766 scopus 로고
    • Knowledge acquisition via incremental conceptual clustering
    • September
    • D. H. Fisher. Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2 (2):139-172, September 1987.
    • (1987) Machine Learning , vol.2 , Issue.2 , pp. 139-172
    • Fisher, D. H.1
  • 8
    • 0000086731 scopus 로고
    • Influence diagrams
    • R. A. Howard and J. E. Matheson, editors, Menlo Park: Strategic Decisions Group
    • R. A. Howard and J. E. Matheson. Influence diagrams. In R. A. Howard and J. E. Matheson, editors, The Principles and Applications of Decision Analysis, vol. II, Menlo Park: Strategic Decisions Group, 1981.
    • (1981) The Principles and Applications of Decision Analysis , vol.II
    • Howard, R. A.1    Matheson, J. E.2
  • 9
    • 0000263797 scopus 로고
    • Projection pursuit
    • P. J. Huber. Projection pursuit. The Annals of Statistics, 13 (2):435-475, 1985.
    • (1985) The Annals of Statistics , vol.13 , Issue.2 , pp. 435-475
    • Huber, P. J.1
  • 10
    • 0001006209 scopus 로고
    • Local computations with probabilities on graphical structures and their application in expert systems
    • S. L. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application in expert systems. Journal Royal Statistical Society B, 50, 1988.
    • (1988) Journal Royal Statistical Society B , vol.50
    • Lauritzen, S. L.1    Spiegelhalter, D. J.2
  • 11
    • 0000166613 scopus 로고
    • Experiments with incremental concept formation: UNIMEM
    • September
    • M. Lebowitz. Experiments with incremental concept formation: UNIMEM. Machine Learning, 2 (2):103-138, September 1987.
    • (1987) Machine Learning , vol.2 , Issue.2 , pp. 103-138
    • Lebowitz, M.1
  • 12
    • 0003046842 scopus 로고
    • Learning from observation: conceptual clustering
    • R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, editors, Morgan Kaufman
    • R. S. Michalski and R. E. Stepp. Learning from observation: conceptual clustering. In R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, editors, Machine Learning: An Artificial Intelligence Approach, Morgan Kaufman, 1983.
    • (1983) Machine Learning: An Artificial Intelligence Approach
    • Michalski, R. S.1    Stepp, R. E.2
  • 15
    • 0000629975 scopus 로고
    • Cross-validatory choice and assessment of statistical predictions
    • Series B
    • M. Stone. Cross-validatory choice and assessment of statistical predictions. Journal of the Royal Statistical Society, 36:111-147, 1974. Series B.
    • (1974) Journal of the Royal Statistical Society , vol.36 , pp. 111-147
    • Stone, M.1
  • 16
    • 0021473698 scopus 로고
    • Simple lineartime algorithms to test chordality of graphs, test acyclicity of hyper graphs, and selectively reduce hypergraphs
    • R. E. Tarjan and M. Yannakakis. Simple lineartime algorithms to test chordality of graphs, test acyclicity of hyper graphs, and selectively reduce hypergraphs. SIAM J. Comput., 13:566-579, 1984.
    • (1984) SIAM J. Comput , vol.13 , pp. 566-579
    • Tarjan, R. E.1    Yannakakis, M.2


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