Network embedding with centrality information

Yao Ma, Suhang Wang, Jiliang Tang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Information networks such as social networks, publication networks, and the World Wide Web are ubiquitous in the real world. Traditionally, adjacency matrices are used to represent the networks. However, adjacency matrices are too sparse and too high dimensional when the scale of the networks is large. Network embedding, which aims to learn low-dimensional continuous representations for nodes, has attracted increasing attention recent years. Many network embedding methods such as DeepWalk, LINE, and node2vec have been proposed recently. Many traditional tasks such as node classification and link prediction have been proven to be benefited from the learned representations. Most of these existing network embedding methods focus on preserving the structure of the networks but totally ignore the centrality information. Centrality information which measures the importance of each individual node has been proven to be helpful in many applications. Various centrality measures such as degree centrality, closeness centrality, betweenness centrality, eigenvector centrality and Page-rank, have been proposed. Different centrality measures should be chosen according to different applications. In this paper, we aim to learn continuous nodes representations which can preserve not only the network structure but also the centrality information. We propose a general model to incorporate the centrality information in the sense of ranking. Different centrality measures can be used in the model.

Original languageEnglish (US)
Title of host publicationProceeding - 17th IEEE International Conference on Data Mining Workshops, ICDMW 2017
EditorsRaju Gottumukkala, George Karypis, Vijay Raghavan, Xindong Wu, Lucio Miele, Srinivas Aluru, Xia Ning, Guozhu Dong
PublisherIEEE Computer Society
Pages1144-1145
Number of pages2
ISBN (Electronic)9781538614808
DOIs
StatePublished - Dec 15 2017
Event17th IEEE International Conference on Data Mining Workshops, ICDMW 2017 - New Orleans, United States
Duration: Nov 18 2017Nov 21 2017

Publication series

NameIEEE International Conference on Data Mining Workshops, ICDMW
Volume2017-November
ISSN (Print)2375-9232
ISSN (Electronic)2375-9259

Conference

Conference17th IEEE International Conference on Data Mining Workshops, ICDMW 2017
CountryUnited States
CityNew Orleans
Period11/18/1711/21/17

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

Fingerprint Dive into the research topics of 'Network embedding with centrality information'. Together they form a unique fingerprint.

  • Cite this

    Ma, Y., Wang, S., & Tang, J. (2017). Network embedding with centrality information. In R. Gottumukkala, G. Karypis, V. Raghavan, X. Wu, L. Miele, S. Aluru, X. Ning, & G. Dong (Eds.), Proceeding - 17th IEEE International Conference on Data Mining Workshops, ICDMW 2017 (pp. 1144-1145). (IEEE International Conference on Data Mining Workshops, ICDMW; Vol. 2017-November). IEEE Computer Society. https://doi.org/10.1109/ICDMW.2017.162