A Study on the Application of Bayesian Learning and Decision Trees IoT-Enabled System in Postharvest Storage

2022 ◽  
pp. 467-491
Author(s):  
Akinola S. Olayinka ◽  
Charles Oluwaseun Adetunji ◽  
Wilson Nwankwo ◽  
Olaniyan T. Olugbemi ◽  
Tosin C. Olayinka
Keyword(s):  
Decision Trees ◽  
Bayesian Learning ◽  
Postharvest Storage

The Quest for Intelligent Machines

2017 ◽  
Author(s):  
Arlindo Oliveira
Keyword(s):  
Artificial Intelligence ◽  
Machine Learning ◽  
Neural Networks ◽  
Decision Trees ◽  
Bayesian Learning ◽  
Turing Test ◽  
Intelligent Machines ◽  
The Brain ◽  
Existing Data

This chapter addresses the question of whether a computer can become intelligent and how to test for that possibility. It introduces the idea of the Turing test, a test developed to determine, in an unbiased way, whether a program running in a computer is, or is not, intelligent. The development of artificial intelligence led, in time, to many applications of computers that are not possible using “non-intelligent” programs. One important area in artificial intelligence is machine learning, the technology that makes possible that computers learn, from existing data, in ways similar to the ways humans learn. A number of approach to perform machine learning is addressed in this chapter, including neural networks, decision trees and Bayesian learning. The chapter concludes by arguing that the brain is, in reality, a very sophisticated statistical machine aimed at improving the chances of survival of its owner.

Variational Bayesian Learning Theory

2019 ◽  
Author(s):  
Shinichi Nakajima ◽  
Kazuho Watanabe ◽  
Masashi Sugiyama
Keyword(s):  
Learning Theory ◽  
Bayesian Learning ◽  
Variational Bayesian

Optimizing Diagnostic Test Sequences: The Probability Modifying Plot

1999 ◽  
Vol 38 (01) ◽  
pp. 50-55 ◽  
Author(s):  
P. F. de Vries Robbé ◽  
A. L. M. Verbeek ◽  
J. L. Severens
Keyword(s):  
Urinary Tract Infection ◽  
Urinary Tract ◽  
Tract Infection ◽  
Decision Trees ◽  
Diagnostic Tests ◽  
Test Sequence ◽  
Optimal Sequence ◽  
Specific Test ◽  
Total Cost ◽  
Modelling Techniques

Abstract:The problem of deciding the optimal sequence of diagnostic tests can be structured in decision trees, but unmanageable bushy decision trees result when the sequence of two or more tests is investigated. Most modelling techniques include tests on the basis of gain in certainty. The aim of this study was to explore a model for optimizing the sequence of diagnostic tests based on efficiency criteria. The probability modifying plot shows, when in a specific test sequence further testing is redundant and which costs are involved. In this way different sequences can be compared. The model is illustrated with data on urinary tract infection. The sequence of diagnostic tests was optimized on the basis of efficiency, which was either defined as the test sequence with the least number of tests or the least total cost for testing. Further research on the model is needed to handle current limitations.

Automated Development of Clinical Strategies Using Multistage Decision Analysis

1986 ◽  
Vol 25 (04) ◽  
pp. 207-214 ◽  
Author(s):  
P. Glasziou
Keyword(s):  
Decision Tree ◽  
Decision Analysis ◽  
Decision Trees ◽  
Optimal Strategy ◽  
Cholestatic Jaundice ◽  
Clinical Strategies ◽  
Simultaneous Study

SummaryThe development of investigative strategies by decision analysis has been achieved by explicitly drawing the decision tree, either by hand or on computer. This paper discusses the feasibility of automatically generating and analysing decision trees from a description of the investigations and the treatment problem. The investigation of cholestatic jaundice is used to illustrate the technique.Methods to decrease the number of calculations required are presented. It is shown that this method makes practical the simultaneous study of at least half a dozen investigations. However, some new problems arise due to the possible complexity of the resulting optimal strategy. If protocol errors and delays due to testing are considered, simpler strategies become desirable. Generation and assessment of these simpler strategies are discussed with examples.

Generation of Correlated Logistic-Normal Random Variates for Medical Decision Trees

1998 ◽  
Vol 37 (03) ◽  
pp. 235-238 ◽  
Author(s):  
M. El-Taha ◽  
D. E. Clark
Keyword(s):  
Monte Carlo ◽  
Decision Trees ◽  
Computer Algebra ◽  
Taylor Series ◽  
Computer Algebra System ◽  
Random Variable ◽  
Monte Carlo Analysis ◽  
Normal Random Variable ◽  
Medical Decision ◽  
Theoretical Results

AbstractA Logistic-Normal random variable (Y) is obtained from a Normal random variable (X) by the relation Y = (ex)/(1 + ex). In Monte-Carlo analysis of decision trees, Logistic-Normal random variates may be used to model the branching probabilities. In some cases, the probabilities to be modeled may not be independent, and a method for generating correlated Logistic-Normal random variates would be useful. A technique for generating correlated Normal random variates has been previously described. Using Taylor Series approximations and the algebraic definitions of variance and covariance, we describe methods for estimating the means, variances, and covariances of Normal random variates which, after translation using the above formula, will result in Logistic-Normal random variates having approximately the desired means, variances, and covariances. Multiple simulations of the method using the Mathematica computer algebra system show satisfactory agreement with the theoretical results.

Blind Identification of Multichannel Systems Based on Sparse Bayesian Learning

2016 ◽  
Vol E99.B (12) ◽  
pp. 2614-2622 ◽  
Author(s):  
Kai ZHANG ◽  
Hongyi YU ◽  
Yunpeng HU ◽  
Zhixiang SHEN ◽  
Siyu TAO
Keyword(s):  
Bayesian Learning ◽  
Blind Identification ◽  
Sparse Bayesian Learning ◽  
Multichannel Systems
Sign in / Sign up

Export Citation Format

Share Document