Graph Clustering Using Restricted Neighbourhood Search Algorithm (Paperback)

,
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

R1,255

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles12550
Mobicred@R118pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 10 - 15 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

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

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Lap Lambert Academic Publishing

Country of origin

United States

Release date

September 2012

Availability

Expected to ship within 10 - 15 working days

First published

September 2012

Authors

,

Editors

Dimensions

229 x 152 x 5mm (L x W x T)

Format

Paperback - Trade

Pages

80

ISBN-13

978-3-659-23713-3

Barcode

9783659237133

Categories

LSN

3-659-23713-2



Trending On Loot