Skip to main content

Machine Learning : A modern aspects to life and digital world ! Part I

DEFINITION:
The definition of Machine Learning(ML) in simple words is that " To give Computer ability to learn for experiences without being explicitly programmed ".
What ML actually mean is : 

                                        (lol 😂)

BREAKDOWN OF KEYWORDS:
There are two keywords which are 'learn from experiences' and the second one is 'explicitly programmed'. So what is the meaning of those two words first is 'learn from experiences', that is if you are doing something (habitual), you need to practice (train), we need to make computers do the same like to train in a football ground! 😂 Hell no! learn from its statistical interference, and the second keyword was that 'explicitly programmed', which we do in programming and coding we make our pc to perform some task by commands, which we don't do it here, 

The way we try to understand it vs what it is:
New Computer geeks come and try to learn python first and libraries go to sci-kit learn and boom, that's not ML at all. Actually, ML is something : 


Yes, you see it right, It's all about statistics, did I mention about Artificial Intelligence? Oh Sorry, Artificial Intelligence aka AI is sometimes called machine intelligence, is intelligence demonstrated by machines, unlike the natural intelligence displayed by humans and animals. Leading AI textbooks define the field as the study of "intelligent agents": any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals.
Machine Learning is like doing the same thing to gain experience and learn from these experiences, 
Wait a minute who are you?


Why it is important to learn?
Actually, in this changing world, we want to automate everything with first processing, the machine is learning actually, While many machine learning algorithms have been around for a long time, the ability to automatically apply complex mathematical calculations to big data – over and over, faster and faster – is a recent development. Here are a few widely publicized examples of machine learning applications you may be familiar with:
  • The heavily hyped, self-driving Google car? The essence of machine learning.
  • Online recommendation offers such as those from Amazon and Netflix? Machine learning applications for everyday life.
  • Knowing what customers are saying about you on Twitter? Machine learning combined with linguistic rule creation.
  • Fraud detection? One of the more obvious, important uses in our world today
And it is here:


Let's make this article short we will cover Part 2 in the next article, until then Happy Coding!

Comments

Popular posts from this blog

Postfix Evaluation(Single or Multi Digit) using STACK in C

POSTFIX EVALUATION WITH SINGLE OR MULTI DIGIT: Students find difficulties in finding the correct code for Postfix evaluation using Stack which works for Single as well for multidigit also; So here is the Question Format Given::- Question_2; Data_Structure:  Write a C program to evaluate the following POSTFIX expression. Use STACK to solve this problem.  INPUT: 5 6 2 + * 12 4 / -  OUTPUT: 37 Basic Understanding: Here is the Correct code:

STACK in C

IMPLEMENTATION OF STACK USING ARRAY Here is Example of Source Code of Data Structure-1, Question 1: Data_structure :  Write a C program to implement STACK using an array. This program must include the following functions in it. Write a function for “Push” operation.   Write a function for “Pop” operation.  Write a function for “Display” operation which prints the content of the STACK.    Basic Understanding : Push and Pop Operation: Here is How to Implement:                                                   

Combinatorics For Programmers and Coders

Hey! Computer Geeks! Here we will discuss two or more special numbers that made the way of coding easy, Introduction to Catalan Numbers: The Catalan numbers are a sequence of positive integers that appear in many counting problems in combinatorics. They count certain types of lattice paths, permutations, binary trees, and many other combinatorial objects. They satisfy a fundamental recurrence relation and have a closed-form formula in terms of binomial coefficients. The Catalan number Cn describes, among other things: The number of binary trees with n nodes, The number of ways in which parentheses can be placed in a sequence of n+ 1 numbers to be multiplied two at a time, The number of well-formed reverse Polish expressions with n operands and n + 1 operators, The number of paths in a grid from (0, 0) to (n, n), increasing just one coordinate by one at each step, without crossing the main diagonal,  The number of n-bit sequences that the number of 1s never exceeds the numbe