Many real-world domains are relational in nature, consisting of a set of objects related to each other in complex ways. This paper focuses on predicting the existence and the type...
Benjamin Taskar, Ming Fai Wong, Pieter Abbeel, Dap...
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
Vicente P. Guerrero Bote, Felipe Zapico-Alonso, Ma...
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Massively multiplayer online games (MMOGs) can be fascinating laboratories to observe group dynamics online. In particular, players must form persistent associations or "guil...
Nicolas Ducheneaut, Nicholas Yee, Eric Nickell, Ro...