Approximate Probabilistic Inference in Java with source code

By Hassnain Jamil -

Introduction

The goal of this project is to implement in Java the rejection sampling and likelihood weighting approximate probabilistic inference approaches. Your software should be able to read a given Bayesian network consisting of binary variables from a text file in the following format:

 Cloudy, 0.5
Sprinkler, Cloudy, 0.1, 0.5
Rain, Cloudy, 0.8, 0.2
WetGrass, Sprinkler, Rain, 0.99, 0.09, 0.09, 0

Each line is a comma separated list of tokens that correspond to a variable of the Bayesian network. The name of the variable is given in the first token. Subsequent string tokens correspond to the parents of this variable. Subsequent numeric tokens give the probability that the variable of this line is true for all value combinations of its parents. In the above example, which corresponds to the sprinkler network from the book, for variable “Sprinkler”, the parent is the variable “Cloudy”, and the probability of Sprinkler=true is 0.1 if Cloudy=true and 0.5 if Cloudy=false.

Your software should be able to read queries from the console in the following format:
P(Sprinkler|Wetgrass=true,Cloudy=false) Your software should also ask for the number of samples to be produced and the method of approximate inference to use, and then output the probability estimate for the query.

CONTACT DETAILS

For any other questions or other tasks please feel free to contact me
via email: mhassnainjamil@gmail.com
via WhatsApp: +92-324-7042178
via skype: hassnainjamil1

Comments

Post a Comment

Popular posts from this blog

[SOLVED] Tape for a Turing Machine using Doubly-linked List in Java with full source code

By Anonymous -
Tape for a Turing Machine (Doubly-linked List) Short exercise in which you will code part of an existing project. In this case, you will be working with a doubly-linked list. To make this topic more interesting, the list that you work on will be part of a Turing Machine. A Turing Machine is a kind of very simple, abstract computing device that was introduced in the 1930's by Alan Turing as a way of studying computation and its limitations. The classes that you need for the lab are in a package named turing. You will define a new class named Tape in this package. You can find the Java source in the code directory. You should copy this directory into an Eclipse project. There will be errors, since the existing classes depend on the Tape class, which you have not yet written. Don't forget the Javadoc comments. A Class for Turing Machine Tapes A Turing machine works on a "tape" that is used for both input and output. The tape is made up of little squares called cell...
Read more

[SOLVED] ICT285 Databases TMA 2017 Assignment 1 | Relational Algebra, Database Design & Implementation

By Anonymous -
Relational Algebra A database records information about athletes competing at the Olympics. An athlete competes for a particular country in one or more events. Events take place at a scheduled day and time in a particular venue. The result (rank) is recorded for all athletes in the final of the event. The medal (gold, silver or bronze) is also recorded for the medal winners in the event. Note that we are not considering team sports or heats in this example – only individuals competing in the finals. The schema for this database is as follows: (Note that primary keys are shown underlined, foreign keys in bold). ATHLETE ( AthleteNo , AthleteName, CountryName) COUNTRY ( CountryName , NumberOfCompetitors) EVENT (EventName, ScheduledStart, VenueName ) VENUE (VenueName, City, Capacity) FINAL ( AthleteNo , EventName , Rank, Medal) Provide relational algebra (NOT SQL) queries to find the following informaList the name and country of all athletes. List the event name and scheduled...
Read more