| 摘要 |
PROBLEM TO BE SOLVED: To sequentially perform a DBSCAN algorithm by clustering. SOLUTION: Two kinds of processing are performed in cluster updating, i.e., processing for checking whether a point to be newly a cluster nucleus exists or not among a newly added point p and the adjacent points, and processing for generating the new cluster when the point to be the cluster nucleus exists and integrating existing clusters. Specifically, the aggregation of the point p to be sequentially given and the points included in theε-neighborhood is given as an input (S22), and it is checked whether the number of the points included in theε-neighborhood is equal to or more than N or not (S23). When the number is N or more, the point p becomes the cluster nucleus, and the process proceeds to cluster updating portion processing 1 (S24). Then, a cluster nucleus mark is given to the point p, a new cluster ID is issued, and the cluster ID is given to the point p. When the number is N or less, the point p is not the cluster nucleus, so that the process proceeds to cluster updating portion processing 2 (S25). Then, cluster nucleus mark exchange processing is performed. COPYRIGHT: (C)2010,JPO&INPIT
|
