| 摘要 |
<p>PROBLEM TO BE SOLVED: To decide nodes to which a link is set by repeating stages from decision of a start node till comparison with maximum access as to all nodes possibly being start nodes. SOLUTION: A maximum access number is read, a start point node and a weight coefficient are decided and 'calculation of distance between nodes' is executed as to all other nodes with respect to a node An by using the weight coefficient. Then the threshold level is decided and 'clustering of nodes based on distance' is conducted, corresponding 'sub-sample rate' is decided and the number of accessible nodes which belongs to each cluster is calculated. The number of the nodes relating to all the clusters is added and whether or not the sum is less than the maximum access number read at first is checked. When the number of added nodes is larger, the number of nodes is reduced and when smaller, the excess is shared to the accessible node. The processing is repeated to all nodes being start nodes and when finished, the access node is decided.</p> |
