Active discriminative network representation learning

作者: Li Gao , Hong Yang , Chuan Zhou , Jia Wu , Shirui Pan

DOI: 10.24963/IJCAI.2018/296

关键词: Measure (data warehouse)Node (computer science)Discriminative modelActive learning (machine learning)Artificial intelligenceComputer scienceNetwork representation learningScheme (programming language)Machine learningActive learningRepresentation (mathematics)

摘要: Most of current network representation models are learned in unsupervised fashions, which usually lack the capability discrimination when applied to analysis tasks, such as node classification. It is worth noting that label information valuable for learning discriminative representations. However, labels all training nodes always difficult or expensive obtain and manually labeling inapplicable. Different sets labeled model lead different results. In this paper, we propose a novel method, termed ANRMAB, learn active representations with multi-armed bandit mechanism setting. Specifically, based on networking data representations, design three query strategies. By deriving an effective reward scheme closely related estimated performance measure interest, ANRMAB uses adaptive decision making select most informative labeling. The updated then used further learning. Experiments conducted public verify effectiveness ANRMAB.

参考文章(29)
Wei-Ning Hsu, Hsuan-Tien Lin, Active learning by learning national conference on artificial intelligence. pp. 2659- 2665 ,(2015)
Joannès Vermorel, Mehryar Mohri, Multi-armed Bandit Algorithms and Empirical Evaluation Machine Learning: ECML 2005. pp. 437- 448 ,(2005) , 10.1007/11564096_42
Pinar Donmez, Jaime G. Carbonell, Paul N. Bennett, Dual Strategy Active Learning european conference on machine learning. pp. 116- 127 ,(2007) , 10.1007/978-3-540-74958-5_14
Rajeev Motwani, Terry Winograd, Lawrence Page, Sergey Brin, The PageRank Citation Ranking : Bringing Order to the Web the web conference. ,vol. 98, pp. 161- 172 ,(1999)
Mark Newman, Networks: An Introduction ,(2010)
Karen Stephenson, Marvin Zelen, Rethinking centrality: Methods and examples Social Networks. ,vol. 11, pp. 1- 37 ,(1989) , 10.1016/0378-8733(89)90016-6
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire, The Nonstochastic Multiarmed Bandit Problem SIAM Journal on Computing. ,vol. 32, pp. 48- 77 ,(2003) , 10.1137/S0097539701398375
Robert E. Schapire, Alina Beygelzimer, Lihong Li, Lev Reyzin, John Langford, Contextual Bandit Algorithms with Supervised Learning Guarantees international conference on artificial intelligence and statistics. ,vol. 15, pp. 19- 26 ,(2011)
Xiaojin Zhu, John Lafferty, Zoubin Ghahramani, None, Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions international conference on machine learning. ,(2003)
Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, Tina Eliassi-Rad, Collective Classification in Network Data Ai Magazine. ,vol. 29, pp. 93- 106 ,(2008) , 10.1609/AIMAG.V29I3.2157