Abstract
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.
Original language | English (US) |
---|---|
Title of host publication | 2019 IEEE International Conference on Data Mining (ICDM) |
Publisher | IEEE |
Pages | 1-10 |
Number of pages | 10 |
ISBN (Print) | 9781728146041 |
DOIs | |
State | Published - Jan 31 2020 |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledgements: This work is supported by the King Abdullah University of Science and Technology (KAUST), Saudi Arabia