CLUSTER ANALYZING AND PROCESSING METHOD AND RECORDING MEDIUM HAVING CLUSTER ANALYZING PROGRAM RECORDED THEREON

摘要

PROBLEM TO BE SOLVED: To set the order of the number of calculating times to N (number of data) at the minimum at the time of performing cluster analysis and processing. ;SOLUTION: The matrix {Aij} (i, j=1 to N) of the degree of resemblance between the data of a set D composed of N-pieces of data is calculated. The maximum degree of resemblance and the row ID of the matrix {Aij} at that time are found by successively retrieving the row IDs of the matrix {Aij} from the top and stored in a next candidate storing table T. Then the maximum value of the matrix {Aij} is found by successively retrieving the table T from the top and a new cluster is generated and added to the matrix {Aij} and the table T. Thereafter, old data (the data of the row ID and column ID containing the highest degree of resemblance) are deleted from the matrix {Aij} and table T. The above-mentioned operations are repeated.;COPYRIGHT: (C)2001,JPO