Resumen de Lagrangian relaxations for multiple network alignment
Eric Malmi, Sanjay Chawla, Aristides Gionis
We propose a principled approach for the problem of aligning multiple partially overlapping networks. The objective is to map multiplegraphs into a single graph while preserving vertex and edge similarities. The problem is inspired by the task of integrating partial views of a family tree (genealogical network) into one unified network, but it also has applications, for example, in social and biological networks. Our approach, called Flan, introduces the idea of generalizing the facility locationproblem by adding a non-linear term to capture edge similarities and to infer the underlying entity network. The problem is solved using an alternating optimization procedure with a Lagrangian relaxation. Flanhas the advantage of being able to leverage prior information on the number of entities, so that when this information is available, Flanis shown to work robustly without the need to use any ground truth data for fine-tuning method parameters. Additionally, we present three multiple-network extensions to an existing state-of-the-art pairwise alignment method called Natalie. Extensive experiments on synthetic, as well as real-world datasets on social networks and genealogical networks, attest to the effectiveness of the proposed approaches which clearly outperform a popular multiple network alignment method called IsoRankN.
