Model Evaluation and Selection

Model Process : 

 




In decision maker process, we follow f : x → y and Real world process (RWP) tends to the population.

After building a model, we need to know, how accurate the model is expected to be on population. For that, here comes the Confusion Matrix

Here we are getting 88 out of 100 as correct, therefore the 

                      Accuracy = 88/100 = 0.88

we need to check whether the accuracy will be fine for model, for that we check Expected Accuracy.

                               E[x] = Σx P(x)X

                               h(x(vector)) = y (Actual)

Goal to be achieved here is   h(x(vector)) = f(x(vector)) for each x belongs to population.

 h(x(vector)) = y , E [h(x(vector)) = f(x(vector))] for each x belongs to population. 

Here, E[h(x(vector)) = f(x(vector))] says that how much we have predicted correctness on unseen data.

 When we have data we split it into two categories :

  • Training Data
  • Test Data
As we don't know the distribution, functional form and parameters then, it is difficult or not possible to calculate the Expected value. For that Neural Network is capable on this, this process is also known as Universal Approximation. For building a model and for evaluating it we need a sample.

Central Limit Theory :  It allows to estimate the accuracy from the unseen data. If you have n (x,x,.......,x) random variables and they have mean and σ associated with it  then 

                 mean  = θ

                      σ =    θ (1- θ) / √n , where n is the size of the data.

Given we have normal distribution : 

 



             Zσ = 1.96

we took 95% because we are sure that our accuracy of model here lies between 0.768 and 0.832. 

Therefore, the Confidence Interval , which defines the accuracy of model will be : 

                   [0.768 , 0.832 ]  = Confidence Interval

Accuracy for set of n random variables should be reported using Confidence Interval that is :  

                                 [ μ -zσ  , μ + zσ]

where μ is Accuracy

and zσ is  √Accuracy(1-Accuracy) / √n

Width of confidence interval depends on the Size of data


 

Comments

Post a Comment

Popular posts from this blog

Supervised Learning(Part-5)

Image
  Decision Trees (Continued) Attribute Selection Measures If the dataset consists of N attributes then deciding which attribute to place at the root or at different levels of the tree as internal nodes is a complicated step. By just randomly selecting any node to be the root can’t solve the issue. If we follow a random approach, it may give us bad results with low accuracy. For solving this attribute selection problem, researchers worked and devised some solutions. They suggested using some criteria like : Entropy, Information gain, Gini index, Gain Ratio, Reduction in Variance Chi-Square These criteria will calculate values for every attribute. The values are sorted, and attributes are placed in the tree by following the order i.e, the attribute with a high value(in case of information gain) is placed at the root. While using Information Gain as a criterion, we assume attributes to be categorical, and for the Gini index, attributes are assumed to be continuous. Entropy Entropy is a me
Read more

Supervised Learning(Part-2)

Image
  Support Vector Machine A Support Vector Machine (SVM) is a discriminative classifier formally defined by a separating hyperplane. In other words, given labeled training data, the algorithm outputs an optimal hyperplane which categorizes new examples.  In two dimensional space this hyperplane is a line dividing a plane in two parts where in each class lay in either side. Suppose given plot of two label classes on graph as shown in image. You might have come up with something similar to following image (image B). It fairly separates the two classes. Any point that is left of line falls into black circle class and on right falls into blue square   In real world application, finding perfect class for millions of training data set takes lot of time. This is called regularization parameter.  Two terms regularization parameter and gamma are tuning parameters in SVM classifier. Varying those we can achieve considerable non linear classification line with more accuracy in reasonable amount of
Read more

Text Analysis (Part - 4)

Image
  The article covers a very important concepts of Text Analysis from Bayesian's i.e the  Latent Dirichlet Allocation  which is the part of topic modelling . What is Topic Modelling? Topic modelling is a type of statistical modelling for discovering the abstract “topics” that occur in a collection of documents. This can be useful for search engines, customer service automation, and any other instance where knowing the topics of documents is important . Thus, Topic Models , in a nutshell, are a type of statistical language models used for uncovering hidden structure in a collection of texts. There are multiple methods of for topic modelling and one of them includes Latent Dirichlet Allocation (LDA) . Latent Dirichlet Allocation Latent Dirichlet Allocation (LDA) is an example of topic model and is used to classify text in a document to a particular topic. It builds a topic per document model and words per topic model, modelled as Dirichlet distributions. Basic Idea LDA is a  genera
Read more