| 摘要 |
PURPOSE:To shorten a calculation time and to increase the speed of retrieval processing at the time of clustering by retrieving the center vector in a small area on a tree structure. CONSTITUTION:When the center vector at the shortest distance from an input vector is found among center vectors of clusters, the center vectors are represented in the tree structure to generate a small area centered on the input vector and the center vector in this area is retrieved on the tree structure to find the center vector in the small area at the shortest distance from the input vector. Namely, when L input vectors are clustered while the number of clusters is set to K, the center vectors of the clusters are represented in the tree structure to shorten the processing time for the retrieval to L.logK order. And the calculation time required for the retrieval processing is shortened greatly.
|
