0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Probability & statistics

Buy Now

Graph Clustering Using Restricted Neighbourhood Search Algorithm (Paperback) Loot Price: R1,285
Discovery Miles 12 850
Graph Clustering Using Restricted Neighbourhood Search Algorithm (Paperback): Mohit Kumar

Graph Clustering Using Restricted Neighbourhood Search Algorithm (Paperback)

Mohit Kumar; Edited by Arjun Singh; Piyush Kapoor

 (sign in to rate)
Loot Price R1,285 Discovery Miles 12 850 | Repayment Terms: R120 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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

General

Imprint: Lap Lambert Academic Publishing
Country of origin: United States
Release date: September 2012
First published: September 2012
Authors: Mohit Kumar
Editors: Arjun Singh
Authors: Piyush Kapoor
Dimensions: 229 x 152 x 5mm (L x W x T)
Format: Paperback - Trade
Pages: 80
ISBN-13: 978-3-659-23713-3
Categories: Books > Science & Mathematics > Mathematics > Probability & statistics
LSN: 3-659-23713-2
Barcode: 9783659237133

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners