Classification by Clustering (CbC): An Approach of Classifying Big Data based on Similarities

Abstract

Data classification in supervised learning is the process of classifying data for data mining task that helps to analyses data for decision making. The objective of a classification model is to correctly predict the categorical class labels of known/ unknown instances. In machine learning for data mining applications, the classification models are trained based on labelled training data sets. In this paper, we have investigated if we can build a classification model based on the similarities of the instances instead of class labels of instances. Data labeling is always very costly and time consuming process, and it's become very difficult task if the data is big data. The proposed approach clusters the big data and builds the classifier based on the clusters without considering the class labels, which basically improve the performance of the classifier. However, we can relate the clusters with class labels. We have collected 10 big data from the UC Irvine machine learning repository for experimental analysis and applied three popular decision tree induction algorithms: ID3 (Iterative Dichotomiser 3), C4.5 (extension of ID3 algorithm), and CART (Classification & Regression Tree) for classifier construction.