# naiveBayes.py
# -------------
# Licensing Information: Please do not distribute or publish solutions to this
# project. You are free to use and extend these projects for educational
# purposes. The Pacman AI projects were developed at UC Berkeley, primarily by
# John DeNero (denero@cs.berkeley.edu) and Dan Klein (klein@cs.berkeley.edu).
# For more info, see http://inst.eecs.berkeley.edu/~cs188/sp09/pacman.html

import util
import classificationMethod
import math

class NaiveBayesClassifier(classificationMethod.ClassificationMethod):
  """
  See the project description for the specifications of the Naive Bayes classifier.

  Note that the variable 'datum' in this code refers to a counter of features
  (not to a raw samples.Datum).
  """
  def __init__(self, legalLabels):
    self.legalLabels = legalLabels
    self.type = "naivebayes"
    self.k = 1 # this is the smoothing parameter, ** use it in your train method **
    self.automaticTuning = False # Look at this flag to decide whether to choose k automatically ** use this in your train method **

  def setSmoothing(self, k):
    """
    This is used by the main method to change the smoothing parameter before training.
    Do not modify this method.
    """
    self.k = k

  def train(self, trainingData, trainingLabels, validationData, validationLabels):
    """
    Outside shell to call your method. Do not modify this method.
    """

    # might be useful in your code later...
    # this is a list of all features in the training set.
    self.features = list(set([ f for datum in trainingData for f in datum.keys() ]));

    if (self.automaticTuning):
        kgrid = [0.001, 0.01, 0.05, 0.1, 0.5, 1, 5, 10, 20, 50]
    else:
        kgrid = [self.k]

    self.trainAndTune(trainingData, trainingLabels, validationData, validationLabels, kgrid)

  def trainAndTune(self, trainingData, trainingLabels, validationData, validationLabels, kgrid):
    """
    Trains the classifier by collecting counts over the training data, and
    stores the Laplace smoothed estimates so that they can be used to classify.
    Evaluate each value of k in kgrid to choose the smoothing parameter
    that gives the best accuracy on the held-out validationData.

    trainingData and validationData are lists of feature Counters.  The corresponding
    label lists contain the correct label for each datum.

    To get the list of all possible features or labels, use self.features and
    self.legalLabels.
    """

    "*** YOUR CODE HERE ***"
    classCount = util.Counter()

    totalTrain = 0
    for i in trainingLabels:
        classCount[i] += 1
        totalTrain += 1



    labelProbs = util.Counter()
    #makes list of probabilities for each label
    #p(y)
    for count in classCount:
        labelProbs[count] = (classCount[count]+0.0) / totalTrain

    self.labelProbs = labelProbs

    featureCount = util.Counter()
    #makes list of counts for each feature, its value, its label and the occurrences of all those together
    #c(Fi=fi,Y=y)

    for label in self.legalLabels:
        featureCount[label] = util.Counter()
        for index in range(len(trainingData)):
            if(trainingLabels[index] == label):
                for tup in trainingData[index].sortedKeys():
                    featureCount[label][(tup,trainingData[index][tup])]+=1


    self.featureCount = featureCount
    """
    smoothedFeatProb = util.Counter()
    #P(Fi=fi | Y = y)= (count(fi,y)+k)/(Forall vals of fi: count(fi',y)+k)
    for k in kgrid:
        for x,y in featureCount:

    """

    self.kval = .05 if len(self.legalLabels) > 2 else .00001
    #.00001 best for faces
    #.05, .01, .001 best for digits
    #[0.001, 0.01, 0.05, 0.1, 0.5, 1, 5, 10, 20, 50]



  def classify(self, testData):
    """
    Classify the data based on the posterior distribution over labels.

    You shouldn't modify this method.
    """
    guesses = []
    self.posteriors = [] # Log posteriors are stored for later data analysis (autograder).
    for datum in testData:
      posterior = self.calculateLogJointProbabilities(datum)
      guesses.append(posterior.argMax())
      self.posteriors.append(posterior)
    return guesses

  def calculateLogJointProbabilities(self, datum):
    """
    Returns the log-joint distribution over legal labels and the datum.
    Each log-probability should be stored in the log-joint counter, e.g.
    logJoint[3] = <Estimate of log( P(Label = 3, datum) )>

    To get the list of all possible features or labels, use self.features and
    self.legalLabels.
    """
    logJoint = util.Counter()


    for label in self.legalLabels:
        logJoint[label] = math.log(self.labelProbs[label])
        #print label, self.labelProbs[label], logJoint[label]
        for f in datum:

            countFY=self.kval
            #how many times feature i = datum(feature i) for label y
            totalFY=self.kval
            #how many different values of feature i for label y


            for key in self.featureCount[label]:
                feat,val = key
                if(feat == f):
                    totalFY +=1
                    if(val == datum[f]):
                        countFY+=1


            #print 'countFY', countFY, 'totalFY',totalFY
            #i may have to do something with the k's for totalFY

            #P(Fi=fi|Y=y)
            logProbOfFeature = math.log(countFY / totalFY)

            logJoint[label] += logProbOfFeature

    #util.raiseNotDefined()

    return logJoint

  def findHighOddsFeatures(self, label1, label2):
    """
    Returns the 100 best features for the odds ratio:
            P(feature=1 | label1)/P(feature=1 | label2)

    Note: you may find 'self.features' a useful way to loop through all possible features
    """
    featuresOdds = []

    "*** YOUR CODE HERE ***"
    util.raiseNotDefined()

    return featuresOdds
