To reduce the number of times of distance calculation for data clustering.
A search tree for multi-dimensional search to plural pattern vectors to be divided into clusters is constructed and nodes other than a root node are made to correspond to the partial spaces of a data space (101). The nodes of the search tree are successively scanned and the respective nodes are subjected to the following processings. For the respective partial paces corresponding to the respective nodes, a temporary representative point not expected to be closest to the pattern vector inside the partial space among the plural temporary representative points for representing the plural clusters is discriminated (200). Thereafter, the closest temporary representative point to the respective pattern vectors inside the partial space is selected from among the plural temporary representative points after the temporary representative point not expected to be the closest is eliminated.
| JPH0283665 | INFORMATION RETRIEVAL SYSTEM |
| JPH04337867 | DATA BASE RETRIEVAL SYSTEM |
| JP2015026105 | IMAGE EVALUATION SERVER |
RANKA SANJAY
ALSABTI KHALED
Next Patent: CLIPPING DEVICE