GitHub - LuckySherry/TeamFormation: Experimental study on team formation problem.

This repository has been archived by the owner on Jun 28, 2021. It is now read-only.

LuckySherry / TeamFormation Public archive

Notifications You must be signed in to change notification settings
Fork 4
Star 7

Experimental study on team formation problem.

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
USTF_Code		USTF_Code
.gitattributes		.gitattributes
.gitignore		.gitignore
Approx.cpp		Approx.cpp
CoverSteiner.cpp		CoverSteiner.cpp
FindBestKWO.cpp		FindBestKWO.cpp
FindBestWLeader.cpp		FindBestWLeader.cpp
FindBestWO.cpp		FindBestWO.cpp
GreedyCover.cpp		GreedyCover.cpp
GreedyDiameter.cpp		GreedyDiameter.cpp
GreedyMST.cpp		GreedyMST.cpp
HenceSteiner.cpp		HenceSteiner.cpp
MCC-Rare.cpp		MCC-Rare.cpp
MCC.cpp		MCC.cpp
MinAggrSol.cpp		MinAggrSol.cpp
MinDiamSol.cpp		MinDiamSol.cpp
MinMaxSol.cpp		MinMaxSol.cpp
README		README
Random.cpp		Random.cpp
Replace.cpp		Replace.cpp
WWW2012_LLT.cpp		WWW2012_LLT.cpp
WWW2012_SC.cpp		WWW2012_SC.cpp
WWW2012_dia.cpp		WWW2012_dia.cpp
rarest_first.cpp		rarest_first.cpp

Repository files navigation

This repository contains the codes for 20 algorithms that introduced in the past years papers.

For each program, please the change const "PATH" the the directory that contains all the shortest paths from one vertex to another.

For some special programs, const "SKILLPATH" stands for the directory that contains all the path from a skill to every vertex in the graph, for details please refer to the paper in 2009[1].

Each code needs to point out the path of the author-coauthor relationship file and the skill-author inverted index file. For some particular programs which involed capacity or cost function need to assign the path to the capacity and cost file.

In the cost-based algorithms implemented programs, the cost funciton maybe need to be rewritten to nomalize the cost to different scale or different calculation method.

Followings are the mappings between papers and code file names:

"Finding a team of experts in social networks"[1] : rarest_first.cpp, CoverSteiner.cpp, HenceSteiner.cpp, GreedyCover.cpp, GreedyDiameter.cpp, GreedyMST.cpp;

"Discovering top-k teams of experts with/without a leader in social networks"[2]: FindBestWO.cpp, FindBestWLeader.cpp, FindBestKWO.cpp

"Capacitated team formation problem on social networks"[3]: MinDiamSol.cpp, MinDiamSol.cpp, MinMaxSol.cpp

"Online team formation in social networks"[4]: WWW2012_SC.cpp, WWW2012_LLT.cpp, WWW2012_SC.cpp

"Efficient bi-objective team formation in social networks"[5]: Approx.cpp, Replace.cpp, MCC.cpp, MCC-Rare.cpp, Random.cpp




[1] T. Lappas, K. Liu, and E. Terzi. Finding a team of experts in social networks. In SIGKDD, pages 467-476. ACM, 2009. 
[2] M. Kargar and A. An. Discovering top-k teams of experts with/without a leader in social networks. In CIKM, pages 985-994. ACM, 2011.
[3] A. Majumder, S. Datta, and K. Naidu. Capacitated team formation problem on social networks. In SIGKDD, pages 1005¨C1013. ACM, 2012.
[4] A. Anagnostopoulos, L. Becchetti, C. Castillo, A. Gionis, and S. Leonardi. Online team formation in social networks. In WWW, pages 839-848. ACM, 2012
[5] M. Kargar, A. An, and M. Zihayat. Efficient bi-objective team formation in social networks. In ECMLPKDD, pages 483-498. Springer, 2012.