Scribd
Upload
3 views3 pages

Classifiers

The document discusses classifiers, which are algorithms that categorize data into labeled classes, with spam filters as a practical example. It outlines five common types of classification algorithms: Naive Bayes, Decision Tree, Artificial Neural Networks, Support Vector Machine, and K-Nearest Neighbor, each with unique mechanisms and applications. The text emphasizes the importance of selecting the appropriate classifier based on the specific dataset and task requirements.

Uploaded by

tashuy21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views3 pages

Classifiers

The document discusses classifiers, which are algorithms that categorize data into labeled classes, with spam filters as a practical example. It outlines five common types of classification algorithms: Naive Bayes, Decision Tree, Artificial Neural Networks, Support Vector Machine, and K-Nearest Neighbor, each with unique mechanisms and applications. The text emphasizes the importance of selecting the appropriate classifier based on the specific dataset and task requirements.

Uploaded by

tashuy21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

A classifier is any algorithm that sorts data into labeled classes, or

categories of information.
A simple practical example are spam filters
that scan incoming “raw” emails and classify them as either “spam” or “not-
spam.”
Classifiers are a concrete implementation of pattern recognition in many
forms of machine learning.

Since no single form of classification is appropriate for all datasets, a vast


toolkit of off-the-shelf classifiers are available for developers to experiment
with.

five common types of classification algorithms:

1. Naive Bayes classifier

Naive Bayes classifiers use probability to predict whether an input will fit into a
certain category. The Naive Bayes algorithm family includes a range of different
classifiers based on a theorem of probability. These classifiers can determine the
probability of an input fitting into one or more categories.

In multiple category scenarios, the algorithm reviews the probability that a data point
fits into each classification. After comparing the probability of a match in each
category, it outputs the category that is most likely to match the given text.

Many companies use this type of algorithm to assign tags to text segments like email
subject lines, customer comments and articles.

2. Decision tree

A decision tree is a classification algorithm that uses a process of division to split


data into increasingly specific categories. It's called a decision tree because the
classification process resembles a tree's branches when represented graphically.
The algorithm works on a supervised model and requires high-quality data to
produce good results.

Since the primary goal of a decision tree is to make increasingly specific distinctions,
it has to continuously learn new classification rules. It learns these rules by applying
if-then logic to training data. The algorithm continues the classification process until it
reaches a designated stopping condition.

3.Artificial neural networks


Artificial neural networks (ANNs) are computing frameworks made up of many
individual algorithms.

Their mechanism of action mimics how human brains work, and includes a collection
of artificial neurons that transmit signals.

This makes artificial neural networks capable of solving extremely complex problems
that involve multiple layers. Because of their complexity, it can be challenging to train
and adjust ANNs, and it often requires large amounts of training data. However, a
fully trained ANN can perform tasks that would be impossible for single algorithms.

4. Support vector machine

A support vector machine (SVM) is a simple algorithm that professionals


can use for classification or regression activities.

They work by finding hyperplanes within a data distribution, which you can
visualize as a line separating two different classes of data.

There are often many hyperplanes capable of separating the data, and the
algorithm will select the optimum line of separation. In the SVM model, the
optimum hyperplane is the dividing line that offers the greatest margin
between the different classes.

SVMs are capable of working in multiple dimensions if they are unable to


find an ideal hyperplane to separate the data into two dimensions. This
makes them extremely effective for creating classifications from
complicated data distributions. The more complex the data inputs are, the
more accurate the SVM becomes, making them excellent machine learning
tools.

5. K-nearest neighbor

K-nearest neighbor (KNN) is a supervised lazy learner algorithm used in


machine learning. This means that it stores the training data that
supervisors present and compares it to other data to make predictions.

While the training period for these algorithms is often shorter than for
"eager learners," they're often slower to make predictions.

After storing its training data, a KNN algorithm compares it with test data
and measures the degree of similarity between them. It then stores all
instances that correspond with the training data. Next, the algorithm
attempts to predict the likelihood that future data will correspond to the
dataset it compiled. While this algorithm is common in classification, many
professionals also use it to complete regression tasks.

You might also like