We are very excited to join forces with MLCommons and OctoML.ai! Contact Grigori Fursin for more details!

Binarized Attributed Network Embedding

lib:f31334296ae01f67 (v1.0.0)

Vote to reproduce this paper and share portable workflows   1 
Authors: Hong Yang,Shirui Pan,Peng Zhang,Ling Chen,Defu Lian,Chengqi Zhang
Where published: ICDM 2018 10
Document:  PDF  DOI 
Artifact development version: GitHub
Abstract URL: https://www.researchgate.net/publication/328688614_Binarized_Attributed_Network_Embedding

An implementation of "Binarized Attributed Network Embedding". Attributed network embedding enables joint representation learning of node links and attributes. Existing attributed network embedding models are designed in continuous Euclidean spaces which often introduce data redundancy and impose challenges to storage and computation costs. To this end, we present a Binarized Attributed Network Embedding model (BANE for short) to learn binary node representation. Specifically, we define a new Weisfeiler-Lehman proximity matrix to capture data dependence between node links and attributes by aggregating the information of node attributes and links from neighboring nodes to a given target node in a layer-wise manner. Based on the Weisfeiler-Lehman proximity matrix, we formulate a new Weisfiler-Lehman matrix factorization learning function under the binary node representation constraint. The learning problem is a mixed integer optimization and an efficient cyclic coordinate descent (CCD) algorithm is used as the solution. Node classification and link prediction experiments on real-world datasets show that the proposed BANE model outperforms the state-of-the-art network embedding methods.

Relevant initiatives  

Related knowledge about this paper Reproduced results (crowd-benchmarking and competitions) Artifact and reproducibility checklists Common formats for research projects and shared artifacts Reproducibility initiatives


Please log in to add your comments!
If you notice any inapropriate content that should not be here, please report us as soon as possible and we will try to remove it within 48 hours!