Some suggestions reagrding Variable Elimination

Some suggestions reagrding Variable Elimination

Hi Ritika, Nice to see your wiki about variable elimination, which helped me a lot in understanding this technical field which I was unfamiliar with. I have some questions regarding your topic. First, you mentioned in the abstract that the traditional method is extremely inefficient and doesn't scale well, can you give some detail about the reason? Second, do you have pseudo code for the variable elimination algorithm? Third, can you provide any real examples that uses variable elimination? Regards Arthur

BaoSun (talk)03:23, 2 February 2016

Hi Arthur, Thank you for your comments. I shall try to answer them to the best of my abilities. 1. So the traditional method is inference by enumeration. So basically we are given the entire JPD (joint probability distribution) on set of variables and we need to say, for instance compute conditional probability given some evidence. How you would traditionally go about doing this is that you will first condition on the distribution to incorporate evidence e, which basically means that you will eliminate those records from your table which don't agree with your evidence and then normalize. After that you will marginalize on this new distribution to accommodate 'observation' part of the conditional probability. If we have 'n' variables and 'd' is the size of the largest domain, space complexity to store JPD is O(d^n). Time complexity is also O(d^n) because in the worst case we need to sum over all entries in the JPD. 2. I have given the algorithm in Section 5, which in essence is similar to pseudocode I guess? 3. Sorry I was updating my 'Applications' section when you wrote this. I hope that answers your question now. Thanks and regards, Ritika

RitikaJain (talk)02:22, 5 February 2016