Cluster analyse of text documents according to their relation of connectedness
The tabular presentation of text documents is considered, for the description of which the frequency of occurrence of words from thematic dictionaries is used. Each row of the table is considered to be a document (object) of one of the disjoint classes. It is proposed to analyze the connectivity of objects of classes according to logical laws in the form of hyperspheres. On the basis of the relation of connectedness, the objects of classes are divided into disjoint groups. The number of groups, as well as their composition is initially unknown and is determined by the algorithm. The partitioning results calculate the value of the compactness measure for each class. In the form of a computational experiment, the processing of documents from the field of biology and mathematics is demonstrated. The values of the measure of compactness are interpreted in terms of mathematical linguistics. The complexity of the cluster configuration obtained with respect to the connectedness of objects is shown when comparing with the results of grouping using the K-means algorithm. Using the result of cluster analyse it is offered to solve problems of searching expert to review, decreasing produced set of documents by shell objects of class.