A TECHNICAL REPORT

ON
“MACHINE LEARNING”

Submitted in partial fulfillment of the requirements

for the Continuous Assessment (CA)

Submitted By
Student Name, Roll No

Department of Computer Science Engineering

Mallabhum Institute of Technology

Braja Radhanagar, P.O-Gossaipur

Bishnupur, Bankura
 ACKNOWLEDGEMENT

I acknowledge all the faculty members of this institute for their constant encouragement, valuable
suggestions and moral support to prepare this report on given subject topic. I am indeed proud and fortunate
to be supported by corresponding subject teacher to complete this report.

Student Name:
Roll Number :
SL. No Topics Page No
1. Introduction, History of Machine Learning, Types of Machine 4
Learning
2. Supervised, Unsupervised, Reinforcement and Semi Supervised 5
Learning
3. Literature Survey 6
4. Application of Machine Learning 7
5. Conclusion and References 8
Table of Contents
 Introduction
Machine Learning is the science of getting computers to learn without being explicitly programmed. It is
closely related to computational statistics, which focuses on making prediction using computer. In its
application across business problems, machine learning is also referred as predictive analysis. Machine
Learning is closely related to computational statistics. Machine Learning focuses on the development of
computer programs that can access data and use it to learn themselves. The process of learning begins with
observations or data, such as examples, direct experience, or instruction, in order to look for patterns in data
and make better decisions in the future based on the examples that we provide. The primary aim is to allow
the computers learn automatically without human intervention or assistance and adjust actions accordingly.

History of Machine Learning

The name machine learning was coined in 1959 by Arthur Samuel [1]. Tom M. Mitchell [2] provided a
widely quoted, more formal definition of the algorithms studied in the machine learning field: "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." This
follows Alan Turing's proposal in his paper "Computing Machinery and Intelligence", in which the question
"Can machines think?" is replaced with the question "Can machines do what we (as thinking entities) can
do?". In Turing’s proposal the characteristics that could be possessed by a thinking machine and the various
implications in constructing one are exposed.

Types of Machine Learning

The types of machine learning algorithms differ in their approach, the type of data they input and output, and
the type of task or problem that they are intended to solve. Broadly Machine Learning can be categorized
into four categories.
I. Supervised Learning
II. Unsupervised Learning
III. Reinforcement Learning
IV. Semi-supervised Learning

Machine learning enables analysis of massive quantities of data. While it generally delivers faster, more
accurate results in order to identify profitable opportunities or dangerous risks, it may also require additional
time and resources to train it properly.
4
 Supervised Learning

Supervised Learning is a type of learning in which we are given a data set and we already know what are
correct output should look like, having the idea that there is a relationship between the input and output.
Basically, it is learning task of learning a function that maps an input to an output based on example input-
output pairs. It infers a function from labeled training data consisting of a set of training examples.
Supervised learning problems are categorized

Unsupervised Learning

Unsupervised Learning is a type of learning that allows us to approach problems with little or no idea what
our problem should look like. We can derive the structure by clustering the data based on a relationship
among the variables in data. With unsupervised learning there is no feedback based on prediction result.
Basically, it is a type of self-organized learning that helps in finding previously unknown patterns in data set
without pre-existing label.

Reinforcement Learning

Reinforcement learning is a learning method that interacts with its environment by producing actions and
discovers errors or rewards. Trial and error search and delayed reward are the most relevant characteristics
of reinforcement learning. This method allows machines and software agents to automatically determine the
ideal behavior within a specific context in order to maximize its performance. Simple reward feedback is
required for the agent to learn which action is best.

Semi-Supervised Learning

Semi-supervised learning fall somewhere in between supervised and unsupervised learning, since they use
both labeled and unlabeled data for training – typically a small amount of labeled data and a large amount of
unlabeled data. The systems that use this method are able to considerably improve learning accuracy.
Usually, semi-supervised learning is chosen when the acquired labeled data requires skilled and relevant
resources in order to train it / learn from it. Otherwise, acquiring unlabeled data generally doesn’t require
additional resources.

5
 Literature Survey
Theory
A core objective of a learner is to generalize from its experience. The computational analysis of machine
learning algorithms and their performance is a branch of theoretical computer science known as
computational learning theory [4]. Because training sets are finite and the future is uncertain, learning theory
usually does not yield guarantees of the performance of algorithms. Instead, probabilistic bounds on the
performance are quite common. The bias–variance decomposition is one way to quantify generalization
error.
For the best performance in the context of generalization, the complexity of the hypothesis should match the
complexity of the function underlying the data. If the hypothesis is less complex than the function, then the
model has under fit the data. If the complexity of the model is increased in response, then the training error
decreases. But if the hypothesis is too complex, then the model is subject to overfitting and generalization
will be poorer.
In addition to performance bounds, learning theorists study the time complexity and feasibility of learning.
In computational learning theory, a computation is considered feasible if it can be done in polynomial time.
There are two kinds of time complexity results. Positive results show that a certain class of functions can be
learned in polynomial time. Negative results show that certain classes cannot be learned in polynomial time.

The Challenges Facing Machine Learning

While there has been much progress in machine learning, there are also challenges. For example, the
mainstream machine learning technologies are black-box approaches, making us concerned about their
potential risks. To tackle this challenge, we may want to make machine learning more explainable and
controllable. As another example, the computational complexity of machine learning algorithms is usually
very high and we may want to invent lightweight algorithms or implementations. Furthermore, in many
domains such as physics, chemistry, biology, and social sciences, people usually seek elegantly simple
equations (e.g., the Schrödinger equation) to uncover the underlying laws behind various phenomena.
Machine learning takes much more time. You have to gather and prepare data, then train the algorithm.
There are much more uncertainties. That is why, while in traditional website or application development an
experienced team can estimate the time quite precisely, a machine learning project used for example to
provide product recommendations can take much less or much more time than expected. Why? Because
even the best machine learning engineers don’t know how the deep learning networks will behave when
analyzing different sets of data. It also means that the machine learning engineers and data scientists cannot
guarantee that the training process of a model can be replicated.
6
 Applications of Machine Learning
Machine learning is one of the most exciting technologies that one would have ever come across. As it is
evident from the name, it gives the computer that which makes it more similar to humans: The ability to
learn. Machine learning is actively being used today, perhaps in many more places than one would expect.
We probably use a learning algorithm dozen of time without even knowing it. Applications of Machine
Learning include:
 Web Search Engine: One of the reasons why search engines like Google, Bing etc. work so well is
because the system has learnt how to rank pages through a complex learning algorithm [5].
 Photo tagging Applications: Be it Facebook or any other photo tagging application, the ability to
tag friends makes it even more happening. It is all possible because of a face recognition algorithm
that runs behind the application [6].
 Spam Detector: Our mail agent like Gmail or Hotmail does a lot of hard work for us in classifying
the mails and moving the spam mails to spam folder. This is again achieved by a spam classifier
running in the back end of mail application [7][8][9].

7
 Conclusion
Machine learning is a growing technology which enables computers to learn automatically from past data.
Machine learning uses various algorithms for building mathematical models and making predictions
using historical data or information. Currently, it is being used for various tasks such as image
recognition, speech recognition, email filtering, Facebook auto-tagging, recommender system, and
many more.

References
[1] https://expertsystem.com/
[2] https://www.geeksforgeeks.org/
[3] https://www.wikipedia.org/
[4] https://www.coursera.org/learn/machine-learning
[5] https://machinelearningmastery.com/
[6] https://machinelearningmastery.com/
[7] https://towardsdatascience.com/machine-learning/home

[8] El-Ghazali Talbi. 2021. Machine Learning into Metaheuristics: A Survey and Taxonomy. ACM Comput.
Surv. 54, 6, Article 129 (July 2022), 32 pages. https://doi.org/10.1145/3459664

[9] B. Adenso-Diaz and M. Laguna. 2006. Fine-tuning of algorithms using fractional experimental designs and
local search. Operat. Res. 54, 1 (2006), 99—114

[10] M. Adibi and J. Shahrabi. 2014. A clustering-based modified variable neighborhood search algorithm for a
dynamic job shop scheduling problem. Int. J. Adv. Manufact. Technol. 70, 9 (2014), 1955--1961