Grid Density Based Clustering Algorithm
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2013, Vol 2, Issue 6
Abstract
Clustering is the one of the most important task of the data mining. Clustering is the unsupervised method to find the relations between points of dataset into several groups. It can be done by using various types of techniques like partitioned, hierarchical, density, and grid. Each of these has its own advantages and disadvantages. Grid density takes the advantage of the density and the grid algorithms. In this paper, the comparison of the k-mean algorithm can be done with grid density algorithm. Grid density algorithm is better than the k-mean algorithm in clustering.
Authors and Affiliations
Amandeep Kaur Mann , Navneet Kau
Keywords
Related Articles
- EP ID EP93540
- DOI -
- Views 108
- Downloads 0
ROBUST AND FLEXIBLE IP ADDRESSING FOR MOBILE AD-HOC NETWORK
Mobile Ad hoc Networks (MANETs) are expected to become more and more important in the upcoming years. In order to enable the establishment of IP services in MANets, IP address auto configuration mechanisms are re...
Performance analysis of Meandered loop and Top loaded monopole antenna for Wireless Applications
This paper presents the design of multiple antennas for various wireless applications. In this paper the combination of top loaded monopole antenna and meandered loop antenna that operates on frequencies of 600MHz...
Modulation of Generalized Canonical CS-Transform
In this paper the generalized canonical CS- transform it is extended to the distribution of compact support by using kernel method. The analyticity and modulation theorems are proved for this transform. Also...
Analysis of local and global techniques for disparity map generation in stereo vision
The field of computer vision is still open to generate 3D images (depth) using stereo image pairs. Obtaining reliable depth estimation has importance in robotic applications and autonomous systems. Stereo vision is...
A Comparative Analysis of Feed-Forward and Elman Neural Networks for Face Recognition Using Principal Component Analysis
Abstract—In this paper we give a comparative analysis of performance of feed forward neural network and elman neural network based face recognition. We use different inner epoch for different input pattern according to t...