- Anglický jazyk
GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM
Autor: Mohit Kumar
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... Viac o knihe
Na objednávku, dodanie 2-4 týždne
44.35 €
bežná cena: 50.40 €
O knihe
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
- Vydavateľstvo: LAP Lambert Academic Publishing
- Rok vydania: 2012
- Formát: Paperback
- Rozmer: 220 x 150 mm
- Jazyk: Anglický jazyk
- ISBN: 9783659237133