Active exploration for large graphs

DOI10.1007/s10618-015-0424-zzbMath1411.68099OpenAlexW1661777882MaRDI QIDQ1741157

Meng Fang, Xingquan Zhu, Jie Yin

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-015-0424-z

zbMATH Keywords

random walksactive learningactive explorationnetworked datasupervised sampling

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimating PageRank on graph streams
• Text Mining
• Fast Connected Components Algorithms for the EREW PRAM
• Learning Theory
• Many Random Walks Are Faster Than One

This page was built for publication: Active exploration for large graphs