Graph Clustering Using Restricted Neighbourhood Search Algorithm: an Advanced Study of Implementation and Behavioural Analysis - Piyush Kapoor - Grāmatas - LAP LAMBERT Academic Publishing - 9783659237133 - 2012. gada 14. septembris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

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

Cena
€ 45,49

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 5. - 13. aug.
Saņemiet paziņojumus par jauniem Piyush Kapoor izdevumiem
Pievienot savam iMusic vēlmju sarakstam

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

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2012. gada 14. septembris
ISBN13 9783659237133
Izdevēji LAP LAMBERT Academic Publishing
Lapas 80
Izmēri 150 × 5 × 226 mm   ·   137 g
Valoda Vācu  
Ieguldītājs Arjun Singh

Skatīt visus Piyush Kapoor ( piem., Paperback Book )