Data Distribution Aware Classification Algorithm based on K-Means
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 9
Abstract
Giving data driven decisions based on precise data analysis is widely required by different businesses. For this purpose many different data mining strategies exist. Nevertheless, existing strategies need attention by researchers so that they can be adapted to the modern data analysis needs. One of the popular algorithms is K-Means. This paper proposes a novel improvement to the classical K-Means classification algorithm. It is known that data characteristics like data distribution, high-dimensionality, the size, the sparseness of the data, etc. have a great impact on the success of the K-Means clustering, which directly affects the accuracy of classification. In this study, the K-Means algorithm was modified to remedy the algorithm’s classification accuracy degradation, which is observed when the data distribution is not suitable to be clustered by data centroids, where each centroid is represented by a single mean. Specifically, this paper proposes to intelligently include the effect of variance based on the detected data distribution nature of the data. To see the performance improvement of the proposed method, several experiments were carried out using different real datasets. The presented results, which are achieved after extensive experiments, prove that the proposed algorithm improves the classification accuracy of KMeans. The achieved performance was also compared against several recent classification studies which are based on different classification schemes.
Authors and Affiliations
Tamer Tulgar, Ali Haydar, Ibrahim Ersan
Keywords
Related Articles
- EP ID EP261189
- DOI 10.14569/IJACSA.2017.080946
- Views 62
- Downloads 0
The Solution Structure and Error Estimation for The Generalized Linear Complementarity Problem
In this paper, we consider the generalized linear complementarity problem (GLCP). Firstly, we develop some equivalent reformulations of the problem under milder conditions, and then characterize the solution of the GLCP....
Vismarkmap – A Web Search Visualization Technique through Visual Bookmarking Approach with Mind Map Method
Due to the massive growth of information over the Internet, Bookmarking becomes the most popular technique to keep track of the websites with the expectation of finding out the previously searched websites easily wheneve...
Exploreing K-Means with Internal Validity Indexes for Data Clustering in Traffic Management System
Traffic Management System (TMS) is used to improve traffic flow by integrating information from different data repositories and online sensors, detecting incidents and taking actions on traffic routing. In general, two d...
The User Behavior Analysis Based on Text Messages Using Parafac and Block Term Decomposition
Tensor decompositions represent a start for big data analysis and a start in reduction of dimensionality, object detection, clustering and so on. This paper presents a method to study the behavior of users in the online...
A Novel Data Aggregation Scheme for Wireless Sensor Networks
Wireless sensor networks (WSN) consist of diverse and minute sensor nodes which are widely employed in different applications, for example, atmosphere monitoring, search and rescue activities, disaster management, untame...