Vetenskap & teknik
Pocket
Graph Clustering Using Restricted Neighbourhood Search Algorithm
Mohit Kumar • Piyush Kapoor • Arjun Singh
909:-
Uppskattad leveranstid 7-11 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
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 practitioner's 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
- Format: Pocket/Paperback
- ISBN: 9783659237133
- Språk: Engelska
- Antal sidor: 80
- Utgivningsdatum: 2012-09-14
- Förlag: LAP Lambert Academic Publishing