Graph Clustering Using Restricted Neighbourhood Search Algorithm: an Advanced Study of Implementation and Behavioural Analysis - Piyush Kapoor - Knjige - LAP LAMBERT Academic Publishing - 9783659237133 - 14. septembra 2012
Če se naslovnica in naslov ne ujemata, je naslov pravilen

Graph Clustering Using Restricted Neighbourhood Search Algorithm: an Advanced Study of Implementation and Behavioural Analysis

Cena
€ 42,49

Naročeno iz oddaljenega skladišča

Predvidena dobava 5. - 13. okt
Prejemajte obvestila o novih izdajah izvajalca Piyush Kapoor
Dodaj na svoj seznam želja iMusic

Not rated yet

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

Medij Knjige     Paperback Book   (Knjiga z mehkimi platnicami in lepljenim hrbtom)
Izdano 14. septembra 2012
ISBN13 9783659237133
Založniki LAP LAMBERT Academic Publishing
Strani 80
Dimenzije 150 × 5 × 226 mm   ·   137 g
Jezik Nemščina  
Sodelujoči Arjun Singh