On Random Walk Based Weighted Graph Sampling-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On Random Walk Based Weighted Graph Sampling

Published:2018 Issue:2 Volume:E101.D Page:535-538
ISSN:0916-8532
Container-title:IEICE Transactions on Information and Systems
language:en
Short-container-title:IEICE Trans. Inf. & Syst.

Author:

ZHOU Jiajun¹,LIU Bo¹,DENG Lu¹,CHEN Yaofeng¹,XIAO Zhefeng¹

Affiliation:

1. College of Computer, National University of Defense Technology

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

https://www.jstage.jst.go.jp/article/transinf/E101.D/2/E101.D_2017EDL8179/_pdf

Reference12 articles.

1. [1] A. Mislove, M. Marcon, K.P. Gummadi, P. Druschel, and B. Bhattacharjee, “Measurement and analysis of online social networks,” Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, San Diego, California, USA, pp.29-42, 2007. 10.1145/1298306.1298311

2. [2] J.D. Wendt, R. Wells, R.V. Field, and S. Soundarajan, “On data collection, graph construction, and sampling in Twitter,” 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp.985-992, 2016. 10.1109/asonam.2016.7752360

3. [3] M. Najork and J.L. Wiener, “Breadth-first crawling yields high-quality pages,” in Proceedings of the 10th international conference on World Wide Web, Hong Kong, Hong Kong, pp.114-118, 2001. 10.1145/371920.371965

4. [4] X. Wang, R.T.B. Ma, Y. Xu, and Z. Li, “Sampling online social networks via heterogeneous statistics,” Computer Communications (INFOCOM), 2015 IEEE Conference on, pp.2587-2595, 2015. 10.1109/infocom.2015.7218649

5. [5] M. Gjoka, M. Kurant, C.T. Butts, and A. Markopoulou, “Practical recommendations on crawling online social networks,” Selected Areas in Communications, IEEE Journal on, vol.29, no.9, pp.1872-1892, 2011. 10.1109/jsac.2011.111011

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Feature fusion graph attention network for link prediction;International Conference on Algorithms, High Performance Computing, and Artificial Intelligence (AHPCAI 2021);2021-12-22

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3