Skip to main content

Introduction to Machine Learning

Salmo Aliko .
today I'll write about Machine Learning , it is interesting topic. I put assumption I'm talking to computer since students.
first of all , many of us dreamed to make robot, auto detection for missiles and treat it automatically and many awesome dreams, but we didn't know how achieve it.

let me start with the definition and mentioning some of ML -Machine Learning - applications .
What is Machine Learning? 
 is the ability to learn without being explicitly programmed 
 and if we like mentioning more formal definition it is 
 A computer program is said to learn from experience E with respect to some class of tasks T and performance measure P, if its performance at tasks in T, as measured by P, improves with experience E.
application of ML :

  • Computer Vision.
  • Natural Language Processing.
  • Game playing.
  • Market segmentation.
  • Medical Diagnosis.  
  • Stock Market Analysis.
  • Search Engines.
  • Robotics.
One word describing this applications just "awesome".

Machine Learning can be classified into 3 main categories .

  1. Supervised Learning.
  2. Unsupervised Learning.
  3. Reinforcement Learning.
lets talk in brief about each category :
  1. Supervised learning : we have a data set labeled i.e. ( input and correct output ) using this data set given new data not labeled  expected the output is correct for example neural networks.
  2. Unsupervised Learning : you are given a data set not labeled you find appropriate structure then given another data you should output good estimation for example market segmentation.
  3. Reinforcement Learning : you are given data set using Learning algorithms you can judge either the output is right or is wrong and every time the algorithm will learn for example :
  • robot driving car at turning the robot made the angle very acute so he made an accident the learning algorithm will know this is wrong at the next time the angle will not be acute, after many iterations he will know that the right angle is obtuse "Eng Ali Al kahki ".
after that I hope I gave you good intuition about Machine Learning.

if you like this Article share it.

I owned by  a great Thanks to Eng Ali Al Kahki, the person who explained this concepts and the best prof.  I have ever seen prof. Andrew Ng.

Thanks for reading.

Ahmed Ghazey.

Comments

Post a Comment

Popular posts from this blog

DevExpress C# Chart Tutorial

Hello , this blog post about Charting in DevExpress , I faced many problems I visited hundreds of pages to solve this problems , actually it was the first time I use DevExpress Charts, Work is not like school or university , in school if you don't know thing you can learn it any time you want , in work you have to do today task yesterday, I like to share my knowledge and skills with you , I hope this Post help you . // clear series on chart  chart.Series.Clear(); // clear Titles of chart chart.Titles.Clear(); // legend alignment  chart.Legend.AlignmentHorizontal = LegendAlignmentHorizontal.Center; chart.Legend.AlignmentVertical = LegendAlignmentVertical.Bottom; chart.Legend.Direction = LegendDirection.LeftToRight; // creating series // series view Type example Line DevExpress.XtraCharts.Series series = new DevExpress.XtraCharts.Series("series name ", ViewType.Line); // add title  DevExpress.XtraCharts.ChartTitle chtTitle = new DevExpress.XtraCharts.Cha...
3 comments
Read more

Recursion

Recursion is a programming technique which function calls itself , this seems strange , however it is one of the most interested and effective technique in programming. it helps you write code in less statements and provides unique conceptual frame work to solve problems. lets discus some problems to know how it works : first example Triangular Numbers : it is series like : 1,3,6,10,15,21........ etc our program should get the nth term in the series, the numbers in this series called triangular numbers due to they can be visualized as a triangle. triangular numbers fig 1 finding the nth term using a loop see this figure : loop adding 1+2+3+4 and so on code is easy  , a loop will add numbers from n to 0 like this int triangle(int n) { int total = 0; while(n > 0) // until n is 1 { total = total + n; // add n (column height) to total --n; // decrement column height } return total; } it easy enough and for sure it is fast . before we start the recu...
2 comments
Read more

LeetCode Problem #19 Remove Nth Node From End of List

Solution for LeetCode Problem #19 Remove Nth Node From End of List it is linked list problem can be solved with multiple solutions, but I'm gonna solve it with fastest solution in java. Problem link we should assign dummy_head it is common while solving linked list problems  Assign 2 iterators slow and fast both equals to dummy_head we don't know the length of the list but we know it is always valid, so we will move with a window of size n+1 when we reach the end by the fast iterator the slow iterator will be in the node n+1 from the last , right? we will assign slow.next to be equal slow.next.next we are dropping the node n from last, got it? we will return dummy_head.next Thank you, AhmedG
Post a Comment
Read more