vGraph
Code for NeurIPS paper "vGraph: A Generative Model for Joint CommunityDetection and Node Representation Learning"
view repo
This paper focuses on two fundamental tasks of graph analysis: community detection and node representation learning, which capture the global and local structures of graphs, respectively. In the current literature, these two tasks are usually independently studied while they are actually highly correlated. We propose a probabilistic generative model called vGraph to learn community membership and node representation collaboratively. Specifically, we assume that each node can be represented as a mixture of communities, and each community is defined as a multinomial distribution over nodes. Both the mixing coefficients and the community distribution are parameterized by the low-dimensional representations of the nodes and communities. We designed an effective variational inference algorithm which regularizes the community membership of neighboring nodes to be similar in the latent space. Experimental results on multiple real-world graphs show that vGraph is very effective in both community detection and node representation learning, outperforming many competitive baselines in both tasks. We show that the framework of vGraph is quite flexible and can be easily extended to detect hierarchical communities.
READ FULL TEXT VIEW PDF
In this paper, we study how to simultaneously learn two highly correlate...
read it
Representation learning of static and more recently dynamically evolving...
read it
This paper addresses the problem of community detection in networked dat...
read it
In most practical contexts network indexed data consists not only of a
d...
read it
Most existing community-related studies focus on detection, which aim to...
read it
Community detection refers to the task of discovering groups of vertices...
read it
Although the computational and statistical trade-off for modeling single...
read it
Code for NeurIPS paper "vGraph: A Generative Model for Joint CommunityDetection and Node Representation Learning"
Implementation of the paper "vGraph: A Generative Model For Joint Community Detection and Node Representational Learning" under NeurIPS Reproducibility challenge 2019
Graphs, or networks, are a general and flexible data structure to encode complex relationships among objects. Examples of real-world graphs include social networks, airline networks, protein-protein interaction networks, and traffic networks. Recently, there has been increasing interest from both academic and industrial communities in analyzing graphical data. Examples span a variety of domains and applications such as node classification cao2015grarep ; tang2015line and link prediction gao2011temporal ; wang2011community in social networks, role prediction in protein-protein interaction networks krogan2006global , and prediction of information diffusion in social and citation networks newman2004finding .
One fundamental task of graph analysis is community detection, which aims to cluster nodes into multiple groups called communities. Each community is a set of nodes that are more closely connected to each other than to nodes in different communities. A community level description is able to capture important information about a graph’s global structure. Such a description is useful in many real-world applications, such as identifying users with similar interests in social networks newman2004finding or proteins with similar functionality in biochemical networks krogan2006global . Community detection has been extensively studied in the literature, and a number of methods have been proposed, including algorithmic approaches ahn2010link ; derenyi2005clique and probabilistic models gopalan2013efficient ; mcauley2014discovering ; yang2013overlapping ; yang2013community
. A classical approach to detect communities is spectral clustering
white2005spectral, which assumes that neighboring nodes tend to belong to the same communities and detects communities by finding the eigenvectors of the graph Laplacian.
Another important task of graph analysis is node representation learning, where nodes are described using low-dimensional features. Node representations effectively capture local graph structure and are often used as features for many prediction tasks. Modern methods for learning node embeddings grover2016node2vec ; perozzi2014deepwalk ; tang2015line have proved effective on a variety of tasks such as node classification cao2015grarep ; tang2015line , link prediction gao2011temporal ; wang2011community and graph visualization tang2016node ; wang2016structural .
Clustering, which captures the global structure of graphs, and learning node embeddings, which captures local structure, are typically studied separately. Clustering is often used for exploratory analysis, while generating node embeddings is often done for predictive analysis. However, these two tasks are very correlated and it may be beneficial to perform both tasks simultaneously. The intuition is that (1) node representations can be used as good features for community detection (e.g., through K-means)
cavallari2017learning ; rozemberczki2018gemsec ; tsitsulin2018verse , and (2) the node community membership can provide good contexts for learning node representations wang2017community . However, how to leverage the relatedness of node clustering and node embedding in a unified framework for joint community detection and node representation learning is under-explored.In this paper, we propose a novel probabilistic generative model called vGraph for joint community detection and node representation learning. vGraph assumes that each node can be represented as a mixture of multiple communities and is described by a multinomial distribution over communities , i.e., . Meanwhile, each community is modeled as a distribution over the nodes , i.e., . vGraph models the process of generating the neighbors for each node. Given a node , we first draw a community assignment from . This indicates which community the node is going to interact with. Given the community assignment , we generate an edge by drawing another node according to the community distribution . Both the distributions and
are parameterized by the low-dimensional representations of the nodes and communities. As a result, this approach allows the node representations and the communities to interact in a mutually beneficial way. We also design a very effective algorithm for inference with backpropagation. We use variational inference for maximizing the lower-bound of the data likelihood. The Gumbel-Softmax
jang2016categorical trick is leveraged since the community membership variables are discrete. Inspired by existing spectral clustering methods dong2012clustering , we added a smoothness regularization term to the objective function of the variational inference routine to ensure that community membership of neighboring nodes is similar. The whole framework of vGraph is very flexible and general. We also show that it can be easily extended to detect hierarchical communities.In the experiment section, we show results on three tasks: overlapping community detection, non-overlapping community detection, and node classification– all using various real-world datasets. Our results show that vGraph is very competitive with existing state-of-the-art approaches for these tasks. We also present results on hierarchical community detection.
Community Detection. Many community detection methods are based on matrix factorization techniques. Typically, these methods try to recover the node-community affiliation matrix by performing a low-rank decomposition of the graph adjacency matrix or other related matrices kuang2012symmetric ; li2018community ; wang2011community ; yang2013overlapping . These methods are not scalable due to the complexity of matrix factorization, and their performance is restricted by the capacity of the bi-linear models. Many other studies develop generative models for community detection. Their basic idea is to characterize the generation process of graphs and cast community detection as an inference problem yang2013community ; zhang2015incorporating ; zhou2015infinite . However, the computational complexity of these methods is also high due to complicated inference. Compared with these approaches, vGraph is more scalable and can be efficiently optimized with backpropagation and Gumbel-Softmax jang2016categorical ; maddison2016concrete . Additionally, vGraph is able to learn and leverage the node representations for community detection.
Node Representation Learning.
The goal of node representation learning is to learn distributed representations of nodes in graphs so that nodes with similar local connectivity tend to have similar representations. Some representative methods include DeepWalk
perozzi2014deepwalk , LINE tang2015line , node2vec grover2016node2vec and GraphRep cao2015grarep . Typically, these methods explore the local connectivity of each node by conducting random walks with either breadth-first search perozzi2014deepwalk or depth-first search tang2015line . Despite their effectiveness in a variety of applications, these methods mainly focus on preserving the local structure of graphs, therefore ignoring global community information. In vGraph, we address this limitation by treating the community label as a latent variable. This way, the community label can provide additional contextual information which enables the learned node representations to capture the global community information.Framework for node representation learning and community detection. There exists previous work cavallari2017learning ; jia2019communitygan ; tsitsulin2018verse ; tu2018unified ; wang2017community that attempts to solve community detection and node representation learning jointly. However, their optimization process alternates between community assignment and node representation learning instead of simultaneously solving both tasks cavallari2017learning ; tu2018unified . Compared with these methods, vGraph is scalable and the optimization is done end-to-end.
Mixture Models. Methodologically, our method is related to mixture models, particularly topic models (e.g. PSLA hofmann1999probabilistic and LDA blei2003latent ). These methods simulate the generation of words in documents, in which topics are treated as latent variables, whereas we consider generating neighbors for each node in a graph, and the community acts as a latent variable. Compared with these methods, vGraph parameterizes the distributions with node and community embeddings, and all the parameters are trained with backpropagation.
Graphs are ubiquitous in the real-world. Two fundamental tasks on graphs are community detection and learning node embeddings, which focus on global and local graph structures respectively and hence are naturally complementary. In this paper, we study jointly solving these two tasks. Let represent a graph, where is a set of vertices and is the set of edges. Traditional graph embedding aims to learn a node embedding for each where is predetermined. Community detection aims to extract the community membership for each node. Suppose there are communities on the graph , we can denote the community assignment of node as . We aim to jointly learn node embeddings and community affiliation of vertices .
In this section, we introduce our generative approach vGraph, which aims at collaboratively learning node representations and detecting node communities. Our approach assumes that each node can belong to multiple communities representing different social contexts epasto2019single . Each node should generate different neighbors under different social contexts. vGraph parameterizes the node-community distributions by introducing node and community embeddings. In this way, the node representations can benefit from the detection of node communities. Similarly, the detected community assignment can in turn improve the node representations. Inspired by existing spectral clustering methods dong2012clustering , we add a smoothness regularization term that encourages linked nodes to be in the same communities.
vGraph models the generation of node neighbors. It assumes that each node can belong to multiple communities. For each node, different neighbors will be generated depending on the community context. Based on the above intuition, we introduce a prior distribution for each node and a node distribution for each community . The generative process of each edge can be naturally characterized as follows: for node , we first draw a community assignment , representing the social context of during the generation process. Then, the linked neighbor is generated based on the assignment through . Formally, this generation process can be formulated in a probabilistic way:
(1) |
vGraph parameterizes the distributions and by introducing a set of node embeddings and community embeddings. Note that different sets of node embeddings are used to parametrize the two distributions. Specifically, let denote the embedding of node used in the distribution , denote the embedding of node used in , and denote the embedding of the -th community. The prior distribution and the node distribution conditioned on a community are parameterized by two softmax models:
(2) |
(3) |
Calculating Eq. 3 can be expensive as it requires summation over all vertices. Thus, for large datasets we can employ negative sampling as done in LINE tang2015line using the following objective function:
(4) |
where , is a noise distribution, and is the number of negative samples. This, combined with stochastic optimization, enables our model to be scalable.
To learn the parameters of vGraph, we try to maximize the log-likelihood of the observed edges, i.e., . Since directly optimizing this objective is intractable for large graphs, we instead optimize the following evidence lower bound (ELBO) kingma2013auto :
(5) |
where is a variational distribution that approximates the true posterior distribution , and
represents the Kullback-Leibler divergence between two distributions.
Specifically, we parametrize the variational distribution
with a neural network as follows:
(6) |
where denotes element-wise multiplication. We chose element-wise multiplication because it is symmetric and it forces the representation of the edge to be dependent on both nodes.
The variational distribution represents the community membership of the edge . Based on this, we can easily approximate the community membership distribution of each node , i.e., by aggregating all its neighbors:
(7) |
where is the set of neighbors of node . To infer non-overlapping communities, we can simply take the of . However, when detecting overlapping communities instead of thresholding as in jia2019communitygan , we use
(8) |
That is, we assign each edge to one community and then map the edge communities to node communities by gathering nodes incident to all edges within each edge community as in ahn2010link .
For optimization, we need to optimize the lower bound (5) w.r.t. the parameters in the variational distribution and the generative parameters. If is continuous, the reparameterization trick kingma2013auto can be used. However,
is discrete in our case. In principle, we can still estimate the gradient using a score function estimator
glynn1990likelihood ; williams1992simple. However, the score function estimator suffers from a high variance, even when used with a control variate. Thus, we use the Gumbel-Softmax reparametrization
jang2016categorical ; maddison2016concrete to obtain gradients for the evidence lower bound. More specifically, we use the straight-through Gumbel-Softmax estimator jang2016categorical .A community can be defined as a group of nodes that are more similar to each other than to those outside the group pei2015nonnegative . For a non-attributed graph, two nodes are similar if they are connected and share similar neighbors. However, vGraph does not explicitly weight local connectivity in this way. To resolve this, inspired by existing spectral clustering studies dong2012clustering , we augment our training objective with a smoothness regularization term that encourages the learned community distributions of linked nodes to be similar. Formally, the regularization term is given below:
(9) |
where
is a tunable hyperparameter ,
is a regularization weight, and is the distance between two distributions (squared difference in our experiments). Motivated by rozemberczki2018gemsec , we set to be the Jaccard’s coefficient of node and , which is given by:(10) |
where denotes the set of neighbors of . The intuition behind this is that serves as a similarity measure of how similar the neighbors are between two nodes. Jaccard’s coefficient is used for this metric and thus the higher the value of Jaccard’s coefficient, the more the two nodes are encouraged to have similar distribution over communities.
By combining the evidence lower bound and the smoothness regularization term, the entire loss function we aim to minimize is given below:
(11) |
For large datasets, negative sampling can be used for the first term.
One advantage of vGraph’s framework is that it is very general and can be naturally extended to detect hierarchical communities. In this case, suppose we are given a -level tree and each node is associate with a community, the community assignment can be represented as a
-dimensional path vector
, as shown in Fig. 3. Then, the generation process is formulated as below: (1) a tree path is sampled from a prior distribution . (2) The context is decoded from with . Under this model, the likelihood of the network is(12) |
At every node of the tree, there is an embedding vector associated with the community. Such a method is similar to the hierarchical softmax parameterization used in language models morin2005hierarchical .
Dataset | || | || | AS | AN | |
Nonoverlapping | |||||
Cornell | 195 | 286 | 5 | 39.00 | 1 |
Texas | 187 | 298 | 5 | 37.40 | 1 |
Washington | 230 | 417 | 5 | 46.00 | 1 |
Wisconsin | 265 | 479 | 5 | 53.00 | 1 |
Cora | 2708 | 5278 | 7 | 386.86 | 1 |
Citeseer | 3312 | 4660 | 6 | 552.00 | 1 |
overlapping | |||||
facebook0 | 333 | 2519 | 24 | 13.54 | 0.98 |
facebook107 | 1034 | 26749 | 9 | 55.67 | 0.48 |
facebook1684 | 786 | 14024 | 17 | 45.71 | 0.99 |
facebook1912 | 747 | 30025 | 46 | 23.15 | 1.43 |
facebook3437 | 534 | 4813 | 32 | 6.00 | 0.36 |
facebook348 | 224 | 3192 | 14 | 40.50 | 2.53 |
facebook3980 | 52 | 146 | 17 | 3.41 | 1.12 |
facebook414 | 150 | 1693 | 7 | 25.43 | 1.19 |
facebook686 | 168 | 1656 | 14 | 34.64 | 2.89 |
facebook698 | 61 | 270 | 13 | 6.54 | 1.39 |
Youtube | 5346 | 24121 | 5 | 1347.80 | 1.26 |
Amazon | 794 | 2109 | 5 | 277.20 | 1.75 |
Dblp | 24493 | 89063 | 5 | 5161.40 | 1.05 |
Coauthor-CS | 9252 | 33261 | 5 | 2920.60 | 1.58 |
Dblp-full | 93432 | 335520 | 5000 | 22.45 | 1.20 |
As vGraph can detect both overlapping and non-overlapping communities, we evaluate it on three tasks: overlapping community detection, non-overlapping community detection, and vertex classification.
We evaluate vGraph on 20 standard graph datasets. For non-overlapping community detection and node classification, we use 6 datasets: Citeseer, Cora, Cornell, Texas, Washington, and Wisconsin. For overlapping communtiy detection, we use 14 datasets, including Facebook, Youtube, Amazon, Dblp, Coauthor-CS. For Youtube, Amazon, and Dblp, we consider subgraphs with the 5 largest ground-truth communities due to the runtime of baseline methods. To demonstrate the scalability of our method, we additionally include visualization results on a large dataset – Dblp-full. Dataset statistics are provided in Table 1. More details about the datasets is provided in Appendix A.
For overlapping community detection, we use F1-Score and Jaccard Similarity to measure the performance of the detected communities as in yang2013community ; li2018community . For non-overlapping community detection, we use Normalized Mutual Information (NMI) tian2014learning and Modularity. Note that Modularity does not utilize ground truth data. For node classification, Micro-F1 and Macro-F1 are used.
For overlapping community detection, we choose four competitive baselines: BigCLAM yang2013overlapping , a nonnegative matrix factorization approach based on the Bernoulli-Poisson link that only considers the graph structure; CESNA yang2013community , an extension of BigCLAM, that additionally models the generative process for node attributes; Circles mcauley2014discovering , a generative model of edges w.r.t. attribute similarity to detect communities; and SVI gopalan2013efficient , a Bayesian model for graphs with overlapping communities that uses a mixed‐membership stochastic blockmodel.
To evaluate node embedding and non-overlapping community detection, we compare our method with the five baselines: MF wang2011community , which represents each vertex with a low-dimensional vector obtained through factoring the adjacency matrix; DeepWalk perozzi2014deepwalk , a method that adopts truncated random walk and Skip-Gram to learn vertex embeddings; LINE tang2015line , which aims to preserve the first-order and second-order proximity among vertices in the graph; Node2vec grover2016node2vec , which adopts biased random walk and Skip-Gram to learn vertex embeddings; and ComE cavallari2017learning
, which uses a Gaussian mixture model to learn an embedding and clustering jointly using random walk features.
For all baseline methods, we use the implementations provided by their authors and use the default parameters. For methods that only output representations of vertices, we apply K-means to the learned embeddings to get non-overlapping communities. Results report are averaged over 5 runs. No node attributes are used in all our experiments. We generate node attributes using node degree features for those methods that require node attributes such as CESNA yang2013community and Circles mcauley2014discovering . It is hard to compare the quality of community results when the numbers of communities are different for different methods. Therefore, we set the number of communities to be detected, , as the number of ground-truth communities for all methods, as in li2018community . For vGraph, we use full-batch training when the dataset is small enough. Otherwise, we use stochastic training with a batch size of 5000 or 10000 edges. The initial learning rate is set to 0.05 and is decayed by 0.99 after every 100 iterations. We use the Adam optimizer and we trained for 5000 iterations. When smoothness regularization is used, is set to . For community detection, the model with the lowest loss is chosen. For node classification, we evaluate node embeddings after 1000 iterations of training. The dimension of node embeddings is set to 128 in all experiments for all methods. For the node classification task, we randomly select 70% of the labels for training and use the rest for testing.
F1-score | Jaccard | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Dataset | Bigclam | CESNA | Circles | SVI | vGraph | vGraph+ | Bigclam | CESNA | Circles | SVI | vGraph | vGraph+ |
facebook0 | 0.2948 | 0.2806 | 0.2860 | 0.2810 | 0.2440 | 0.2606 | 0.1846 | 0.1725 | 0.1862 | 0.1760 | 0.1458 | 0.1594 |
facebook107 | 0.3928 | 0.3733 | 0.2467 | 0.2689 | 0.2817 | 0.3178 | 0.2752 | 0.2695 | 0.1547 | 0.1719 | 0.1827 | 0.2170 |
facebook1684 | 0.5041 | 0.5121 | 0.2894 | 0.3591 | 0.4232 | 0.4379 | 0.3801 | 0.3871 | 0.1871 | 0.2467 | 0.2917 | 0.3272 |
facebook1912 | 0.3493 | 0.3474 | 0.2617 | 0.2804 | 0.2579 | 0.3750 | 0.2412 | 0.2394 | 0.1672 | 0.2010 | 0.1855 | 0.2796 |
facebook3437 | 0.1986 | 0.2009 | 0.1009 | 0.1544 | 0.2087 | 0.2267 | 0.1148 | 0.1165 | 0.0545 | 0.0902 | 0.1201 | 0.1328 |
facebook348 | 0.4964 | 0.5375 | 0.5175 | 0.4607 | 0.5539 | 0.5314 | 0.3586 | 0.4001 | 0.3927 | 0.3360 | 0.4099 | 0.4050 |
facebook3980 | 0.3274 | 0.3574 | 0.3203 | NA | 0.4450 | 0.4150 | 0.2426 | 0.2645 | 0.2097 | NA | 0.3376 | 0.2933 |
facebook414 | 0.5886 | 0.6007 | 0.4843 | 0.3893 | 0.6471 | 0.6693 | 0.4713 | 0.4732 | 0.3418 | 0.2931 | 0.5184 | 0.5587 |
facebook686 | 0.3825 | 0.3900 | 0.5036 | 0.4639 | 0.4775 | 0.5379 | 0.2504 | 0.2534 | 0.3615 | 0.3394 | 0.3272 | 0.3856 |
facebook698 | 0.5423 | 0.5865 | 0.3515 | 0.4031 | 0.5396 | 0.5950 | 0.4192 | 0.4588 | 0.2255 | 0.3002 | 0.4356 | 0.4771 |
Youtube | 0.4370 | 0.3840 | 0.3600 | 0.4140 | 0.5070 | 0.5220 | 0.2929 | 0.2416 | 0.2207 | 0.2867 | 0.3434 | 0.3480 |
Amazon | 0.4640 | 0.4680 | 0.5330 | 0.4730 | 0.5330 | 0.5320 | 0.3505 | 0.3502 | 0.3671 | 0.3643 | 0.3689 | 0.3693 |
Dblp | 0.2360 | 0.3590 | NA | NA | 0.3930 | 0.3990 | 0.1384 | 0.2226 | NA | NA | 0.2501 | 0.2505 |
Coauthor-CS | 0.3830 | 0.4200 | NA | 0.4070 | 0.4980 | 0.5020 | 0.2409 | 0.2682 | NA | 0.2972 | 0.3517 | 0.3432 |
Table 2 shows the results on overlapping community detection. Some of the methods are not very scalable and cannot obtain results in 24 hours on some larger datasets. Compared with these studies, vGraph outperforms all baseline methods in 11 out of 14 datasets in terms of F1-score or Jaccard Similarity, as it is able to leverage useful representations at node level. Moreover, vGraph is also very efficient on these datasets, since we use employ variational inference and parameterize the model with node and community embeddings. By adding the smoothness regularization term (vGraph+), we see a farther increase performance, which shows that our method can be combined with concepts from traditional community detection methods.
The results for non-overlapping community detection are presented in Table 3. vGraph outperforms all conventional node embeddings + K-Means in 4 out of 6 datasets in terms of NMI and outperforms all 6 in terms of modularity. ComE, another framework that jointly solves node embedding and community detection, also generally performs better than other node embedding methods + K-Means. This supports our claim that learning these two tasks collaboratively instead of sequentially can further enhance performance. Compare to ComE, vGraph performs better in 4 out of 6 datasets in terms of NMI and 5 out of 6 datasets in terms of modularity. This shows that vGraph can also outperform frameworks that learn node representations and communities together.
Table 4 shows the result for the node classification task. vGraph significantly outperforms all the baseline methods in 9 out of 12 datasets. The reason is that most baseline methods only consider the local graph information without modeling the global semantics. vGraph solves this problem by representing node embeddings as a mixture of communities to incorporate global context.
NMI | Modularity | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Dataset | MF | deepwalk | LINE | node2vec | ComE | vGraph | MF | deepwalk | LINE | node2vec | ComE | vGraph |
cornell | 0.0632 | 0.0789 | 0.0697 | 0.0712 | 0.0732 | 0.0803 | 0.4220 | 0.4055 | 0.2372 | 0.4573 | 0.5748 | 0.5792 |
texas | 0.0562 | 0.0684 | 0.1289 | 0.0655 | 0.0772 | 0.0809 | 0.2835 | 0.3443 | 0.1921 | 0.3926 | 0.4856 | 0.4636 |
washington | 0.0599 | 0.0752 | 0.0910 | 0.0538 | 0.0504 | 0.0649 | 0.3679 | 0.1841 | 0.1655 | 0.4311 | 0.4862 | 0.5169 |
wisconsin | 0.0530 | 0.0759 | 0.0680 | 0.0749 | 0.0689 | 0.0852 | 0.3892 | 0.3384 | 0.1651 | 0.5338 | 0.5500 | 0.5706 |
cora | 0.2673 | 0.3387 | 0.2202 | 0.3157 | 0.3660 | 0.3445 | 0.6711 | 0.6398 | 0.4832 | 0.5392 | 0.7010 | 0.7358 |
citeseer | 0.0552 | 0.1190 | 0.0340 | 0.1592 | 0.2499 | 0.1030 | 0.6963 | 0.6819 | 0.4014 | 0.4657 | 0.7324 | 0.7711 |
Macro-F1 | Micro-F1 | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Datasets | MF | DeepWalk | LINE | Node2Vec | ComE | vGraph | MF | DeepWalk | LINE | Node2Vec | ComE | vGraph |
Cornell | 13.05 | 22.69 | 21.78 | 20.70 | 19.86 | 29.76 | 15.25 | 33.05 | 23.73 | 24.58 | 25.42 | 37.29 |
Texas | 8.74 | 21.32 | 16.33 | 14.95 | 15.46 | 26.00 | 14.03 | 40.35 | 27.19 | 25.44 | 33.33 | 47.37 |
Washington | 15.88 | 18.45 | 13.99 | 21.23 | 15.80 | 30.36 | 15.94 | 34.06 | 25.36 | 28.99 | 33.33 | 34.78 |
Wisconsin | 14.77 | 23.44 | 19.06 | 18.47 | 14.63 | 29.91 | 18.75 | 38.75 | 28.12 | 25.00 | 32.50 | 35.00 |
Cora | 11.29 | 13.21 | 11.86 | 10.52 | 12.88 | 16.23 | 12.79 | 22.32 | 14.59 | 27.74 | 28.04 | 24.35 |
Citeseer | 14.59 | 16.17 | 15.99 | 16.68 | 12.88 | 17.88 | 15.79 | 19.01 | 16.80 | 20.82 | 19.42 | 20.42 |
In order to gain more insight, we present visualizations of the facebook107 dataset in Fig. 6(a). To demonstrate that our model can be applied to large networks, we present results of vGraph on a co-authorship network with around 100,000 nodes and 330,000 edges in Fig. 6(b). More visualizations are available in appendix B. We can observe that the community structure, or “social context”, is reflected in the corresponding node embedding (node positions in both visualizations are determined by t-SNE of the node embeddings). To demonstrate the hierarchical extension of our model, we visualize a subset of the co-authorship dataset in Fig. 10. We visualize the first-tier communities and second-tier communities in panel (a) and (b) respectively. We can observe that the second-tier communities grouped under the same first-tier communities interact more with themselves than they do with other second-tier communities.
In this paper, we proposed vGraph, a method that performs overlapping (and non-overlapping) community detection and learns node and community embeddings at the same time. vGraph casts the generation of edges in a graph as an inference problem. To encourage collaborations between community detection and node representation learning, we assume that each node can be represented by a mixture of communities, and each community is defined as a multinomial distribution over nodes. We also design a smoothness regularizer in the latent space to encourage neighboring nodes to be similar. Empirical evaluation on 20 different benchmark datasets demonstrates the effectiveness of the proposed method on both tasks compared to competitive baselines. Furthermore, our model is also readily extendable to detect hierarchical communities.
Journal of machine Learning research
, 3(Jan):993–1022, 2003.Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
, pages 289–296. Morgan Kaufmann Publishers Inc., 1999.Simple statistical gradient-following algorithms for connectionist reinforcement learning.
Machine learning, 8(3-4):229–256, 1992.Citeseer, Cora, Cornell, Texas, Washington, and Wisconsin are available online^{1}^{1}1https://linqs.soe.ucsc.edu. For Youtube, Amazon, and Dblp, we consider subgraphs with the 5 largest ground-truth communities due to the runtime of the baseline methods.
Facebook^{2}^{2}2https://snap.stanfod.edu/data/ego-Facebook.html is a set of Facebook ego-networks. It contains 10 different ego-networks with identified circles. Social circles formed by friends are regarded as ground-truth communities.
Youtube^{3}^{3}3http://snap.stanford.edu/data/com-Youtube.html is a network of social relationships of Youtube users. The vertices represent users; the edges indicate friendships among the users; the user-defined groups are considered as ground-truth communities.
Amazon^{4}^{4}4http://snap.stanford.edu/data/com-Amazon.html is collected by crawling amazon website. The vertices represent products and the edges indicate products frequently purchased together. The ground-truth communities are defined by the product categories on Amazon.
Dblp^{5}^{5}5http://snap.stanford.edu/data/com-DBLP.html is a co-authorship network from Dblp. The vertices represent researchers and the edges indicate co-author relationships. Authors who have published in a same journal or conference form a community.
Coauthor-CS^{6}^{6}6https://aminer.org/aminernetwork is a computer science co-authorship network. We chose 21 conferences and group them into five categories: Machine Learning, Computer Linguistics, Programming language, Data mining, and Database.
Comments
There are no comments yet.