On the advanced procedure to reduce calculation of Galois closures

Formalization of similarity by algebraic operation is used as a key element of many modern intelligent data analysis methods. Nevertheless, in some important cases (e. g., in computer network traffic control, network security policy control in cloud computing environment, and some other), direct implementation of this technique is limited by the necessity to process huge amount of data in the real time mode. For example, it is necessary to intersect elements of a large set of Boolean vectors of large length to find fixed points of so-called Galois closure. An advanced algorithm of Galois closure formation is introduced. The algorithm is used to optimize the process of set closeness checking. Some examples of applications of the presented technique in computer network traffic control and deep packet inspection are discussed.