Comparative analysis of clustering of spatial databases with various DBSCAN Algorithms
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2012, Vol 1, Issue 6
Abstract
Clustering is still an important research issue in the data mining, because there is a continuous research in data mining for optimum clusters on spatial data. There are so many types of partition based and hierarchal algorithms implemented for clustering and the clusters which are formed based on the density are easy to understand and it does not limit itself to certain shapes of the clusters. This paper presents the comparative analysis of the various density based clustering mechanisms. There is certain problem on existing density based algorithms because they are not capable of finding the meaningful clusters whenever the density is so much varied. VDBSCAN is introduced to compensate this problem. It is same as DBSCAN (Density Based Spatial Clustering of Applications with Noise) but only the difference is VDBSCAN selects several values of parameter Eps for different densities according to k-dist plot. The problem is the value of parameter k in k-dist plot is user defined. This paper introduces a new method to find out the value of parameter k automatically based on the characteristics of the datasets. In this method we consider spatial distance from a point to all others points in the datasets. The proposed method has potential to find out optimal value for parameter k .In this paper a synthetic database with two dimensional data is used for demonstration.
Authors and Affiliations
K. Ganga Swathi, K N V S S K Rajesh
Keywords
Related Articles
- EP ID EP27492
- DOI -
- Views 319
- Downloads 6
Scent Rupture Nodes Using DCD In Wireless Sensor Networks
A cut is nothing but a part of wireless sensor networks which is splited into different connection components because of some node failures in the network. This paper proposes a new algorithm to detect these cuts by...
Detect Sinking Ship in Wireless Sensor Networks By Using Dcd
A cut is nothing but a part of wireless sensor networks which is splited into different connection components because of some node failures in the network. This paper proposes a new algorithm to detect these cuts by...
A New VLSI Architecture to Increase the speed of computation (Modified Booth Algorithm)
In this paper, we planned a new architecture of multiplier -and-accumulator (MAC) for high-speed arithmetic operations. By merging multiplication with accumulation and planning a hybrid type of carry save adder (CSA)...
Procedure Dynamic Network and Prevent Mobile Typically Extension
Prevent and mobile is taken spread from dynamic networks and mobile networks is used number of times results of mobile users In a mobile network mobile and prevent can use security data lose no. of modifications and...
Content Accumulating and Development beyond Elastic and Inelastic Traffic in Wireless Networks
Caching and multicasting at base stations are two promising ways to deal with bolster monstrous substance conveyance over remote systems. Be that as it may, existing planning outlines don't make full utilization of t...