TY - GEN
T1 - Co-Embedding Attributed Networks
AU - Meng, Zaiqiao
AU - Liang, Shangsong
AU - Bao, Hongyan
AU - Zhang, Xiangliang
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledged KAUST grant number(s): FCC/1/1976-19-01
Acknowledgements: The research reported in this publication was supported by funding from King Abdullah University of Science and Technology (KAUST), under award number FCC/1/1976-19-01.
PY - 2019/3/11
Y1 - 2019/3/11
N2 - Existing embedding methods for attributed networks aim at learning low-dimensional vector representations for nodes only but not for both nodes and attributes, resulting in the fact that they cannot capture the affinities between nodes and attributes. However, capturing such affinities is of great importance to the success of many real-world attributed network applications, such as attribute inference and user profiling. Accordingly, in this paper, we introduce a Co-embedding model for Attributed Networks (CAN), which learns low-dimensional representations of both attributes and nodes in the same semantic space such that the affinities between them can be effectively captured and measured. To obtain high-quality embeddings, we propose a variational auto-encoder that embeds each node and attribute with means and variances of Gaussian distributions. Experimental results on real-world networks demonstrate that our model yields excellent performance in a number of applications compared with state-of-the-art techniques.
AB - Existing embedding methods for attributed networks aim at learning low-dimensional vector representations for nodes only but not for both nodes and attributes, resulting in the fact that they cannot capture the affinities between nodes and attributes. However, capturing such affinities is of great importance to the success of many real-world attributed network applications, such as attribute inference and user profiling. Accordingly, in this paper, we introduce a Co-embedding model for Attributed Networks (CAN), which learns low-dimensional representations of both attributes and nodes in the same semantic space such that the affinities between them can be effectively captured and measured. To obtain high-quality embeddings, we propose a variational auto-encoder that embeds each node and attribute with means and variances of Gaussian distributions. Experimental results on real-world networks demonstrate that our model yields excellent performance in a number of applications compared with state-of-the-art techniques.
UR - http://hdl.handle.net/10754/631764
UR - https://dl.acm.org/citation.cfm?doid=3289600.3291015
UR - http://www.scopus.com/inward/record.url?scp=85061711513&partnerID=8YFLogxK
U2 - 10.1145/3289600.3291015
DO - 10.1145/3289600.3291015
M3 - Conference contribution
SN - 9781450359405
SP - 393
EP - 401
BT - Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining - WSDM '19
PB - Association for Computing Machinery (ACM)
ER -