An evolutionary algorithm method for sampling n-partite graphs

Abstract

The growth of use of graph-structured databases modeled on n-partite graphs has increased the ability to generate more flexible databases. However, the calculation of certain features in these databases may be highly resource-consuming. This work proposes a method for approximating these features by sampling. A discussion of the difficulty of sampling in n-partite graphs is made and an evolutionary algorithm-based method is presented that uses the information from a smaller subset of the graph to infer the amount of sampling needed for the rest of the graph. Experimental results are shown on a publications database on Anthrax for finding the most important authors.