【预售 按需印刷】GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM
￥801.00
| 运费： | ¥ 6.00-25.00 |
商品详情
书名：GRAPH CLUSTERING USING RESTRICTED NEIGHBOURHOOD SEARCH ALGORITHM
定价：801.0
ISBN：9783659237133
作者：Mohit Kumar
版次：1
出版时间：2012-09
内容提要：
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
定价：801.0
ISBN：9783659237133
作者：Mohit Kumar
版次：1
出版时间：2012-09
内容提要：
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
- 现代书店 （微信公众号认证）
- 中图上海旗下的一家进口图书专营书店。
- 扫描二维码，访问我们的微信店铺
- 随时随地的购物、客服咨询、查询订单和物流...
