—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
As the weight of online social networks (OSNs) which provide powerful means of sharing common interests and communicating has gradually grown up, influencers are also given the gr...
PageRank-style authority analyses of Web graphs are of great importance for Web mining. Such authority analyses also apply to hot “Web 2.0” applications that exhibit a natural...
Josiane Xavier Parreira, Sebastian Michel, Matthia...
— We examine the social behaviors of game experts in Everquest II, a popular massive multiplayer online role-playing game (MMO). We rely on Exponential Random Graph Models (ERGM)...
David Huffaker, Jing (Annie) Wang, Jeffrey William...