Graph Clustering Using Restricted Neighbourhood Search Algorithm

ISBN-13: 9783659237133 / Angielski / Miękka / 2012 / 80 str.

Mohit Kumar; Piyush Kapoor; Arjun Singh

Opis

Restricted Neighborhood Search Algorithm(R.N.S.C)is a cost-based clustering technique for clustering the graph into separate clusters, where each cluster has some similar properties.Based on a practitioners insights, the book focuses on the basic principles and dwells on the complex details of graph clustering using Restricted Neighbourhood Search. The book covers the following: Introduction Experimental results Test Data Random graph Color benchmark graph Parameter training and statistical results Cluster limit Diversification Tabu length Search length Graph coloring

O autorze

Kumar, MohitHe is currently Assistant Professor,Department of Computer Science at Invertis University, Bareilly.He has done his post-graduation from Amity University and Research Thesis from Indian Institute of Technology, Banaras Hindu University, Varanasi.He has three papers in International Journal(I.J.C.A.)and one in National Journal(Samriddhi).