views:

186

answers:

4

Hey! I couldn't find an answer to this problem so I'm asking it here:

I have a Bayesian Classifier programmed in Python, the problem is that when I multiply the features probabilities I get VERY small float values like 2.5e-320 or something like that, and suddenly it turns into 0.0. The 0.0 is obviously of no use to me since I must find the "best" class based on which class returns the MAX value (greater value).

What would be the best way to deal with this? I thought about finding the exponential portion of the number (-320) and if it goes to low, multiplying the value by 1e20 or some value like thath. But maybe there is a better way?

+2  A: 

Take a look at Decimal from the stdlib.

from decimal import Decimal, getcontext

getcontext().prec = 320

Decimal(1) / Decimal(7)

I am not posting the results here as it is quite long.

ikanobori
+6  A: 

Floating point numbers don't have infinite precision, which is why you saw the numbers turn to 0. Could you multiply all the probabilities by a large scalar, so that your numbers stay in a higher range? If you're only worried about max and not magnitude, you don't even need to bother dividing through at the end. Alternatively you could use an infinite precision decimal, like ikanobori suggests.

I82Much
+14  A: 

Would it be possible to do your work in a logarithmic space? (For example, instead of storing 1e-320, just store -320, and use addition instead of multiplication)

recursive
Hey! Your solution seems great. It's very straightforward and seems quite easy to try. Thanks! I will try it.
Pavel
+6  A: 

What you describe is a standard problem with the naive Bayes classifier. You can search for underflow with that to find the answer. or see here.

The short answer is it is standard to express all that in terms of logarithms. So rather than multiplying probabilities, you sum their logarithms.

You might want to look at other algorithms as well for classification.

Muhammad Alkarouri
erm, you sum their logarithms, not their algorithms.
Adriano Varoli Piazza
@Adriano: oops! @recursive: thanks!
Muhammad Alkarouri
Hey! thanks a lot for the answer, I will look into that, as it address my problem exactly. I was thinking that it should be common since I am multiplying probabilities like 3.14e-05 multiple times, so they reach e-300 levels (for example) pretty fast, even more when I have a lot of features in my classifier.
Pavel
Yeah as recursive also mentioned, this is tackled by using the logarithms and adding the probabilities. In the link provided by Muhammad it's all explained. Thanks everyone for your answers!
Pavel