Yadong Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yadong Zhou has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Xiaohong Guan
Xi'an Jiaotong University, Xi'an, China
2 shared publications - Beibei Zhang
Ministry of Education Key Lab for Intelligent Networks and Network Security, Xi’an Jiaotong University, PR China
1 shared publication - Dai Wang
The School of Electronic Engineering of Computer Science, Berkeley University, USA
1 shared publication - Feng Gao
System Engineering Institute Xi'an Jiaotong University Xi'an China
1 shared publication - Qi Dang
Ministry of Education Key Lab for Intelligent Networks and Network Security, Xi’an Jiaotong University, Xi’an, People’s Republic of China
1 shared publication - Qindong Sun
School of Cyber Science and Engineering, Xian Jiaotong University, Xian, China
1 shared publication
Latest Publications
- 25 November 2016
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 31 (3) , 573-605
Detecting cooperative and organized spammer groups in micro-blogging community
- 25 November 2016
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 31 (3) , 573-605
Detecting cooperative and organized spammer groups in micro-blogging community
- 1 August 2016
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 456, 347-358
Dynamic structure evolution of time-dependent network
- 1 August 2016
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 456, 347-358
Dynamic structure evolution of time-dependent network
- Open Access
A Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph
Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications, such as matrix computations and PageRank, etc., but none has pay attention to random walks. Random walks is a widely used method to explore graph structure in lots of fields. The challenges of graph partition for random walks include the large number of times of communication between partitions, lots of replications of the vertices, unbalanced partition, etc. In this paper, we propose a feasible graph partition framework for random walks implemented by parallel computing in big graph. The framework is based on two optimization functions to reduce the bandwidth, memory and storage cost in the condition that the load balance is guaranteed. In this framework, several greedy graph partition algorithms are proposed. We also propose five metrics from different perspectives to evaluate the performance of these algorithms. By running the algorithms on the big graph data set of real world, the experimental results show that these algorithms in the framework are capable of solving the problem of graph partition for random walks for different needs, e.g. the best result is improved more than 70 times in reducing the times of communication.
Open AccessA Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph
Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications, such as matrix computations and PageRank, etc., but none has pay attention to random walks. Random walks is a widely used method to explore graph structure in lots of fields. The challenges of graph partition for random walks include the large number of times of communication between partitions, lots of replications of the vertices, unbalanced partition, etc. In this paper, we propose a feasible graph partition framework for random walks implemented by parallel computing in big graph. The framework is based on two optimization functions to reduce the bandwidth, memory and storage cost in the condition that the load balance is guaranteed. In this framework, several greedy graph partition algorithms are proposed. We also propose five metrics from different perspectives to evaluate the performance of these algorithms. By running the algorithms on the big graph data set of real world, the experimental results show that these algorithms in the framework are capable of solving the problem of graph partition for random walks for different needs, e.g. the best result is improved more than 70 times in reducing the times of communication.