Caenorhabditis Elegans (C. Elegans) is a worm, which has had several studies to search its nerve paths. In a neuronal network simulation, it is util to know which is the first weight to assign in each link if it is no...
详细信息
ISBN:
(纸本)9783030870133;9783030870126
Caenorhabditis Elegans (C. Elegans) is a worm, which has had several studies to search its nerve paths. In a neuronal network simulation, it is util to know which is the first weight to assign in each link if it is not presented to determine other characteristics (e.g. distances by weights). Normally, the weight is a heuristic to solve a problem. There is a data set about connections of C. Elegans which is a result of other authors. The weights by the connection are not set in the data set. In this work, we use the data set to determine experimental weights for each connection with four cluster algorithms. The weights are to use in future work. To compare the algorithms, we created several models for each algorithm. We used metrics to evaluate the results for each model. A spectral clustering algorithm was chosen how the better algorithm to generate the weights.
暂无评论