Return
A parameter selection method of the deterministic anti-annealing algorithm for network exploring
DOI:10.1016/j.neucom.2016.11.050.png)
Abstract
En 中文
The traditional expectation maximization (EM) algorithm for the mixture model can explore the structural regularities of a network efficiently. But it always traps into local maxima. A deterministic annealing EM (DAEM) algorithm is put forward to solve this problem. However, it brings about the problem of convergence speed. A deterministic anti-annealing expectation maximization (DAAEM) algorithm not only prevents poor local optima, but also improves the convergence speed. Thus, the DAAEM algorithm is used to estimate parameters of the mixture model. This algorithm always sets its initial parameter beta(0) by experience, which maybe get trapped into meaningless results due to too small beta(0), or converge to local maxima more frequently due to too large beta(0). A parameter selection method for beta(0) is designed. In our method, the convergence rate of the DAAEM algorithm for mixture model is first derived from Jacobian matrix of the posterior probabilities. Then the theoretical lower bound of beta(0) is computed based on the convergence rate at meaningless points. In our experiments we select beta(0) by rounding up the lower bound to the nearest tenth. Experiments on real and synthetic networks demonstrate that the parameter selection method is valid, and the performance of the DAAEM algorithm beginning from the selected parameter is better than the EM and DAEM algorithms for mixture model. In addition, we find that the convergence rate of the DAAEM algorithm is affected by assortative mixing by degree of a network.
Keywords:
Mixture model
Community detection
Deterministic anti-annealing EM algorithm
Convergence rate
Jacobian matrix
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W

