Exploreing K-Means with Internal Validity Indexes for Data Clustering in Traffic Management System
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 3
Abstract
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 decision making systems-weights updating and forecasting are integrated inside the TMS. The models need numerous data sets for making appropriate decisions. To determine the dynamic road weights in TMS, four (4) different environmental attributes are considered, which are directly or indirectly related to increase the traffic jam– rain fall, temperature, wind, and humidity. In addition, peak hour is taken as an additional attribute. Usually, the data sets are classified by instinct method. However, optimum classification on data sets is vital to improve the decision accuracy of the TMS. Collected data sets have no class label and thus, cluster based unsupervised classifications (partitioning, hierarchical, grid-based, density-based) can be used to find optimum number of classifications in each attribute, and expected to improve the performance of the TMS. Two most popular and frequently used classifiers are hierarchical clustering and partition clustering. K-means is simple, easy to implement, and easy to interpret the clustering results. It is also faster, because the order of time complexity is linear with the number of data. Thus, in this paper we are going to demonstrate the performance of partition k-means and hierarchical k-means with their implementations by Davies Boulder Index (DBI), Dunn Index (DI), Silhouette Coefficient (SC) methods to outline the optimal number classifications (features) inside each attribute of TMS data sets. Subsequently, the optimal classes are validated by using WSS (within sum of square) errors and correlation methods. The validation results conclude that k-means with DI performs better in all attributes of TMS data sets and provides more accurate optimum classification numbers. Thereafter, the dynamic road weights for TMS are generated and classified using the combined k-means and DI method.
Authors and Affiliations
Sadia Nawrin, Rahatur Rahman, Shamim Akhter
Keywords
Related Articles
- EP ID EP249893
- DOI 10.14569/IJACSA.2017.080337
- Views 113
- Downloads 0
Forensic Analysis of Docker Swarm Cluster using Grr Rapid Response Framework
An attack on Internet network does not only hap-pened in the web applications that are running natively by a web server under operating system, but also web applications that are running inside container. The currently p...
Feature Extraction and Classification Methods for a Motor Task Brain Computer Interface: A Comparative Evaluation for Two Databases
A comparative evaluation is performed on two databases using three feature extraction techniques and five classification methods for a motor imagery paradigm based on Mu rhythm. In order to extract the features from elec...
A Web Service Composition Framework based on Functional Weight to Reach Maximum QoS
The recent trend in the web world is to accomplish almost all the user services in every field through the web portals of the respective organizations. But a specific task with series of actions cannot be completed by a...
Intrusion Detection System based on the SDN Network, Bloom Filter and Machine Learning
The scale and frequency of sophisticated attacks through denial of distributed service (DDoS) are still growing. The urgency is required because with the new emerging paradigms of the Internet of Things (IoT) and Cloud C...
Insight to Research Progress on Secure Routing in Wireless Ad hoc Network
Wireless Ad hoc Network offers a cost effective communication to the users free from any infrastructural dependencies. It is characterized by decentralized architecture, mobile nodes, dynamic topology, etc. that makes th...