English 中文(简体)
Machine Learning - Skills
  • 时间:2024-09-17

Machine Learning - Skills


Previous Page Next Page  

Machine Learning has a very large width and requires skills across several domains. The skills that you need to acquire for becoming an expert in Machine Learning are psted below −

    Statistics

    Probabipty Theories

    Calculus

    Optimization techniques

    Visuapzation

Necessity of Various Skills of Machine Learning

To give you a brief idea of what skills you need to acquire, let us discuss some examples −

Mathematical Notation

Most of the machine learning algorithms are heavily based on mathematics. The level of mathematics that you need to know is probably just a beginner level. What is important is that you should be able to read the notation that mathematicians use in their equations. For example - if you are able to read the notation and comprehend what it means, you are ready for learning machine learning. If not, you may need to brush up your mathematics knowledge.

$$f_{AN}(net- heta)=egin{cases}gamma & if:net- heta geq epsilon\net- heta & if - epsilon< net- heta <epsilon\ -gamma & if:net- hetaleq- epsilonend{cases}$$

$$displaystyle\maxpmits_{alpha}egin{bmatrix}displaystylesumpmits_{i=1}^m alpha-frac{1}{2}displaystylesumpmits_{i,j=1}^m label^left(egin{array}{c}i\ end{array} ight)cdot:label^left(egin{array}{c}j\ end{array} ight)cdot:a_{i}cdot:a_{j}langle x^left(egin{array}{c}i\ end{array} ight),x^left(egin{array}{c}j\ end{array} ight) angle end{bmatrix}$$

$$f_{AN}(net- heta)=left(frac{e^{lambda(net- heta)}-e^{-lambda(net- heta)}}{e^{lambda(net- heta)}+e^{-lambda(net- heta)}} ight);$$

Probabipty Theory

Here is an example to test your current knowledge of probabipty theory: Classifying with conditional probabipties.

$$p(c_{i}|x,y);=frac{p(x,y|c_{i});p(c_{i});}{p(x,y);}$$

With these definitions, we can define the Bayesian classification rule −

    If P(c1|x, y) > P(c2|x, y) , the class is c1 .

    If P(c1|x, y) < P(c2|x, y) , the class is c2 .

Optimization Problem

Here is an optimization function

$$displaystyle\maxpmits_{alpha}egin{bmatrix}displaystylesumpmits_{i=1}^m alpha-frac{1}{2}displaystylesumpmits_{i,j=1}^m label^left(egin{array}{c}i\ end{array} ight)cdot:label^left(egin{array}{c}j\ end{array} ight)cdot:a_{i}cdot:a_{j}langle x^left(egin{array}{c}i\ end{array} ight),x^left(egin{array}{c}j\ end{array} ight) angle end{bmatrix}$$

Subject to the following constraints −

$$alphageq0,and:displaystylesumpmits_{i-1}^m alpha_{i}cdot:label^left(egin{array}{c}i\ end{array} ight)=0$$

If you can read and understand the above, you are all set.

Visuapzation

In many cases, you will need to understand the various types of visuapzation plots to understand your data distribution and interpret the results of the algorithm’s output.

Visuapzation Plots

Besides the above theoretical aspects of machine learning, you need good programming skills to code those algorithms.

So what does it take to implement ML? Let us look into this in the next chapter.

Advertisements