Greedy Search for the best Minimally Complex Model

This program performs a greedy search for the best Minimally Complex Model for a given binary dataset.

Finding such a model can be used for the detection of community structures in binary data, while taking into account possible high-order patterns of the data in detecting the communities (i.e., possible high-order correlations between the variables). We use the fact that each partition of the variables (i.e., a community structure) can be mapped to an MCM.