A new approach to the problem of description of clusters in the form of sets of logical regularities is developed. Special attention is paid to detection of steady interrelations in data which are valid for considerable shares of the sample.' The approach is based on usage of fast bit operations and positional method of data representation. New criterion of adjacency is proposed for high-level points of the representation, and it's used further in the process of assembling such points in maximal hyper-parallelepipeds corresponding to the best regularities. The method can be used as preliminary step in various tasks related to the search of essential logical regularities and substantial interpretation of data.
展开▼
