اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدELRUNA: Elimination Rule-based Network Alignment
83
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Networks model a variety of complex phenomena across different domains. In many applications, one of the most essential tasks is to align two or more networks to infer the similarities between cross-network vertices and discover potential node-level correspondence. In this paper, we propose ELRUNA (Elimination rule-based network alignment), a novel network alignment algorithm that relies exclusively on the underlying graph structure. Under the guidance of the elimination rules that we defined, ELRUNA computes the similarity between a pair of cross-network vertices iteratively by accumulating the similarities between their selected neighbors. The resulting cross-network similarity matrix is then used to infer a permutation matrix that encodes the final alignment of cross-network vertices. In addition to the novel alignment algorithm, we also improve the performance of local search, a commonly used post-processing step for solving the network alignment problem, by introducing a novel selection method RAWSEM (Randomwalk based selection method) based on the propagation of the levels of mismatching (defined in the paper) of vertices across the networks. The key idea is to pass on the initial levels of mismatching of vertices throughout the entire network in a random-walk fashion. Through extensive numerical experiments on real networks, we demonstrate that ELRUNA significantly outperforms the state-of-the-art alignment methods in terms of alignment accuracy under lower or comparable running time. Moreover, ELRUNA is robust to network perturbations such that it can maintain a close to optimal objective value under a high level of noise added to the original networks. Finally, the proposed RAWSEM can further improve the alignment quality with a less number of iterations compared with the naive local search method.
قيم البحث
اقرأ أيضاً
Social network alignment, aligning different social networks on their common users, is receiving dramatic attention from both academic and industry. All existing studies consider the social network to be static and neglect its inherent dynamics. In f
act, the dynamics of social networks contain the discriminative pattern of an individual, which can be leveraged to facilitate social network alignment. Hence, we for the first time propose to study the problem of aligning dynamic social networks. Towards this end, we propose a novel Dynamic social Network Alignment (DNA) framework, a unified optimization approach over deep neural architectures, to unfold the fruitful dynamics to perform alignment. However, it faces tremendous challenges in both modeling and optimization: (1) To model the intra-network dynamics, we explore the local dynamics of the latent pattern in friending evolvement and the global consistency of the representation similarity with neighbors. We design a novel deep neural architecture to obtain the dual embedding capturing local dynamics and global consistency for each user. (2) To model the inter-network alignment, we exploit the underlying identity of an individual from the dual embedding in each dynamic social network. We design a unified optimization approach interplaying proposed deep neural architectures to construct a common subspace of identity embeddings. (3) To address this optimization problem, we design an effective alternating algorithm with solid theoretical guarantees.We conduct extensive experiments on real-world datasets and show that the proposed DNA framework substantially outperforms the state-of-the-art methods.
Network alignment consists of finding a structure-preserving correspondence between the nodes of two correlated, but not necessarily identical, networks. This problem finds applications in a wide variety of fields, from the alignment of proteins in c
omputational biology, to the de-anonymization of social networks, as well as recognition tasks in computer vision. In this work we introduce SPECTRE, a scalable algorithm that uses spectral centrality measures and percolation techniques. Unlike most network alignment algorithms, SPECTRE requires no seeds (i.e., pairs of nodes identified beforehand), which in many cases are expensive, or impossible, to obtain. Instead, SPECTRE generates an initial noisy seed set via spectral centrality measures which is then used to robustly grow a network alignment via bootstrap percolation techniques. We show that, while this seed set may contain a majority of incorrect pairs, SPECTRE is still able to obtain a high-quality alignment. Through extensive numerical simulations, we show that SPECTRE allows for fast run times and high accuracy on large synthetic and real-world networks, even those which do not exhibit a high correlation.
Network alignment is a problem of finding the node mapping between similar networks. It links the data from separate sources and is widely studied in bioinformation and social network fields. The critical difference between network alignment and exac
t graph matching is that the network alignment considers node mapping in non-isomorphic graphs with error tolerance. Researchers usually utilize AC (accuracy) to measure the performance of network alignments which comparing each output element with the benchmark directly. However, this metric neglects that some nodes are naturally indistinguishable even in single graphs (e.g., nodes have the same neighbors) and no need to distinguish across graphs. Such neglect leads to the underestimation of models. We propose an unbiased metric for network alignment that takes indistinguishable nodes into consideration to address this problem. Our detailed experiments with different scales on both synthetic and real-world datasets demonstrate that the proposed metric correctly reflects the deviation of result mapping from benchmark mapping as standard metric AC does. Comparing with the AC, the proposed metric effectively blocks the effect of indistinguishable nodes and retains stability under increasing indistinguishable nodes.
We consider the problem of network coding across three unicast sessions over a directed acyclic graph, where each sender and the receiver is connected to the network via a single edge of unit capacity. We consider a network model in which the middle
of the network only performs random linear network coding, and restrict our approaches to precoding-based linear schemes, where the senders use precoding matrices to encode source symbols. We adapt a precoding-based interference alignment technique, originally developed for the wireless interference channel, to construct a precoding-based linear scheme, which we refer to as as a {em precoding-based network alignment scheme (PBNA)}. A primary difference between this setting and the wireless interference channel is that the network topology can introduce dependencies between elements of the transfer matrix, which we refer to as coupling relations, and can potentially affect the achievable rate of PBNA. We identify all possible such coupling relations, and interpret these coupling relations in terms of network topology and present polynomial-time algorithms to check the presence of these coupling relations. Finally, we show that, depending on the coupling relations present in the network, the optimal symmetric rate achieved by precoding-based linear scheme can take only three possible values, all of which can be achieved by PBNA.
Speech-to-text alignment is a critical component of neural textto-speech (TTS) models. Autoregressive TTS models typically use an attention mechanism to learn these alignments on-line. However, these alignments tend to be brittle and often fail to ge
neralize to long utterances and out-of-domain text, leading to missing or repeating words. Most non-autoregressive endto-end TTS models rely on durations extracted from external sources. In this paper we leverage the alignment mechanism proposed in RAD-TTS as a generic alignment learning framework, easily applicable to a variety of neural TTS models. The framework combines forward-sum algorithm, the Viterbi algorithm, and a simple and efficient static prior. In our experiments, the alignment learning framework improves all tested TTS architectures, both autoregressive (Flowtron, Tacotron 2) and non-autoregressive (FastPitch, FastSpeech 2, RAD-TTS). Specifically, it improves alignment convergence speed of existing attention-based mechanisms, simplifies the training pipeline, and makes the models more robust to errors on long utterances. Most importantly, the framework improves the perceived speech synthesis quality, as judged by human evaluators.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
