Articles liés à GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH...
GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM: AN ADVANCED STUDY OF IMPLEMENTATION AND BEHAVIOURAL ANALYSIS - Couverture souple
Synopsis
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
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
He is currently Assistant Professor,Department of Computer Science at Invertis University, Bareilly.He has done his post-graduation from Amity University and Research Thesis from Indian Institute of Technology, Banaras Hindu University, Varanasi.He has three papers in International Journal(I.J.C.A.)and one in National Journal(Samriddhi).
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
- ÉditeurLAP Lambert Academic Publishing
- Date d'édition2012
- ISBN 10 3659237132
- ISBN 13 9783659237133
- ReliureBroché
- Langueanglais
- Nombre de pages80
- ÉditeurSingh Arjun
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 41,67
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH...
Image fournie par le vendeur
GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM
Edité par
LAP LAMBERT Academic Publishing, 2012
ISBN 10 : 3659237132
ISBN 13 : 9783659237133
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Kumar MohitHe is currently Assistant Professor,Department of Computer Science at Invertis University, Bareilly.He has done his post-graduation from Amity University and Research Thesis from Indian Institute of Technology, Banaras Hi. N° de réf. du vendeur 5142026
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM : AN ADVANCED STUDY OF IMPLEMENTATION AND BEHAVIOURAL ANALYSIS
Edité par
LAP Lambert Academic Publishing, 2012
ISBN 10 : 3659237132
ISBN 13 : 9783659237133
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783659237133
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM
Edité par
LAP Lambert Academic Publishing Sep 2012, 2012
ISBN 10 : 3659237132
ISBN 13 : 9783659237133
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 80 pp. Englisch. N° de réf. du vendeur 9783659237133
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM
Edité par
LAP Lambert Academic Publishing Sep 2012, 2012
ISBN 10 : 3659237132
ISBN 13 : 9783659237133
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -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 coloringBooks on Demand GmbH, Überseering 33, 22297 Hamburg 80 pp. Englisch. N° de réf. du vendeur 9783659237133
Quantité disponible : 2 disponible(s)