The Community for Technology Leaders
Green Image
N-partite networks are natural representations of complex multi-entity databases. However, processing these networks can be a highly memory and computation-intensive task, especially when positive correlation exists between the degrees of vertices from different partitions. In order to improve the scalability of this process, this paper proposes two algorithms that make use of sampling for obtaining less expensive approximate results. The first algorithm is optimal for obtaining homogeneous discovery rates with a low memory requirement, but can be very slow in cases where the combined branching factor of these networks is too large. A second algorithm that incorporates concepts from evolutionary computation aims toward dealing with this slow convergence in the case when it is more interesting to increase approximation convergence speed of elements with high feature values. This algorithm makes use of the positive correlation between "local” branching factors and the feature values. Two applications examples are demonstrated in searching for most influential authors in collections of journal articles and in analyzing most active earthquake regions from a collection of earthquake events.
N-partite network, evolutionary algorithm, graphic-structured database.

G. G. Yen and M. L. Goldstein, "Using Evolutionary Algorithms for Defining the Sampling Policy of Complex N-Partite Networks," in IEEE Transactions on Knowledge & Data Engineering, vol. 17, no. , pp. 762-773, 2005.
90 ms
(Ver 3.3 (11022016))