BurstBiRank: Co-Ranking Developers and Projects in GitHub with Complex Network Structures and Bursty Interactions

Algorithm 1

BurstBiRank algorithm.

	Input:
	Developer-project interaction set (DP); query vectors , ; and hyperparameters γ, λ
	Output:
	Ranking vectors u, p;
(1)	Group developer-project interactions by developer and project;
(2)	for developer-project interactions group in all groups do
(3)	Sort developer-project interactions by commit time in descending order;
(4)	Calculate time intervals between successive records;
(5)	Calculate burstiness ;
(6)	Calculate edge weight according to equation (3);
(7)	end for
(8)	Construct weight matrix W;
(9)	Symmetrically normalize W according to equation (11);
(10)	Randomly initialize u and p;
(11)	while Stopping criteria are not met do
(12)	Update u and p in turn according equations (9) and (10);
(13)	end while
(14)	return u and p