Supervised Blockmodelling

09/25/2012 ∙ by Leto Peel, et al. ∙ UCL 0

Collective classification models attempt to improve classification performance by taking into account the class labels of related instances. However, they tend not to learn patterns of interactions between classes and/or make the assumption that instances of the same class link to each other (assortativity assumption). Blockmodels provide a solution to these issues, being capable of modelling assortative and disassortative interactions, and learning the pattern of interactions in the form of a summary network. The Supervised Blockmodel provides good classification performance using link structure alone, whilst simultaneously providing an interpretable summary of network interactions to allow a better understanding of the data. This work explores three variants of supervised blockmodels of varying complexity and tests them on four structurally different real world networks.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Probabilistic classification algorithms have long focused on the problem of predicting unknown labels of data instances according to their attributes by leveraging the conditional distributions of a supplied training set. These algorithms traditionally made an assumption that the data was independent and identically distributed, however many modern datasets break this assumption. As a result, research has shifted to examining how these relations or links can be exploited to improve classification performance. Collective classification is one approach which attempts this but often assumes that instances of a given class tend to link others of the same class, i.e that the class instances are assortative.

Recently, stochastic blockmodelling has been applied in a classification context to overcome the need for assortativity assumptions [1, 2]. In addition, the stochastic blockmodel can be used to understand the pattern of interactions between class instances by the way of a summary network of role interactions. This work describes three classification models of varying complexity based on the stochastic blockmodel along with efficient inference updates using collapsed variational Bayes. Their relative performance is investigated in various within-network classification cases. Finally, an example is given of the analysis that can be conducted on the resulting model to better understand both the structure of the data and the classification decision.

The main contribution of this work is the comparison between the models and the introduction of a model of intermediate complexity (section 3.2). A minor contribution is the new update equations (section 4) based on collapsed variational inference [3] which avoids the long running time and convergence diagnosis of the Gibbs sampling in [2] and the parameter updates and expensive Digamma function evaluations of the variational inference in [1].

2 Background

Blockmodels have been used for social and psychometric analysis for decades [4, 5, 6]

. The name refers to the “blocks” of zero and non-zero elements that occur in the adjacency matrix when the rows and columns are reordered such that nodes with similar interaction patterns are adjacent. The clusters of nodes which make up these block patterns are known as network roles. Nodes belonging to the same role are equivalent to each other with respect to their probability of linking to nodes of other roles in the network. The pattern of interactions between roles provides a summary of the interactions of the network. The original blockmodels were

a-priori blockmodels where the assignment of nodes to roles was predetermined, usually according to the attributes of the nodes. Bayesian formulations of blockmodelling, known as stochastic blockmodelling [7], were developed to create blockmodels by automatically inferring nodes roles according to the posterior distribution given the observed network links. The blockmodelling paradigm then comes full circle with the supervised blockmodel as the roles inferred from the network structure are then used to predict the attributes of the network in a given classification problem.

Stochastic blockmodels are usually used in an unsupervised context but can easily be transferred to the supervised setting by simply instantiating the roles of the nodes in the training set and inferring the remainder of the network as in [2]. In this case no extra variables are required as the roles and classes are equivalent and the inference procedure remains the same. This type of model, however, assumes that the classes are homogeneous in their linkage patterns and that all nodes of a particular class behave in the same way. To address this, an extension to the standard blockmodelling approach can be made based on supervised Latent Dirichlet Allocation (sLDA) [8] which, as the name suggests, is a supervised extension of the topic modelling approach LDA [9]

. Latent Dirichlet Allocation is a method for clustering a corpus of documents into topics. The sLDA model extends the LDA approach to identify topics in documents which not only best describes the document structures but also to predict a known response variable (i.e. a classification or regression target) associated with each document. Similarly, a supervised blockmodel can be derived which identifies roles which both summarise the network structure and predict the class labels of nodes. By making a distinction between the roles and the classes it is possible to model heterogeneous linkage patterns within classes. Two such models are presented here: one which assigns a single role to each node, and one which allows nodes to have multiple role memberships.

3 Supervised Blockmodels

This section describes the three variants of supervised blockmodels examined in this paper.

3.1 Standard Stochastic Blockmodel

A standard Stochastic Blockmodel (SBM) assumes the following generative process:

  1. For a given network draw a distribution over the roles in the network

  2. For each of the possible role interactions:

    1. Draw a probability of interacting

  3. For each node in the network, :

    1. Draw a role

  4. For each of the possible sender-receiver directed interactions, :

    1. Draw a binary value to indicate the presence or absence of a link

The application of a standard Stochastic Blockmodel was demonstrated in [2] where the roles and classes are considered as the same thing.

3.2 Supervised Single Membership Blockmodel

The Supervised Single Membership Blockmodel (SSMB) is very similar to the SBM but introduces a separate class variable to allow for heterogeneity within classes, i.e. each class may have more than one role.

  1. For a given network draw a distribution over the roles in the network

  2. For each of the possible role interactions:

    1. Draw a probability of interacting

  3. For each role in the network, :

    1. Draw a distribution over classes

  4. For each node in the network, :

    1. Draw a role

    2. Draw a class label

  5. For each of the possible sender-receiver directed interactions, :

    1. Draw a binary value to indicate the presence or absence of a link

3.3 Supervised Mixed Membership Blockmodel

The Supervised Mixed Membership Blockmodel (previously presented in [1]) extends the unsupervised mixed membership blockmodels from the literature [10, 11, 12]. The Supervised Mixed Membership Blockmodel (SMMB) assumes the following generative process:

  1. For a given network draw a distribution over the possible network role interactions

  2. For each role :

    1. Draw a distribution over nodes

  3. For each interaction :

    1. Draw a role interaction pair ,

    2. Draw a sender node

    3. Draw a receiver node

  4. For each node :

    1. Draw a class label

where and and

are the indicator vectors of length

describing the network role of the sender and receiver nodes in interaction , is the Kronecker delta. therefore represents the empirical behavior class frequencies for node . The softmax function provides the following distribution:

4 Collapsed Variational Inference

Inference of the network roles,

, can be efficiently computed using variational inference. Variational inference has the advantage over sampling methods due to convergence that is faster and easier to diagnose. Previous work has shown that the performance differences between inference methods can be minimal given appropriate hyperparameter settings


Variational Bayes [14] introduces an approximate variational posterior distribution, , over the latent variables (roles) and model parameters . Usually this is a fully factorised distribution known as a mean-field approximation which provides a more tractable lower bound on the log evidence.


By taking advantage of the conjugacy of the Dirichlet-Categorical and Beta-Bernoulli distributions, the model parameters can be integrated out exactly. This treatment yields the collapsed variational posterior, parameterised by the variational parameter



which provides a tighter bound on the evidence [3]. However, exact implementation of collapsed variational Bayes is computationally too expensive and therefore in practice a first order Taylor expansion is used to approximate the update equations. Further information on collapsed variational inference along with the first order approximation implemented here is given in [15, 13]. The following sections detail the update equations for the 3 models.

4.1 Standard Stochastic Blockmodel

Inference in the standard Stochastic Blockmodel consists of sequentially updating the variational posterior distribution over role assignments for each node according to:


where is the count of links from role to role , is the number of times node sender to a node of role and similarly is the number of time is a receiver in an interaction with a node of role . The totals for each role are given by . Collapsed variational inference involves removing the counts of the current node which is denoted by . The nodes in the network used for training have their roles initialised to reflect their class (i.e. role=class) and the inference is carried out on the unlabelled nodes only.

4.2 Supervised Single Membership Blockmodel

The update procedure for the SSMB is almost identical to the SBM but incorporates information about the class-role co-occurrence counts .


In this model the roles are initialised randomly and the inference procedure sequentially updates each node in the network until convergence. Note that as opposed to the SBM model inference occurs over the training nodes too.

Prediction of the unknown labels requires calculation of the parameter according to (5):


Prediction of node class labels is done according to (6)


4.3 Supervised Mixed Membership Blockmodel

For the SMMB, role pairs (sender role and receiver role) are assigned to each interaction rather than assigning a single role to a node. Inference is therefore conducted by sequentially updating the variational posterior for each network interaction according to:


where () are the number of times node is a sender (receiver) as role , is the number of times node is involved in an interaction and is a -length vector representing the marginal probability of sender or receiver positions, i.e.:


and represents an approximation to the expectation under the distribution of the normalising function of the softmax distribution for a node . This is given by:


is found using conjugate gradient to optimise the free energy terms of (1) corresponding to :


where . Conjugate gradient requires the following derivatives:


Predicting unlabeled nodes requires inference of the network positions given the rest of the network. As the class label is unknown the inference is performed as above but without the terms involving . Classification of a test node is given by:


5 Experiments

5.1 Data

Networks generated from four real word datasets were examined in this work: a citation network, a feeding web network and two word networks. All of the networks are directed. Each of the datasets have a different underlying structure with respect to the given classification task. The first network is the Cora citation network [16], a popular dataset for collective classification comprising of 2708 nodes representing scientific papers and 5429 links representing the citations between them. The classification task is to assign each paper one of 7 subject categories.

The second network is a word network made up of the 112 most frequently occurring adjectives and nouns in Charles Dickens’ novel David Copperfield [17]. The words are linked if they appear adjacent to each other in the text.

The third network is also a word network, this time the Brown corpus111Available from[18], which is a tagged corpus of present-day edited American English across various categories. In this work a network was created using words from the News category which occurred at least 10 times and were tagged as either verb, adverb, pronoun, noun or adjective. This resulted in a network of 990 words with 6157 links between them.

The forth network is a food web of 463 species in the Weddell Sea in the Antarctic where the 1939 edges point to each predator from its prey222The Weddell Sea food web is available to download as part of larger dataset at [19]. The variable used for classification is the feeding type which takes 6 values, namely primary producer, omnivorous, herbivorous/detrivorous, carnivorous, detrivorous, and carnivorous/detrivorous.

5.2 Classification Performance

Experiments were run to investigate the classification performance between the models and as the maximum number of roles, , was varied. Note that for the SBM the value of was required to be fixed as equal to the number of classes . In all experiments 50% of the nodes were used for training.

Performance is measured according to the macro-averaged F1 measure given by:

where TP, FN, and FP correspond to the true positive, false negative and false positive rates respectively. The F1 measure represents the harmonic mean of the precision and recall values. For the multi-class problems the macro-average is used - i.e. the F1 score is calculated for each class and then averaged. This removes the bias in accuracy due to different class sizes in the datasets. Each experiment was run 100 times and the performance scores reported reflect the average over these runs.

Figure 1 shows the performance of the three models across the different networks. For the Cora and David networks it can be seen that the SBM model performs well and that there is no real advantage to using one of the other models. The Cora network is highly assortative and the David network is highly disassortative, however, even though the networks are very different in structure they both contain homogeneous classes and so each class can be modelled with a single network role.

The other two networks, News and Weddell, showed that the supervised (single and mixed membership) models offered a significant improvement over the SBM. This suggests that there exists some heterogeneity in the interaction patterns within classes. For the News dataset, the mixed membership model performs a little better than the single membership. On the other hand, in the Weddell dataset the single membership model performs a lot better than the mixed membership, however the single membership model has a much higher variance in performance compared to the more stable but less accurate mixed membership model.

Figure 2 shows the average run times of the supervised blockmodels which is a factor of the computational complexity of the inference updates and the algorithm convergence times. It can be seen that the mixed membership (SMMB) model is has a significantly longer run time that the single membership model due to the computational cost of finding the Softmax parameters in the conjugate gradient step in (11).

[width=.49trim=37 0 50 0,clip=true]cora.png[width=.49trim=37 0 50 0,clip=true]word.png
[width=.49trim=37 0 50 0,clip=true]brown.png[width=.49trim=37 0 50 0,clip=true]wedfed.png

Figure 1: Classification performance of the 3 supervised blockmodel approaches as the parameter K (maximum roles) is varied.

[width=.49trim=37 0 50 0,clip=true]brown_time.png[width=.49trim=37 0 50 0,clip=true]wedfed_time.png

Figure 2: Average run times in seconds for the two supervised blockmodels as the parameter K (maximum roles) is varied.

5.3 Summary Networks

This section describes how the learned blockmodel can be used to understand the structure of the network with respect to the classes. The analysis will be on the mixed membership model although a similar analysis can be conducted with the SSMB. Focusing on the News network created from the Brown corpus, Figure 4 shows the summary network of how the identified network roles interact. The colour of the lines indicate the probability of observing a link type, where darker edges represent more likely interactions. Figure 4 shows a visualisation of the distribution over roles (columns) for each node (rows) in the News network. By ordering the nodes by class it is possible to get an overall picture of the relationship of classes and network roles. Figure 5 shows the distribution over classes for each of the 10 network roles. Using this information together it is possible to identify patterns in the connectivity of the classes and therefore in the ordering of the classes of words in the News corpus. For example, it can be seen that Roles 1 and 2 are usually verbs and that there is a chain of frequently co-occurring roles 4-2-5-1. Comparing the Roles 4 and 5 it can be seen that verbs (appearing more in 4 than 5) can come before other verbs but unlikely to be between two verbs. Pronouns and Noun can come before and between verbs and Adverbs are only associated with Verbs (they do not appear in any other network role). Other relationships that can be seen are that Nouns occur together (Roles 7 and 9) and that Pronouns and Adjectives precede Nouns (Roles 10 and 8 respectively).

Figure 3: Summary network of the discovered role interactions in the word network created from News articles in the Brown Corpus. Darker arrows indicate higher frequency of interaction.
[width=trim=0 20 90 0,clip=true]brownclassrole.png
Figure 4: Node role assignment matrix for the News dataset. Each row represents a node and its posterior distribution over roles. Rows are ordered by class to highlight correspondence between class and position.

[width=.245trim=80 30 75 50,clip=true]brown_role_1.png[width=.245trim=80 30 75 50,clip=true]brown_role_2.png [width=.245trim=80 30 75 50,clip=true]brown_role_3.png [width=.245trim=80 30 75 50,clip=true]brown_role_4.png
[width=.245trim=80 30 75 50,clip=true]brown_role_5.png [width=.245trim=80 30 75 50,clip=true]brown_role_6.png[width=.245trim=80 30 75 50,clip=true]brown_role_7.png [width=.245trim=80 30 75 50,clip=true]brown_role_8.png
[width=.245trim=80 30 75 50,clip=true]brown_role_9.png [width=.245trim=80 30 75 50,clip=true]brown_role_10.png

Figure 5: Distributions over classes for each role in the News word network from the Brown corpus.

6 Discussion

This work has demonstrated how the pattern of interactions alone can be used to classify unlabelled instances in relational data. For simple cases this can be achieved with the well studied Stochastic Blockmodel (SBM) by considering the network roles as classes. In cases where classes exhibit heterogeneity in their interactions more complex models are required. A small modification to the Stochastic Blockmodel results in the Supervised Single Membership Blockmodel (SSMB) which can give significantly better classification performance. The Supervised Mixed Membership Model (SMMB) also performs well but does so at a significantly higher computational cost. Based on the few examples presented here it seems that the benefit of the mixed membership model is outweighed by its computational complexity, however more work is required to confirm this. Finally, supervised blockmodels not only provide good classification performance but also an interpretable model to explore the structure of the data and the relationship between and within classes.


  • [1] Peel, L.: Topological feature based classification. In: Proceedings of the 14th International Conference on Information Fusion. (2011)
  • [2] Moore, C., Yan, X., Zhu, Y., Rouquier, J.B., Lane, T.: Active learning for node classification in assortative and disassortative networks. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. KDD ’11, ACM (2011) 841–849
  • [3] Teh, Y.W., Newman, D., Welling, M.:

    A collapsed variational Bayesian inference algorithm for latent Dirichlet allocation.

    In: Advances in Neural Information Processing Systems. Volume 19. (2007)
  • [4] Lorrain, F., White, H.C.: Structural equivalence of individuals in social networks. Journal of Mathematical Sociology 1 (1971) 49–80
  • [5] Holland, P.W., Leinhardt, S.: Local structure in social networks. Sociological Methodology 7 (1976) pp. 1–45
  • [6] Wasserman, S., Faust, K.: Social network analysis : methods and applications. 1 edn. Structural analysis in the social sciences, 8. Cambridge University Press (November 1994)
  • [7] Nowicki, K., Snijders, T.A.B.: Estimation and Prediction for Stochastic Blockstructures. Journal of the American Statistical Association 96(455) (2001)
  • [8] Blei, D., McAuliffe, J.: Supervised topic models. In Platt, J., Koller, D., Singer, Y., Roweis, S., eds.: Advances in Neural Information Processing Systems 20. MIT Press, Cambridge, MA (2008) 121–128
  • [9] Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. J. Mach. Learn. Res. 3 (March 2003) 993–1022
  • [10] Airoldi, E.M., Blei, D.M., Fienberg, S.E., Xing, E.P.: Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9 (June 2008) 1981–2014
  • [11] Sinkkonen, J., Aukia, J., Kaski, S.: Component models for large networks. (Mar 2008)
  • [12] DuBois, C., Smyth, P.: Modeling relational events via latent classes. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. KDD ’10, ACM (2010) 803–812
  • [13] Asuncion, A., Welling, M., Smyth, P., Teh, Y.W.: On smoothing and inference for topic models.

    In: Proceedings of the International Conference on Uncertainty in Artificial Intelligence. (2009)

  • [14] Attias, H.: A variational bayesian framework for graphical models. In: In Advances in Neural Information Processing Systems 12, MIT Press (2000) 209–215
  • [15] Sung, J., Ghahramani, Z., Bang, S.Y.: Latent-space variational bayes. IEEE Trans. Pattern Anal. Mach. Intell. 30(12) (2008) 2236–2242
  • [16] Sen, P., Namata, G.M., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. AI Magazine 29(3) (2008) 93–106
  • [17] Newman, M.E.J.:

    Finding community structure in networks using the eigenvectors of matrices.

    Phys. Rev. E 74(3) (Sep 2006) 036104
  • [18] Francis, W.N., Kucera, H.: Brown corpus manual. Technical report, Department of Linguistics, Brown University, Providence, Rhode Island, US (1979)
  • [19] Brose, U., Cushing, L., Berlow, E.L., Jonsson, T., Banasek-Richter, C., Bersier, L.F., Blanchard, J.L., Brey, T., Carpenter, S.R., Blandenier, M.F.C., Cohen, J.E., Dawah, H.A., Dell, T., Edwards, F., Harper-Smith, S., Jacob, U., Knapp, R.A., Ledger, M.E., Memmott, J., Mintenbeck, K., Pinnegar, J.K., Rall, B.C., Rayner, T., Ruess, L., Ulrich, W., Warren, P., Williams, R.J., Woodward, G., Yodzis, P., Martinez, N.D.: Body sizes of consumers and their resources. Ecology 86(9) (2005) 2545