Abstract

Networks are often collected from multiple sources in many high-impact domains, facilitating many emerging applications that require the connections across multiple networks. Network alignment has become the very first step in many applications and thus has been studied in decades. Although some existing works can use the attribute information as part of the alignment process, they still have certain limitations. For example, some existing network alignment methods can use node attribute similarities as part of the prior alignment information, whereas most of them solely explore the topology consistency without the consistency among attributes of the underlying networks. On the other hand, traditional graph matching methods encode both the node and edge attributes (and possibly the topology) into an affinity matrix and formulate it as a constrained nonconvex quadratic maximization problem. However, these methods cannot scale well to the large-scale networks. In this paper, we propose a family of network alignment algorithms FINAL to efficiently align the attributed networks. The key idea is to leverage the node/edge attribute information to guide the (topology-based) alignment process. We formulate this problem as a convex quadratic optimization problem, and develop effective and efficient algorithms to solve it.

Original languageEnglish (US)
JournalIEEE Transactions on Knowledge and Data Engineering
DOIs
StateAccepted/In press - Aug 20 2018

Fingerprint

Topology

Keywords

  • alignment consistency
  • Approximation algorithms
  • attributed networks
  • Feature extraction
  • Modeling
  • Network alignment
  • Network topology
  • on-query alignment
  • Optimization
  • Symmetric matrices
  • Topology

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

@article{7e5464c3eb984fa0a700b0b811cb5df7,
title = "Attributed Network Alignment: Problem Definitions and Fast Solutions",
abstract = "Networks are often collected from multiple sources in many high-impact domains, facilitating many emerging applications that require the connections across multiple networks. Network alignment has become the very first step in many applications and thus has been studied in decades. Although some existing works can use the attribute information as part of the alignment process, they still have certain limitations. For example, some existing network alignment methods can use node attribute similarities as part of the prior alignment information, whereas most of them solely explore the topology consistency without the consistency among attributes of the underlying networks. On the other hand, traditional graph matching methods encode both the node and edge attributes (and possibly the topology) into an affinity matrix and formulate it as a constrained nonconvex quadratic maximization problem. However, these methods cannot scale well to the large-scale networks. In this paper, we propose a family of network alignment algorithms FINAL to efficiently align the attributed networks. The key idea is to leverage the node/edge attribute information to guide the (topology-based) alignment process. We formulate this problem as a convex quadratic optimization problem, and develop effective and efficient algorithms to solve it.",
keywords = "alignment consistency, Approximation algorithms, attributed networks, Feature extraction, Modeling, Network alignment, Network topology, on-query alignment, Optimization, Symmetric matrices, Topology",
author = "Si Zhang and Hanghang Tong",
year = "2018",
month = "8",
day = "20",
doi = "10.1109/TKDE.2018.2866440",
language = "English (US)",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - Attributed Network Alignment

T2 - Problem Definitions and Fast Solutions

AU - Zhang, Si

AU - Tong, Hanghang

PY - 2018/8/20

Y1 - 2018/8/20

N2 - Networks are often collected from multiple sources in many high-impact domains, facilitating many emerging applications that require the connections across multiple networks. Network alignment has become the very first step in many applications and thus has been studied in decades. Although some existing works can use the attribute information as part of the alignment process, they still have certain limitations. For example, some existing network alignment methods can use node attribute similarities as part of the prior alignment information, whereas most of them solely explore the topology consistency without the consistency among attributes of the underlying networks. On the other hand, traditional graph matching methods encode both the node and edge attributes (and possibly the topology) into an affinity matrix and formulate it as a constrained nonconvex quadratic maximization problem. However, these methods cannot scale well to the large-scale networks. In this paper, we propose a family of network alignment algorithms FINAL to efficiently align the attributed networks. The key idea is to leverage the node/edge attribute information to guide the (topology-based) alignment process. We formulate this problem as a convex quadratic optimization problem, and develop effective and efficient algorithms to solve it.

AB - Networks are often collected from multiple sources in many high-impact domains, facilitating many emerging applications that require the connections across multiple networks. Network alignment has become the very first step in many applications and thus has been studied in decades. Although some existing works can use the attribute information as part of the alignment process, they still have certain limitations. For example, some existing network alignment methods can use node attribute similarities as part of the prior alignment information, whereas most of them solely explore the topology consistency without the consistency among attributes of the underlying networks. On the other hand, traditional graph matching methods encode both the node and edge attributes (and possibly the topology) into an affinity matrix and formulate it as a constrained nonconvex quadratic maximization problem. However, these methods cannot scale well to the large-scale networks. In this paper, we propose a family of network alignment algorithms FINAL to efficiently align the attributed networks. The key idea is to leverage the node/edge attribute information to guide the (topology-based) alignment process. We formulate this problem as a convex quadratic optimization problem, and develop effective and efficient algorithms to solve it.

KW - alignment consistency

KW - Approximation algorithms

KW - attributed networks

KW - Feature extraction

KW - Modeling

KW - Network alignment

KW - Network topology

KW - on-query alignment

KW - Optimization

KW - Symmetric matrices

KW - Topology

UR - http://www.scopus.com/inward/record.url?scp=85052685593&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85052685593&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2018.2866440

DO - 10.1109/TKDE.2018.2866440

M3 - Article

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

ER -