Research Article
An Extreme Learning Machine-Based Community Detection Algorithm in Complex Networks
Pseudocode 1
(pseudocode of the ELM-CD).
| ELM-CD () | | 1 initialize constant parameters, including , , | | 2 generate from | | 3 normalize | | 4 randomly generate input weights and biases of neurons in hidden layer | | 5 calculate according to Eq. (6) | | 6 if | | 7 select the first smallest eigenvalues of Eq. (11) and assemble | | using the corresponding eigenvectors as in Eq. (12) | | 8 else | | 9 select the first smallest eigenvalues of Eq. (13) and assemble | | using the corresponding eigenvectors as in Eq. (14) | | 10 archive the embedding matrix | | 11 randomly select rows from as centroids, say | | 12 while changed | | 13 for to | | 14 for to | | 15 | | 16 find the smallest element in and its corresponding index | | 17 | | 18 for to | | 19 update to be the mean value of all members in cluster | | 20 return |
|