Abstract
With the growing explosion of online social networks, the study of large-scale graph clustering has attracted considerable interest. Most of traditional methods view the graph clustering problem as an optimization problem based on a given objective function; however, there are few methodical theories for the emergence of clusters over real-life networks. In this paper, each actor in online social networks is viewed as a selfish player in a non-cooperative game. The strategy associated with each node is defined as the cluster membership vector, and each one's incentive is to maximize its own social identity by adopting the most suitable strategy. The definition of utility function in our game model is inspired by the conformity psychology, which is defined as the weighted average of one's social identity by participating different clusters. With this setting, the proposed game can well match a potential game. So that the cluster could be shaped by the actions of those closely interactive users who adopt the same strategy in a Nash equilibrium. To this end, we propose a novel Graph cLustering framework based on potEntial gAme optiMization (GLEAM) for parallel graph clustering. It first utilize the cosine similarity to weight each edge in the original network. Then, an initial partition, including a number of clusters dominated by those potential "leader nodes", is created by a fast heuristic process. Third, a potential game-based weighted Modularity optimization is used to improve the initial partition. Finally, we introduce the notion of potentially attractive cluster, and then discover the overlapping partition of the graph using a simple double-threshold procedure. Three phases in GLEAM are carefully designed for parallel execution. Experiments on real-world networks analyze the convergence inside GLEAM, and demonstrate the high performance of GLEAM by comparing it with the state-of-the-art community detection approaches in the literature.
from # All Medicine by Alexandros G. Sfakianakis via alkiviadis.1961 on Inoreader http://ift.tt/2yB8ioE
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.