Essay On Binary Classification

952 Words2 Pages

Classification is a supervised leaning process where the data is grouped against a known class tag. It is a task consists of discovering knowledge that can be used to forecast the class of a record whose class identify is unknown. In mammogram image classification it is used to categorize the images under different class tags depending on the characteristics of image. Classification is discrete and do not entail any order and continuous and floating point would designate a numerical target rather than categorical.
Classification is divided into two types as
i) Binary classification ii) Multi label classification.
In binary classification the data is predicted into two classes or categories. For example, in image classification it is categorized in to normal or abnormal whereas in multi label classification the data is grouped in to more than two categories such as normal, abnormal or fatty etc.
The attribute set used in classification process is partitioned into two disjoint sets as test set and training set. The test set contains the attribute set with class predefined class label. Normally, the class tag arrives from prior experiential data. The test data can be represented as: (a1, a2, …, an; c), where ai is the attribute c represents the class. Even though the class tags of these testing data are unknown, the classes that these data belong can be predicted. As shown in the figure 5.1, a classification model can be considered as a black box that automatically assigns a class tag when a attribute set of unknown classes is provided. The classification step in data mining consist of two phases as given below
1) Training Phase
2) Testing Phase
Training phase is learning step where a training model is constructed by the cla...

... middle of paper ...

...xed group of properties or attributes .
• Predefined classes : the target class tags has distinct output values (Boolean or multiclass)
• Adequate data: enough training cases should be present to train the model.
• Internal node: specifies a test on a single attribute
• Leaf node: designates the value of the target attribute
• Branch(Edge): split of one attribute
• Path: a disjunction of test to make the final decision
• Decision trees perform classification by starting at the root of the tree and moving through it until a leaf node.
• Selection of an attribute to test at each node - choosing the most useful attribute for classifying examples.
• Information gain- measures how well a given attribute separates the training examples according to their target classification. This measure is used to select the best attributes at each step when mounting the tree.

More about Essay On Binary Classification

Open Document