GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM
Wersja papierowa
Autor:
Kumar Mohit
Redakcja:
Singh Arjun
ISBN: 978-36-592-3713-3Format: 15.2x22.9cm
Liczba stron: 80
Wydanie: 2012 r.
Język: angielski
Dostępność: dostępny
353,10 zł
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