Artículos relacionados a GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH...
GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM: AN ADVANCED STUDY OF IMPLEMENTATION AND BEHAVIOURAL ANALYSIS - Tapa blanda
Sinopsis
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
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
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).
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 49,00
EUR 11,00 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH...
Imagen del vendedor
GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM
Publicado por
LAP Lambert Academic Publishing Sep 2012, 2012
ISBN 10: 3659237132
ISBN 13: 9783659237133
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783659237133
Cantidad disponible: 2 disponibles
Imagen del vendedor
GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM
Publicado por
LAP LAMBERT Academic Publishing, 2012
ISBN 10: 3659237132
ISBN 13: 9783659237133
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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 ref. del artículo: 5142026
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM : AN ADVANCED STUDY OF IMPLEMENTATION AND BEHAVIOURAL ANALYSIS
Publicado por
LAP Lambert Academic Publishing, 2012
ISBN 10: 3659237132
ISBN 13: 9783659237133
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783659237133
Cantidad disponible: 1 disponibles
Imagen del vendedor
GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM
Publicado por
LAP Lambert Academic Publishing Sep 2012, 2012
ISBN 10: 3659237132
ISBN 13: 9783659237133
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783659237133
Cantidad disponible: 2 disponibles