Academic Journals Database
Disseminating quality controlled scientific knowledge

Graph Partitioning Advance Clustering Technique

ADD TO MY LIST
 
Author(s): T. Soni Madhulatha

Journal: International Journal of Computer Science and Engineering Survey
ISSN 0976-3252

Volume: 3;
Issue: 1;
Start page: 91;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Clustering | K-means | Iterative relocation | Fiedler Approach | Symmetric Matrix | Laplacian matrix | Eigen values.

ABSTRACT
Clustering is a common technique for statistical data analysis, Clustering is the process of grouping the data into classes or clusters so that objects within a cluster have high similarity in comparison to one another, but are very dissimilar to objects in other clusters. Dissimilarities are assessed based on the attribute values describing the objects. Often, distance measures are used. Clustering is an unsupervised learning technique, where interesting patterns and structures can be found directly from very large data sets with little or none of the background knowledge. This paper also considers the partitioning of mdimensional lattice graphs using Fiedler’s approach, which requires the determination of the eigenvector belonging to the second smallest Eigen value of the Laplacian with K-means partitioning algorithm.

Tango Rapperswil
Tango Rapperswil

     Save time & money - Smart Internet Solutions