Link prediction in multilayer networks aims to predict missing links at the target layer by incorporating structural information from both auxiliary layers and the target layer. Existing methods tend to learn layer-specific knowledge to maximize the link prediction performance on a specific network layer. However, they have difficulty incorporating multilayer structural information to improve the link prediction performance. Therefore, we propose a Multiple Attention Layer-shareable Method (MALM) for link prediction in multilayer networks, which consists of a feature encoder, a knowledge learner, and a fusion predictor. The feature encoder introduces multiple attention mechanisms to encode the feature representations of links by differentiating the importance of structural information for each link. In cooperation with the feature encoder, the knowledge learner splits the link prediction tasks into different layers and employs meta-learning to learn layer-shareable knowledge from these link prediction tasks. Finally, the fusion predictor combines the learned layer-shareable knowledge with the layer-specific knowledge at the target layer for link prediction. Experiments on real-world datasets demonstrate that the proposed MALM outperforms existing state-of-the-art baselines in link prediction in multilayer networks.

We present an algorithm for active learning of deterministic timed automata with multiple clocks. The algorithm is within the querying framework of Angluin’s L* algorithm and follows the idea proposed in existing work on the active learning of deterministic one-clock timed automata. We introduce an equivalence relation over the reset-clocked language of a timed automaton and then transform the learning problem into learning the corresponding reset-clocked language of the target automaton. Since a reset-clocked language includes the clocks reset information which is not observable, we first present the approach of learning from a powerful teacher who can provide reset information by answering reset information queries from the learner. Then we extend the algorithm in a normal teacher situation in which the learner can only ask standard membership query and equivalence query while the learner guesses the reset information. We prove that the learning algorithm terminates and returns a correct deterministic timed automaton. Due to the need of guessing whether the clocks reset at the transitions, the algorithm is of exponential complexity in the size of the target automaton.