O'Reilly logo
  • Vasanth M H thinks this is interesting:

By extending this reasoning, it can be mathematically shown that the maximum number of binary questions needed to reduce uncertainty is essentially log(T), where the log is taken to base 2 and T is the number of possible outcomes


Cover of Predictive Analytics and Data Mining


Not Sure.. Find Out