ExpFinder: Finding experts by graph pattern matching

We present ExpFinder, a system for finding experts in social networks based on graph pattern matching. We demonstrate (1) how ExpFinder identifies top-K experts in a social network by supporting bounded simulation of graph patterns, and by ranking the matches based on a metric for social impact; (2) how it copes with the sheer size of real-life social graphs by supporting incremental query evaluation and query preserving graph compression, and (3) how the GUI of ExpFinder interacts with users to help them construct queries and inspect matches.

[1]  Theodoros Lappas,et al.  A Survey of Algorithms and Systems for Expert Location in Social Networks , 2011, Social Network Data Analytics.

[2]  Xin Wang,et al.  Query preserving graph compression , 2012, SIGMOD Conference.

[3]  Theodoros Lappas,et al.  Finding a team of experts in social networks , 2009, KDD.

[4]  Jianzhong Li,et al.  Graph pattern matching , 2010, Proc. VLDB Endow..

[5]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Thomas A. Henzinger,et al.  Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[7]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[8]  Xin Wang,et al.  Incremental graph pattern matching , 2013, TODS.

[9]  David W. McDonald,et al.  Social matching: A framework and research agenda , 2005, TCHI.

[10]  Siddhartha R. Jonnalagadda,et al.  Scientific collaboration networks using biomedical text. , 2014, Methods in molecular biology.

[11]  Jie Tang,et al.  ArnetMiner: extraction and mining of academic social networks , 2008, KDD.

[12]  Lisa Kaati,et al.  Detecting Social Positions Using Simulation , 2010, 2010 International Conference on Advances in Social Networks Analysis and Mining.