Explore and Learn Machine Learning Concept

Let's discuss some terms and their definitions related to statistics and probability. It will help us in brushing our concepts of probability which are essential for machine learning algorithms Definition of Probability  Probability is a numerical measurement which indicates the chances of occurrence of an event, say A. It is denoted by P(A). It is the ratio of favorable outcomes of an event A say m to the total outcomes of the experiment say n. P(A) = m/n where m represents the number of favorable outcomes of an event A and n is the total number of outcomes of the experiment. Let's understand the experiment term in more details now. An operation that results in a definite outcome is called an experiment E.g.  Tossing a coin is an experiment as it can have two outcomes either Head or Tail and it is definite in number. Throwing a fair dice is an experiment as it can have only 6 outcomes which is definite in number. Random Experiment When the outcome of an ex...

In my last blog we have discussed how we can use TF - IDF method implementation using python for more details refer [ TF - IDF Implementation Using Python  ]. In this blog we will discuss how to deal with spelling correction to do the stemming or lemmatization effectively.  There is a concept known as "Edit Distance". "Edit distance is the minimum number of edits required to one string to another string". We can perform following types of operations Insertion of a letter Deletion of a letter Modification of a letter Let's take an example to understand this concept in more detail. "success" is written as "sucess". We have two strings one with length 7 [with correct spelling] and another with length 6 [ with incorrect spelling].  Step 1:   If the string of length M and N then we need to create the matrix of size (M+1) and (N+1). In our case we will create the matrix of size 7 X 8 as follows. Step 2: Initialize the first row and first column st...

In my last blog we have discussed how we can use TF - IDF method to extract the features of text, refer to - TF - IDF Method . Now we will see how can we implement the TF - IDF concept using python. Let's consider the same three sentences which we have discussed in our last blog to understand TF-IDF implementation in python. Kesri is a good movie to watch with family as it has good stories about India freedom fight. The success of it depends on the performance of the actors and story it has. There are no new movies releasing this month due to corona virus. The first step is to import the necessary libraries to perform the text processing. import pandas as pd from nltk.tokenize import word_tokenize from nltk.corpus import stopwords from sklearn.feature_extraction.text import TfidfVectorizer You must have already noticed that we have imported TfidfVectorizer to extract the text features using TF-IDF.  Second step is to store the sentences in the list: documents = ["Kesri is a go...

In my last blog we have discussed about how can we create the bag of words using python [refer this link  CreatingBag-of-Words using Python  ]. Now we have seen that bag-of-word approach is purely dependent on the frequency of words. Now let’s discuss another approach to convert the textual data into matrix format, it called us TF-IDF [Term Frequency – Inverse document Frequency] and it is the most preferred way used by most of data scientist and machine learning professionals. In this approach we consider a term is relevant to document if that term appears frequently in the document and term is unique to document i.e. term should not appear in all the documents. So its frequency considering with respect to all documents should be small and term frequency for specific document should be high. TF-IDF score is calculated as follows: Term frequency of a term (t) in a document (d).   Inverse document frequency of a term   Below are formulas for calculating the and...

In my last two blog we have discussed about the bag of words method for extracting features from text [refer this link  Feature Extraction - Text- Bag of word  ] and stemming and lemmatization techniques to avoid the redundant token problem [ refer this link Stemming and Lemmatization ] . Now it’s time to apply those concepts using python and see the things in action: We are going to explore below three options Let’s consider following three sentences: Kesri is a good movie to watch with family as it has good stories about India freedom fight. The success of a movie depends on the performance of the actors and story it has. There are no new movies releasing this month due to corona virus. Using above three sentences we will extract the Bag-of-words by applying the concepts of tokenization, stemming and lemmatization. So let’s get started: Step 1: Import the libraries word_tokenize for tokenization stopwords for stop words and CountVectorizer for creating bag-of words. #...

In my last blog we have discussed,  bag of words method for extracting features from text [refer this link  Feature Extraction - Text- Bag of word  ]. The drawback of bag of word method is size of bow matrix due to redundant tokens. if we will use these redundant tokens in building any machine learning model, it will be inefficient or will not perform good. To solve redundant token problem we can use "Stemming" and "Lemmatization" Stemming  Stemming  technique makes sure that different variations of word are represented by a single word. E.g. run, ran, running are represented by the single word "run". So the process of reducing the inflected forms of word to its root or stem word is called as Stemming . Root/Stem Word Variations of root word Gain Gained, gaining, gainful Do Do, done, doing, does Mr. Martin Stemmer had developed an algorithm for performing the stemming process to...

In my last blog we have seen how can we generate the tokens.[Refer link:  Tokenization ] Now its time to discuss how can we convert the textual data into matrix form which can be understandable by machine learning algorithms. Let's get started with method known as "Bag-of-Words". The idea behind this method is that  "Any piece of text can be represented by list of words or tokens used in it".  Before we move forward, I just want us to revise power law[Reference Link: Power Law ] discussed earlier in my blog where we discussed that stopwords are not important and does not provide any useful information about the piece of text or document. Before converting the textual data into matrix form we should remove all the stopwords from the list of tokens. Let's understand bag of words in more detail considering the following sentence: Tiger is the biggest wild animal in the cat family. If we generate tokens for above sentence after removing the stopwords th...