TY - GEN
T1 - Collaborative graph walk for semi-supervised multi-label node classification
AU - Akujuobi, Uchenna Thankgod
AU - Yufei, Han
AU - Zhang, Qiannan
AU - Zhang, Xiangliang
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: This work is supported by the King Abdullah University of Science and Technology (KAUST), Saudi Arabia
PY - 2020/1/31
Y1 - 2020/1/31
N2 - In this work, we study semi-supervised multi-label node classification problem in attributed graphs. Classic solutions to multi-label node classification follow two steps, first learn node embedding and then build a node classifier on the learned embedding. To improve the discriminating power of the node embedding, we propose a novel collaborative graph walk, named Multi-Label-Graph-Walk, to finely tune node representations with the available label assignments in attributed graphs via reinforcement learning. The proposed method formulates the multi-label node classification task as simultaneous graph walks conducted by multiple label-specific agents. Furthermore, policies of the label-wise graph walks are learned in a cooperative way to capture first the predictive relation between node labels and structural attributes of graphs; and second, the correlation among the multiple label-specific classification tasks. A comprehensive experimental study demonstrates that the proposed method can achieve significantly better multi-label classification performance than the state-of-the-art approaches and conduct more efficient graph exploration.
AB - In this work, we study semi-supervised multi-label node classification problem in attributed graphs. Classic solutions to multi-label node classification follow two steps, first learn node embedding and then build a node classifier on the learned embedding. To improve the discriminating power of the node embedding, we propose a novel collaborative graph walk, named Multi-Label-Graph-Walk, to finely tune node representations with the available label assignments in attributed graphs via reinforcement learning. The proposed method formulates the multi-label node classification task as simultaneous graph walks conducted by multiple label-specific agents. Furthermore, policies of the label-wise graph walks are learned in a cooperative way to capture first the predictive relation between node labels and structural attributes of graphs; and second, the correlation among the multiple label-specific classification tasks. A comprehensive experimental study demonstrates that the proposed method can achieve significantly better multi-label classification performance than the state-of-the-art approaches and conduct more efficient graph exploration.
UR - http://hdl.handle.net/10754/660643
UR - https://ieeexplore.ieee.org/document/8970680/
UR - http://www.scopus.com/inward/record.url?scp=85078949007&partnerID=8YFLogxK
U2 - 10.1109/ICDM.2019.00010
DO - 10.1109/ICDM.2019.00010
M3 - Conference contribution
SN - 9781728146041
SP - 1
EP - 10
BT - 2019 IEEE International Conference on Data Mining (ICDM)
PB - IEEE
ER -