 Research
 Open access
 Published:
Identifying and exploiting homogeneous communities in labeled networks
Applied Network Science volume 5, Article number: 55 (2020)
Abstract
Attributeaware community discovery aims to find wellconnected communities that are also homogeneous w.r.t. the labels carried by the nodes. In this work, we address such a challenging task presenting Eva, an algorithmic approach designed to maximize a quality function tailoring both structural and homophilic clustering criteria. We evaluate Eva on several realworld labeled networks carrying both nominal and ordinal information, and we compare our approach to other classic and attributeaware algorithms. Our results suggest that Eva is the only method, among the compared ones, able to discover homogeneous clusters without considerably degrading partition modularity.We also investigate two welldefined applicative scenarios to characterize better Eva: i) the clustering of a mental lexicon, i.e., a linguistic network modeling human semantic memory, and (ii) the node label prediction task, namely the problem of inferring the missing label of a node.
Introduction
Node clustering, also known as community discovery, is one of the most important and productive tasks in complex network analysis. It is considered one of the most challenging subjects of the field, due to its intrinsic illposedness: the absence of a single, universal definition of community leads to a heterogeneous landscape of alternative approaches, each one redefining the task w.r.t. different topological criteria (density, bridge detection, feature propagation…). In such a complex scenario, a metadefinition of community discovery helps us to overcome the wide range of possible definitions:
Definition 1.
(Community discovery) Given a network G, a community \(c=\{ v_{1},v_{2}, \dots,v_{n}\} \) is a set of distinct nodes of G. The community discovery problem aims to identify the set \(\mathcal {C}\) of all the communities in G.
Community discovery algorithms aim to find wellconnected, possibly wellseparated, clusters of nodes. While classic approaches are driven only by the graph structure, nowadays, a large number of models includes extra features to complement the expressive power of topology with other external information. Featurerich networks (Interdonato et al. 2019) is the term proposed for a generalization of all these models, including temporal, probabilistic and attributed (or labeled) networks.
In the new context of featurerich networks, classic approaches to community discovery are not enough. In this work, we are particularly interested in labeled or nodeattributed networks, where reliable external information is added to the nodes as categorical or numerical attributes^{Footnote 1}. Nodeattributed graphs are a quite useful model of social networks, and several salient homophilic dimensions (age, gender, nationality…) can be meaningfully identified and exploited by leveraging clustering approaches. Partitioning a social network by only considering social ties might produce welldefined and densely connected communities: classic approaches often assume an intrinsic homophilic behaviour between individuals, but they do not explicitly guarantee homogeneity while searching for mesoscale topologies. Thus, node attributes can improve the community discovery task by leveraging both topological and homophilic clustering criteria – an enhancement under the name of labeled community discovery:
Definition 2.
(Labeled community discovery) Let \(\mathcal {G}=(V,E,A)\) be a nodeattributed graph where V is the set of vertices, E the set of edges, and A a set of nominal or ordinal attributes such that A(v), with v∈V, identifies the set of labels associated to v. The labeled community discovery problem aims to find a node clustering \(\mathcal {C}=\left \{c_{1},...,c_{n}\right \}\) of \(\mathcal {G}\) that maximizes both topological clustering criteria and label homophily (or homogeneity) within each community.
Such a new task focuses on obtaining structurally welldefined partitions that also result in labelhomogeneous communities. In this work, we address the labeled community discovery problem by introducing EVA (namely, LOUVAINExtended to Vertex Attributes) (Citraro and Rossetti 2020). Our approach extends the wellknown LOUVAIN algorithmic schema, designing a multicriteria optimization approach aimed at exploiting both structure and semantic information while searching for node clusters.
The work is organized as follows. In “The EVA algorithm” section, we present the rationale of EVA. In “Experiments” section, we apply the method on realworld datasets: we show the possibilities of EVA to manage both nominal and ordinal attributes as well as its fruitful application in other domains than social systems, e.g., linguistic networks. In “EVA as a tool: node label prediction” section, we also show how the proposed algorithm can be applied, successfully, to address the task of node label prediction. In “Related work” section, we discuss the literature relevant to the work. Finally, “Conclusion” section concludes the paper and summarizes its main results as well as future research directions.
The EVA algorithm
The main goal of EVA is to identify homogeneous communities in complex nodeattributed networks while assuring low modularity degradation w.r.t. standard topological modularity optimizationbased approach. In the following, we will explain the algorithm rationale, we will study its complexity, and we will describe how it can handle both nominal and ordinal attributes.
Algorithm rationale. The algorithmic schema of EVA extends the LOUVAIN one (Blondel et al. 2008), a wellknown bottomup and hierarchical approach based on modularity optimization.
Definition 3.
(Modularity) Modularity measures the strength of the division of a network into sets of wellseparated clusters or modules. It takes values in [1/2, 1] and it is calculated as the sum of the differences between the fraction of edges that actually fall within a given community and the expected fraction if edges were randomly distributed. Formally:
where m is the number of edges, A_{v,w} is the entry of the adjacency matrix for v,w∈V,k_{v},k_{w} the degree of v,w and δ(c_{v},c_{w}) is an indicator function taking value 1 iff v,w belong to the same community, 0 otherwise.
Modularity is one of the most used and discussed criteria among the methods based on an optimization function (Fortunato and Hric 2016). Its maximization is NPcomplete, and it suffers of the wellknown resolution limit (Fortunato and Barthelemy 2007), namely when it is worth considering two connected communities as a single one.
EVA, as LOUVAIN, uses modularity to update communities incrementally; moreover, it uses a quality function tailored to capture label homogeneity within communities, namely purity.
Definition 4.
(Purity) Given a community \(c \in \mathcal {C}\) its purity is the product of the frequencies of the most frequent attributes carried by its nodes. Formally:
where A is the label set, a∈A is a label, a(v) identifies an indicator function that takes value 1 iff a∈A(v). Purity takes values in [0,1] and it is maximized when all the nodes within a community share the same attribute value sequence. Finally, the purity of a partition is defined as the average of all the community purities:
Purity assumes node labels as independent and identically distributed random variables; thus, considering the product of maximal frequency labels is equivalent to computing the probability that a randomly selected node in the given community has exactly that specific label profile.
EVA combines the two fitness function linearly, optimizing the following score:
where α is a tuning parameter. It balances the importance of each component and adapts the algorithm results to the analyst needs.
EVA pseudocode is explained in Algorithm 1 and Algorithm 2. EVA takes as input a nodeattributed graph \(\mathcal {G}\) and the parameter α, and it returns a partition \(\mathcal {C}\). As a first step (line 2, Algorithm 1) EVA assigns each node to a singleton community and computes the initial quality Z as a linear combination of modularity and purity. After the initialization step, the algorithm mainloop is executed (lines 59, Algorithm 1). As LOUVAIN, two phases compose EVA, i.e., (i) a greedy identification of a community, moving nodes such that they reach the optimal increase of quality, and (ii) the network agglomeration. EVA cycles over the graph nodes and evaluates the gain of quality while moving a single neighbouring node to its community (lines 814, Algorithm 2). For each pair (v,w) the local gain produced by the move is compared with the best gain identified so far and, if needed, the value is updated to keep track of the newly identified optimal quality: in case of ties, the move that results in a higher increase of the community size is preferred (lines 1518, Algorithm 2). The procedure is repeated until no more moves are possible (line 19, Algorithm 2). As a result of Algorithm 1, the original allocation of nodes to communities is updated.
After this step, the aggregate function (line 7, Algorithm 1) hierarchically updates the original graph \(\mathcal {G}\), transforming the communities in nodes, allowing to repeat the loop until no moves can optimize the quality score (lines 89, Algorithm 1).
Ordinal attributes support. We also extend the explained approach to cope with ordinal attributes, where order among node labels matters. For instance, the education level of individuals in a social network can be modeled as an attribute with a set of n possible labels with an inner, natural order (e.g., high school degree < bachelor degree < master degree < PhD). In this scenario, the labeled community detection task imposes to find homogeneous clusters, grouping people according to both their social ties (topology) and to their education level (attribute). Considering such an attribute as a nominal may lead to a situation where an overall high educated cluster can indifferently contain minority nodes belonging to all the possible range of attribute values: EVA would insert these nodes in the cluster with the same probability. Thus, we can force an order among labels and adjust the distribution of minority nodes.
We model such an order as a linear distance. Formally:
Definition 5.
(Linear distance) Let O be an ordered chain of k labels, \(O=\left \{l_{0}, l_{1}, \dots, \text {\l }_{k}\right \}\) and l_{i},l_{j}∈O then the linear distance among them is computed as:
Such a distance function accounts for the evaluation of nodes belonging to minority labels in terms of how distant the label is from the majority one.
As an example, given O={l_{a},l_{b},l_{c},l_{d}}, a cluster C having purest label l_{a} and two neighboring nodes i,j whose labels are, respectively l_{b} and l_{d}, iff the increase in modularity and size is the same, node i will be preferred for inclusion in C since \(d_{l_{a},l_{b}} < d_{l_{a}, l_{d}}\).
Such an approach allows to (semantically) minimize the degradation in terms of community purity when searching for a highquality modularity partition. Indeed, the proposed distance function is applicable only if specific assumptions are satisfied (e.g., in the presence of a complete linear ordering among the values of an attribute). However, EVA support for ordinal attributes is designed to be parametric on the distance function used, thus making easy to define any labelspecific distance (e.g., considering, for instance, hierarchical treelike attribute values).
Eva complexity.EVA is a LOUVAIN extension. It shares the same performances in terms of time complexity, O(VlogV). Regarding space complexity, the difference w.r.t. LOUVAIN is related only to the data structures used for storing node labels. Considering k labels, the space required to associate them to each node in \(\mathcal {G}\) is O(kV): assuming k<<V<E, we get a space complexity of O(E).
Experiments
In this section, we firstly describe the experimental framework used to evaluate EVA performances, then we apply the proposed approach to several case studies, underlining its flexibility as an analytical tool.
Datasets
We applied EVA to several realworld datasets having different characteristics: here, we describe them, specifying the particular setup they provide for the application where they are proposed.
Singlenominal. Datasets in this category are characterized by a single nodeattribute of nominal type, A=1.

Cora (McCallum et al. 2000) (2708 nodes, 5279 edges) is a cocitation network among computer science research papers, each of them labeled with one of 7 possible topics.

G+ (22355 nodes, 29032 edges) is a subgraph of the Google+ social network (Leskovec and Mcauley 2012), in which people are labeled according to their education degree (12 different levels).

IMDB (Neville et al. 2003) (1169 nodes, 20317 edges) is a network of movies, each of them labeled with a binary value that identifies a node as a blockbuster or not.

Sense2vec (Trask et al. 2015) (5309 nodes, 15170 edges) is a complex semantic network built on top of word vectors pretrained on Reddit comments, where labels identify the part of speech of the words, i.e., a noun, a verb, an adjective, etc.

Web Spam (Castillo et al. 2007) (9100 nodes, 505000 edges) is a network of linked web pages, indicating if they are spam or not.
Multinominal. Datasets in this category are characterized by multi nodeattributes of nominal type, A>1.

Amherst (2235 nodes, 90954 edges) is one of the 100 social networks of Facebook100 dataset (Traud et al. 2012); nodes have five different attributes, and we choose to mark from Amh1 to Amh5 the same network enriched from 1 to 5 node attributes. The attributes are gender, status, dormitory, graduation year and major: the order is maintained during the node profile enrichment, i.e., Amh1: gender, Amh2: genderstatus, etc.
Ordinal. Nodes having a single attribute whose values are logically ordered characterize the graphs in this category – to prevent confusion, nine different attributes are considered, never in a multiattribute scenario.
Mental lexicon (Stella et al. 2018): a collection of several layers of word similarities, in detail:

a semantic network (3105^{Footnote 2} nodes, 26482 edges), namely a collection of three semantic layers, including synonyms, hierarchical relations and free associations;

a phonological network (1683 nodes, 3731 edges), namely a layer for phonological similarities between word forms.
Each graph instance is considered w.r.t. one of the nine psycholinguistic dimensions from the Glasgow Norms (Scott et al. 2019), namely Arousal, Valence, Dominance, Concreteness, Imageability, Familiarity, Age of acquisition, Semantic size, and Gender association, plus the Length of the words. Each word is labeled (w.r.t. to the specific dimension) with a continuous scale measured by Likert scale (Likert 1932). To be able to perform the ordinal strategy of EVA, we discretized the labels, preserving their natural order.
Analytical results: singlenominal and multinominal
In this section, we will focus on the following questions:

1)
does have the resolution limit (Fortunato and Barthelemy 2007) some effect on Eva, i.e.:

does increasing α affect the number of communities identified?

does increasing α affect the size of the largest community?


2)
does increasing α affect the topological quality of partitions in favor of purity?

3)
does the multinominal scenario strongly affect Eva results?
The motivation behind 1) is that EVA does not use only modularity to optimize the quality of clusters; thus, the resolution limit effect can be reduced when the parameter is set in favour of purity. Also, in 2), we study α as a tradeoff between connectivity and homogeneity; in 3), we want to focus explicitly on the multiattribute profiles.
Cardinality of partition set and largest communities.
We tested EVA varying the values of α in the range [0,1] with bins of 0.1. We obtained 11 partitions \(\mathcal {C}_{\alpha }\). The number of communities in \(\mathcal {C}_{\alpha }\), namely the partition cardinality, is \(\mathcal {C}_{\alpha }\). We recall that by definition (i) \(\mathcal {C}_{0}\) is equivalent to the LOUVAIN partition and (ii) \(\mathcal {C}_{1}\) is the set of the biggest connected components whose nodes share the same label profiling.
Figure 1ab summarizes that (i) the number of communities of each partition normalized w.r.t. \(\mathcal {C}_{0}\) underlines a significant fragmentation w.r.t. the increasing of α, and (ii) the size of the largest community normalized w.r.t. the size of that of \(\mathcal {C}_{0}\) decreases w.r.t. the increasing of α until high values of the parameter (e.g., α=0.8) are reached, whereby the normalized size drastically increases. Such an increase depends on the distribution of labels overall the network: EVA, used with the highest values of α, tends to find quite perfectly homogeneous clusters without considering structure; thus, assortative zones might be merged even if they are not densely connected. Newman’s assortativity coefficient values (w.r.t. the categorical attribute) (Newman 2003) are quite high for all the networks considered, i.e., r=0.76 for Cora, r=0.34 for G+, r=0.47 for IMDB and r=0.59 for Sense2vec. Even if Newman’s assortativity is a global measure and it is not able to identify outliers and different mixing patterns in a graph, we can take these scores as an overall index of network homophily. Thus, high assortative scores justify the size of the largest community for high values of α.
Modularity vs. purity.
The results previously observed are coherent w.r.t. an incremental modularity decrease. Here, we discuss how a good clustering needs to achieve a reasonable tradeoff between modularity and purity; thus, we study how the partitions that EVA generates vary w.r.t. α.
Figure 1ce reports, in a two yaxes chart, modularitypurity values as functions of α. We observe that modularity lines tend to decrease in favour of a homogeneity function not based on the discovery of densely connected modules. Intuitively, a modularity line is stable if the value of the function for the partition \(\mathcal {C}_{\alpha }\) is equal or quite close to that for \(\mathcal {C}_{\alpha 0.1}\), while purity continues to increase. In other words, the stability of modularity indicates that communities are welldefined while EVA tries to make them homogeneous. Enforcing homogeneity contributes to producing less modular communities: recalling that EVA α=1 merges lowquality modules of a completely homogeneous subgraph, the analyst needs to pay attention to the modularity decrease.
As the figure shows, the partitions obtained with α=0.7 and α=0.8 still harmonize the two fitness functions in the Sense2vec dataset, because modularity degradation is not relevant while purity increases; a good tradeoff is still reached with α=0.6 in the G+ network, and with α=0.7, in Cora. The IMDB dataset was not shown in the absence of relevant degradation.
In Table 1, EVA is compared with four stateofart community detection algorithms, among classic (LOUVAIN (Blondel et al. 2008), LEIDEN (Traag et al. 2019)) and attributeaware approaches (SAC1 (Dang and Viennet 2012), STOC (Baroni et al. 2017)). There are several reasons to compare EVA to standard modularitybased methods as LOUVAIN and LEIDEN, for instance (i) a comparison of modularity decreasing w.r.t. the algorithms designed to maximize such a quality function and (ii) an evaluation of the implicit purity quantified by these only topologicalbased approaches. In detail, LOUVAIN is the natural baseline of EVA: it maximizes only modularity within the same algorithmic schema described for EVA in “The EVA algorithm” section. LEIDEN is designed to improve LOUVAIN, guaranteeing wellconnected communities, whereas LOUVAIN fails to split bridges or disconnected components into separate groups. Moreover, we choose SAC1 and STOC for the (attributeaware) comparison since they share similar methodologies. As EVA, they simultaneously consider structure and attributes during the clustering phase. In detail, SAC1 uses a composite function as a multiobjective criterion, i.e., a linear combination of modularity and an attribute similarity function (e.g., the Euclidean distance for numerical attributes or the matching coefficient for categorical ones). Differently, STOC defines a distance function as a linear combination of two distances, one for the topology and one for the attributes. The analyst has to define an attraction ratio α (decomposed in a topological attraction ratio α_{T} and a semantic attraction ratio α_{S}) trough which the algorithm is able to autotune the parameters involving the two distance functions.
In the table, we observe how LOUVAIN and LEIDEN can slightly guarantee higher modularity values than EVA, at the cost of a relevant gap of homogeneity. Thus, as long as we quantify just a slight modularity decrease in favour of purity in EVA, we can say that our method outperforms classic approaches. Moving to the attributeaware methods, SAC1 obtains the lowest modularity partitions and never outperforms EVA in terms of purity. Being an approach also based on modularity optimization, we did not expect these lower results. For the sake of clarity, we specify that SAC1 outputs were similar for all the values of its parameter, so we reported only α=0.5 in the table. STOC does not deal with modularity optimization, but it uses a distance function for capturing node similarity. The autotune of the parameters involving the distance equations depends on the values of α_{T} and α_{S}. Similarly to SAC1, several combinations of values gave similar results; thus, for the comparison, we used α_{T}=α_{S}=α=0.5, that is one of the solution proposed in the reference paper (Baroni et al. 2017). STOC is able to cluster the G+ dataset, obtaining a reasonable tradeoff between modularity and purity; however, not wellconnected communities are discovered for Cora, IMDB and Sense2vec, looking at the modularity scores. A fair parenthesis should be open for STOC: being an approach explicitly designed to cluster large networks (as explained in the relative paper (Baroni et al. 2017)), good results on our smallmedium networks can be hard to obtain.
Finally, to test the statistical significance of our results, we compared each partition against the ones we should expect by randomly clustering graph nodes. As already said, we noticed that the number of communities increases for high values of the parameter (see Fig. 1a). Since we also noticed this behaviour depends on the increased number of smallsized communities, we want to be sure that the purity scores are significant. In detail, we compared the purity of each partition (computed by Eq. 3) against the distribution of purity values of random permutations of the community labels. Thus, we performed a ztest, considering as a null model the distribution of purity of the random partitions: the more the partition purity deviates from the null model, the less the homogeneity within communities can be obtained by random permutations of the same number of labeled nodes. Formally:
where P is the purity of the partition (the values for each network are those reported in Table 1), μ_{p} is the average purity score of the random partitions, and σ_{p}, the standard deviation.
The rationale underlining the proposed zscore comes from the Blockmodel Entropy Significance Test (BESTest) introduced in Peel et al. (2017), where the authors perform a statistical test to provide an estimate of how often a given partition obtains lowerentropy explanation of the data, as viewed through a generative model^{Footnote 3}. Moreover, the BESTest is a generalization of the indicator Θ, proposed in Bianconi et al. (2009) to assess how much the topology of a network depends on a particular assignment of node characteristics.
Table 2 reports the zscores of our proposed variant, with relative pvalues, for all the datasets and algorithms. The purity of nearly all the partitions – of EVA, LOUVAIN and LEIDEN, in particular – is significant. STOC did not find any community in the sense2vec dataset; thus, the purity of the single giant community is exactly the same as that of the supposed random community/ies (i.e., zscore equal to 0.0). In this very extreme case, the purity of 0.52 (see Table 1, the cell STOCsense2vec) corresponds to the most frequent value overall the network (for the sake of clarity, the noun partofspeech). The not statistically significant pvalues for SAC1 indicates that the purity values reported in Table 1 (e.g., 0.68 of IMDB or 0.49 of Cora) can also be obtained by the random permutations of the community labels.
Multinominal attribute profiles.
In a multinominal scenario, the nodes are enriched with more than one attribute. To address such an issue, EVA can exploit the general definition of purity as the product of the most frequent attribute values within a community. The questions we would like to answer are the following: does the number of distinct attributes affect the proposed approach in terms of (i) the number of communities discovered and (ii) modularitypurity trends?
Figure 2 confirms and extends what we already observed for the single attribute case: the number of communities increases with the varying of α and with the number of attributes considered. The number of attributes also affects modularitypurity trends, and modularity decreasing is similar to that observed for the singleattribute datasets. For space reasons, in Fig. 2 we report only the most complex scenario among the tested ones (i.e., Amh5, having A=5); however, all the trends identified behave alike, as summarized in Table 3, where we show a comparison of modularitypurity lines for several instances of EVA on the Amherst network while varying the number of node attributes.
Empirical results: ordinal strategy
As previously introduced, homogeneity is strictly related to homophily, the tendency of nodes to interact with similar others by the dimensions defined by the attributes. Social homophily is the most wellknown and wellstudied example of network similarity, but it is not the only one possible. In this subsection, we provide an analysis of a particular type of complex system, under the name of linguistic networks. In such networks, nodes model words and links represent several types of linguistic relations based on the levels of the conventional linguistic analysis (e.g., phonology, syntax, semantics…).
As introduced in 2, we will focus on semantic and phonological networks, where homophily (i.e., external information encoded as attributes), models the tendency of words to connect with similar others in respect of different lexical and psychological properties. Homophily, here, defines the probability that a pair of connected nodes correlates with the presence of similar values of a linguistic variable. We observed similar behaviours studying the network of word vectors (i.e., sense2vec (Trask et al. 2015)), where connected clusters of word vectors were homogeneous w.r.t. the part of speech.
To the best of our knowledge, this is the first study in which a labeled community discovery approach is directly used to study a mental lexicon enriched with the set of psycholinguistic dimensions available from the Glasgow Norms (Scott et al. 2019). In doing so, we aim to observe whether wellconnected semantic domains or phonological clusters are also homogeneous w.r.t. several psychological properties. To achieve such goal, we executed EVA on several instances of the same structure (as many as the attributes of the dataset) while using a different attribute one at a time. Indeed, we expect that polysemous words, namely words that convey more than one meaning, are clustered in different communities according to the specific attribute used.
As an example to explain our intuition and our framework of analysis, let us consider the word star: focusing on the Semantic size^{Footnote 4} variable, we should cluster the word with other ones related to cosmos and large objects in the universe; focusing on the Arousal^{Footnote 5} variable, we should cluster the word with other ones related to the metaphoric meaning of brightness and shine.
In a semantic network, the structure is not enough to group nodes. Such limitation is due to polysemy, namely the fact that a word can refer to different meanings according to the context in which it is used. Indeed, exploiting psychological and lexical variables of words (and using them as a complement to the structure), allows EVA to insert a polysemous word into the best cluster that is homogeneous w.r.t. the specific attribute considered.
To be able to perform EVA, we exploited the natural order among the Glasgow Norms variable values, measured according to a Likert scale (Likert 1932) (e.g., each word is characterized by an average rating given by a continuous value). We rounded such values to discretize them and be able to exploit the EVA ordinal strategy explained in “The EVA algorithm” section): we maintain the natural order among ratings, and we assume, for instance, there is more homogeneity between two words rated with two high values than two words rated with a high value and a low one, for all the scales.
A first example is shown in Table 4, where EVA (executed using several variables at a time) is compared to LOUVAIN. There, we focused on which words are in the same clusters of star, explaining why the only topological information is not able to focus on one single meaning of a polysemous word.
In Fig. 3a we observe, according to the ordinal strategy, that in the majority of communities, for almost all the variables considered over the semantic network, the second and the third most frequent labels are at distance d−1 and d+1 from the purest label. It is not the same applying EVA nominal strategy, 3b. The variables for which an ordinal alignment within communities is not reached are age of acquisition, imageability and length: they are not real homophilic properties of a semantic network. This result leads us to study modularity degradation w.r.t. the variables considered. In fact, according to EVA rationale, an alignment between topology and attributes (that might be already present according to mixing pattern distribution) should not considerably disrupt connectivity in favour of attributes. We tested such a hypothesis in Fig. 3cd, observing that modularity trends are different w.r.t. the dimensions, and that age of acquisition, imageability and length, in particular, are the variables that obtain the worst results in terms of modularity stability. The results in (a) and (c) are coherent with each other.
In general, we can interpret the modularity decrease as well as its stability as a proxy for the strength of a variable to maintain cluster connectivity if communities are forced to be strongly homogeneous. As expected, length is the worst homogeneous dimension in a semantic network, because the length of the words is not a semantic dimension (the same as imageability and age of acquisition), but length is the best one in terms of modularity stability in the phonological layer, where words with a similar sound have also the same or similar length.
EVA as a tool: node label prediction
Finally, in this section, we leverage EVA as a preprocessing step to address relevant network problems: to such extent, we will focus on a classic task, namely node label prediction.
Such task, also known as node classification or node attribute inference, concerns the problem of inferring missing attribute values of nodes, given the values of other nodes. Several techniques address such task, often involving machine learning and graph embedding methods; since the labeled community discovery task is far from these supervised or semisupervised techniques directly designed to perform the node prediction task, we approach the issue as a test to validate and exploit EVA outputs, and we limit to a comparison with other similar clustering approaches.
Using the point of view of our proposed clustering method, we model the prediction task as a particular instance of a more general problem:
Definition 6.
(Node label prediction) Given a partially nodeattributed graph \(\mathcal {G}\), the task of node label prediction aims to provide highquality labeling for all nodes carrying missing information.
Given a partially nodeattributed graph \(\mathcal {G}\) as input, we extend EVA so to make the algorithm resilient to partial information. In practice, while considering an unlabeled node as a candidate for inclusion in a preexisting community, only the structure is used to compare such local choice to the alternative ones. In detail, during the EVA moving phase, nodes with missing information are evaluated only according to the modularity gain (see line 12, Algorithm 2, “The EVA algorithm” section), thus avoiding to consider the purity one.
With this extension, EVA can identify communities whose nodes are partially labeled but still well defined in terms of topology as well as the purity of the labeled nodes they contain. As a result, we can use EVA to reconstruct (i.e., predict) missing node labels by assigning to unlabeled nodes the most frequent label of the community they belong to.
Figure 4 shows the results obtained by EVA on the previously studied Cora network in a setup where random removal of node labels is involved. The 3Dplot shows the accuracy score  namely the percentage of nodes labeled by our strategy with the correct original node label  w.r.t. two dimensions, namely the percentage of removed nodes and α. In particular, the figure underlines an overall high accuracy (between 0.8 and 0.7) even if the removal involves the 25% of nodes; then, we do not expect that a mesoscale approach can produce reliable results, even in case of highly homophilic nodelabel setups.
Figure 5a shows a comparison between EVA and other node clustering strategies when applied to the node label prediction task. Indeed, the alternative strategies tested, namely INFOMAP (Rosvall and Bergstrom 2008), LEIDEN and LOUVAIN, were not explicitly designed (or extended) to address this specific task. As for EVA, the label of each unlabeled node will be the majority one of the community it belongs to. Moreover, we compare the selected approaches against a local baseline, namely the egonetworks decomposition of the original graph: we extract the egonetworks of unlabeled nodes, then we follow the same rationale discussed so far to predict the labels, i.e., using the most frequent value among the direct neighbours. Such a local approach provides a strict boundary to homophilic behaviours, and it is expected to perform well in case of high label assortativity values around unlabeled nodes. Indeed, the obtained results suggest that egonetworks perform better compared to the other approaches, while EVA ranks first among the community discovery ones. We can explain it by observing Fig. 5b, where the local assortativity distribution (Peel et al. 2018) is shown. Newman’s assortativity coefficient (Newman 2003) is a global score that describes the whole network without considering outliers and possibly different mixing patterns. Local assortativity computes a homophilic score for each node by considering a local neighbourhood defined by the probability that a random walker with restart reaches a node starting from a target one. In the specific case of Cora, both global assortativity coefficient (r=0.76) and the plotted local one reflect the same results: nodes tend to be highly connected to peers sharing the same label. This specific scenario facilitates local approaches such as the one implemented by egonetworks because the highly homophilic patterns around nodes ensure the reduction of noise when predicting missing labels. It is simpler for the egonetworks to reach a better result compared to the approaches that focus on the discovery of a wider cluster, e.g., the mesoscale network level.
In Fig. 5cd the prediction task is replicated on a different network, Web spam, which presents a different local assortativity distribution. In such a scenario, the predictive power of egonetworks is reduced: the prediction is subject to an increased degree of noise due to the absence of a strongly biased local assortativity distribution peaked towards 1.
Related work
A survey of two main topics is needed to provide a full context for the present work, i) the stateofart of attributeaware community discovery techniques and ii) a brief overview of the node label prediction task.
Labeled community discovery. As remarked by a recent survey about the topic (Chunaev 2020), a widely accepted classification schema for labeled community discovery algorithms was taken into little consideration so far. In several comparative studies (Bothorel et al. 2015; Falih et al. 2018), algorithms have been classified according to the different techniques leveraged by their authors to combine topology and semantic levels, usually grouping them in three general families: i) topologicalbased, ii) attributedbased and iii) hybrid approaches. Such taxonomies focus primarily on how performing the clustering step – either i) attaching or ii) merging the attribute information to the topological one, or iii) using a posterior ensemble method. Nevertheless, when the clustering step is made constitutes the main policy for categorizing algorithms in Chunaev (2020): different methods are grouped according to the moment when structure and attributes are fused (before, during and after the clustering phase), distinguishing between i) early fusion, ii) simultaneous fusion and iii) late fusion methods.
In the following, we review some of the most popular (and interesting to us) labeled community discovery algorithms, while demanding detailed information about them is left to the specific paper they introduce them. SAC2 (Dang and Viennet 2012), STOC (Baroni et al. 2017) and SACluster (Zhou et al. 2009) are earlyfusion methods. According to the technique used, we can distinguish them between those weighting the edges according to the semantic similarity between nodes (SAC2) or using a nodeaugmented graph (SACluster) or a distance function (STOC). SACluster is one of the first approaches proposed in the literature. It exploits a graph augmentation technique before the clustering step: a new set of nodes representing the pair attribute  attribute value is created, and an edge is added if a structure node (i.e., an original node) is labeled with that pair; then, a neighbourhood random walk model is used to measure node proximity. A similar approach is proposed in SAC2, where a kNN graph is created to connect nodes not only according to the structure. Each node in the kNN graph is connected to its k most similar nodes, where the similarity is calculated based on a linear combination of structure information (e.g., links) and an attribute similarity function. Thus, a standard community discovery algorithm (e.g., LOUVAIN) is executed on the kNN graph. STOC was used as a competitor in the current study: in addition to the description given in “Analytical results: singlenominal and multinominal” section, STOC is one of the fastest approaches in literature in terms of time complexity and datastructure employment, and it is able to deal both with categorical and quantitative attributes.
ILouvain (Combe et al. 2015) and SAC1 (Dang and Viennet 2012) are two examples of simultaneous fusion methods. They are the most similar approaches to EVA, because they complement an attributeaware criterion to modularity, i.e., a semantic distance function in SAC1 (as described in “Analytical results: singlenominal and multinominal” section) and a measure called inertia in ILouvain. The ILouvain approach deals only with quantitative attributes, so it was not possible to compare it with EVA). Probabilistic modelbased methods are other simultaneous fusion techniques. They assume that structure and attributes are generated according to chosen distributions, translating the attributeaware community discovery task into a probabilistic inference problem. For instance, BAGC (Xu et al. 2012) adopts a Bayesian criterion to infer the parameters that best fit the graph given in input. CESNA (Yang et al. 2013), built on top of the probabilistic generative process of the BigCLAM overlapping (non attributed) community detection algorithm (Yang and Leskovec 2013), treats node attributes as latent variables.
Finally, another approach is to switch between structureonly or attributeonly clustering algorithms according to the clear or ambiguous relations between topology and attributes: it is the rationale behind some latefusion approaches, as the Selection method (Elhadi and Agam 2013), where LOUVAIN (structure selection) or KMeans (MacQueen and et al 1967) (attribute selection) are performed after an evaluation of the boundary between clear and ambiguous structure based on the estimation of an empirical mixing parameter μ to compare with the synthetic one used in the LFR benchmark (Lancichinetti et al. 2008).
Node label prediction. To show the usefulness of EVA as a tool for accomplishing complex network analysis tasks, in “EVA as a tool: node label prediction” section we leveraged it to predict the label of incomplete nodes. Community discovery is not explicitly designed to perform node classification. Such a task is mainly addressed by graphbased machine learning techniques or approaches within the Statistical Relational Learning framework, or more recently employing embedding methods. As our attributeaware clustering definition, these methods assume network homophily, but the approaches are different and not easily comparable. For instance, input requests are different. EVA works with labeled datasets as those introduced in this work: a singlecategorical scenario or a multicategorical one where few attributes are considered. The other methods often need a long set of attributes or vectors of features.
For a first distinction, as the one proposed in Bhagat et al. (2011), we mention the existence of methods based on the iterative application of traditional classifiers (a Decision Tree, a Naive Bayes…) (Bhagat et al. 2007) as well as those based on semisupervised learning (Zhu et al. 2003). The former ones use link information as features; the latter ones exploit information encoded in the link structure for labeling nodes. Another method is to create models characterizing the correlations between the objects that are described by the data. The models within the context of the Statistical Relational Learning are represented by a joint probability distribution of label assignments over nodes of the graph (Taskar et al. 2001): the learnt models are then used to perform inference. More recently, several learning frameworks can achieve successful results using a lowdimension representation of complex networks. The embeddings of nodes are created from graph topology and from the attributes of the local neighbourhood of each node, as in GraphSAGE (Hamilton et al. 2017).
Conclusion
In this paper, we presented EVA, an attributeaware node clustering approach that optimizes both topological and attributehomophilic criteria through a linear combination of modularity and purity. Analytical results show that EVA maintains high modularity scores while identifying clusters of homogeneous labeled nodes – both in singlenominal and in multinominal attribute scenarios.
Moreover, EVA can handle ordinal attributes. In such regard, we discussed how our strategy improves stateofart knowledge about word clustering. We addressed the discovery of semantic/phonological domains in semantic/phonological networks, finding which psycholinguistic properties of words behave as homophilic glue in a semantic/phonological network and which do not, because they disrupt modularity trends. We hope these results could be interesting for all those approaches studying language phenomena as complex networks, such as in the emerging field of cognitive network science (Siew et al. 2019), where linguistic systems could be used as a tool to relate language disorders to cognitive impairments.
Finally, we used the node label prediction task to validate EVA performances. We obtained high accuracy scores while exploiting the tradeoff between mesoscale connectivity and homogeneity; moreover, our results suggest that different mixing patterns have some effects on the results. Thus, as future works, we plan to properly investigate the relations between homogeneity and assortativity in nodeattributed networks. We will aim to design a comprehensive framework able to leverage potentially strict relations between cluster homogeneity and assortative patterns in related complex network analysis tasks.
Availability of data and materials
• Python code of Eva is available at: https://bit.ly/2J4btLN, and in CDLib (Rossetti et al. 2019);
• Python code of Sac1 is available at: https://github.com/amwat/GraphCommunityDetection;
• Code of SToC is available from the corresponding author on reasonable request;
• The Sense2vec network extracted for the analysis is built from Reddit vectors available in Kaggle repository, https://www.kaggle.com/poonaml/redditvectorsforsense2vecspacy/version/1
• The mental lexicon network is available from the corresponding author on reasonable request;
• All the other codes and datasets are public and easily available online.
Notes
To prevent confusion between the words attribute and label, in the following we use label as a generic term for external information attached to a node, formally encoded as a value of an attribute.
It is a filtered graph composed by nodes having a corresponding label, see below.
For the sake of clarity, the versatility of the test proposed in Peel et al. (2017) would allow us to consider also nongenerative community detection methods like those based on modularity optimization (see their Supplementary Materials, B.4)
I.e., a measure of something’s dimensions, magnitude, or extent: high values refer to objects or concepts that are large, low values refer to objects or concepts that are small.
I.e., a measure of excitement versus calmness: high values refer to words conveying excitement or that are stimulating and awaking, while low values refer to calming, relaxing or sleeping words.
Abbreviations
 Eva :

(Louvain) Extended to Vertex Attributes
 BESTest :

Blockmodel Entropy Significance Test
 Sac1 :

StructuralAttribute Similarities
 SToC :

SemanticTopological Clustering
 BAGC:

Bayesian Attributed Graph Clustering
 CESNA:

Communities from Edge Structure and Node Attributes
 BigCLAM:

Cluster Affiliation Model for Big networks
 LFR Benchmark:

LancichinettiFortunatoRadicchi Benchmark
 GraphSAGE :

Graph SAmple and AggreGaTe
 Q :

is modularity function
 P :

is purity function
References
Baroni, A, Conte A, Patrignani M, Ruggieri S (2017) Efficiently clustering very large attributed graphs In: Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 369–376.. Association for Computing Machinery, New York, NY, USA. https://doi.org/10.1145/3110025.3110030.
Bhagat, S, Cormode G, Muthukrishnan S (2011) Node classification in social networks In: Social Network Data Analytics, 115–148.
Bhagat, S, Rozenbaum I, Cormode G (2007) Applying linkbased classification to label blogs In: Proceedings of the 9th WebKDD and 1st SNAKDD 2007 Workshop on Web Mining and Social Network Analysis, 92–101.
Bianconi, G, Pin P, Marsili M (2009) Assessing the relevance of node features for network structure. Proc Natl Acad Sci 106(28):11433–11438.
Blondel, VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):10008.
Bothorel, C, Cruz JD, Magnani M, Micenkova B (2015) Clustering attributed graphs: models, measures and methods. arXiv preprint arXiv:1501.01676.
Castillo, C, Donato D, Gionis A, Murdock V, Silvestri F (2007) Know your neighbors: Web spam detection using the web topology In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 423–430.
Chunaev, P (2020) Community detection in nodeattributed social networks: A survey. Comput Sci Rev 37:100286. http://arxiv.org/abs/1912.09816.
Citraro, S, Rossetti G (2020) Eva: Attributeaware network segmentation. In: Cherifi H, Gaito S, Mendes JF, Moro E, Rocha LM (eds)Complex Networks and Their Applications VIII, 141–151.. Springer, Cham.
Combe, D, Largeron C, Géry M, EgyedZsigmond E (2015) Ilouvain: An attributed graph clustering method In: International Symposium on Intelligent Data Analysis, 181–192.. Springer, Cham.
Dang, TA, Viennet E (2012) Community detection based on structural and attribute similarities In: International Conference on Digital Society (ICDS), 7–12.
Elhadi, H, Agam G (2013) Structure and attributes community detection: comparative analysis of composite, ensemble and selection methods In: Proceedings of the 7th Workshop on Social Network Mining and Analysis, 1–7.
Falih, I, Grozavu N, Kanawati R, Bennani Y (2018) Community detection in attributed network In: Companion Proceedings of the The Web Conference 2018, 1299–1306.. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE. https://doi.org/10.1145/3184558.3191570.
Fortunato, S, Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36–41.
Fortunato, S, Hric D (2016) Community detection in networks: A user guide. Phys Rep 659:1–44. https://doi.org/10.1016/j.physrep.2016.09.002.
Hamilton, W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs In: Advances in Neural Information Processing Systems, 1024–1034.
Interdonato, R, Atzmueller M, Gaito S, Kanawati R, Largeron C, Sala A (2019) Featurerich networks: going beyond complex network topologies. Appl Netw Sci 4(1):1–13. https://doi.org/10.1007/s411090190111x.
Lancichinetti, A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110.
Leskovec, J, Mcauley JJ (2012) Learning to discover social circles in ego networks In: Advances in Neural Information Processing Systems, 539–547. http://papers.nips.cc/paper/4532learningtodiscoversocialcirclesinegonetworks.pdf.
Likert, R (1932) A technique for the measurement of attitudes. Arch Psychol 55:22–140.
MacQueen, J, et al (1967) Some methods for classification and analysis of multivariate observations In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, 281–297, Oakland, CA, USA.
McCallum, AK, Nigam K, Rennie J, Seymore K (2000) Automating the construction of internet portals with machine learning. Inf Retr 3(2):127–163.
Neville, J, Jensen D, Friedland L, Hay M (2003) Learning relational probability trees In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 625–630.
Newman, ME (2003) Mixing patterns in networks. Phys Rev E 67(2):026126.
Peel, L, Delvenne JC, Lambiotte R (2018) Multiscale mixing patterns in networks. Proc Natl Acad Sci 115(16):4057–4062.
Peel, L, Larremore DB, Clauset A (2017) The ground truth about metadata and community detection in networks. Sci Adv 3(5):1602548.
Rossetti, G, Milli L, Cazabet R (2019) CDLIB: a python library to extract, compare and evaluate communities from complex networks. Appl Netw Sci 4(1):52.
Rosvall, M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118–1123. https://doi.org/10.1073/pnas.0706851105. http://arxiv.org/abs/https://www.pnas.org/content/105/4/1118.full.pdf.
Scott, GG, Keitel A, Becirspahic M, Yao B, Sereno SC (2019) The Glasgow Norms: Ratings of 5,500 words on nine scales. Behav Res Methods 51(3):1258–1270.
Siew, CS, Wulff DU, Beckage NM, Kenett YN (2019) Cognitive network science: A review of research on cognition through the lens of network representations, processes, and dynamics. Complexity 2019.
Stella, M, Beckage NM, Brede M, De Domenico M (2018) Multiplex model of mental lexicon reveals explosive learning in humans. Sci Rep 8(1):1–11.
Taskar, B, Segal E, Koller D (2001) Probabilistic classification and clustering in relational data In: International Joint Conference on Artificial Intelligence, 870–878.. Lawrence Erlbaum Associates LTD.
Traag, VA, Waltman L, van Eck NJ (2019) From Louvain to Leiden: guaranteeing wellconnected communities. Sci Rep 9(1):1–12. http://arxiv.org/abs/1810.08473.
Trask, A, Michalak P, Liu J (2015) sense2vec  A fast and accurate method for word sense disambiguation in neural word embeddings. arXiv preprint arXiv:1511.06388.
Traud, AL, Mucha PJ, Porter MA (2012) Social structure of facebook networks. Physica A: Statistical Mechanics and its Applications 391(16):4165–4180. Elsevier.
Xu, Z, Ke Y, Wang Y, Cheng H, Cheng J (2012) A modelbased approach to attributed graph clustering In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, 505–516.
Yang, J, Leskovec J (2013) Overlapping community detection at scale: a nonnegative matrix factorization approach In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 587–596.
Yang, J, McAuley J, Leskovec J (2013) Community detection in networks with node attributes In: 2013 IEEE 13th International Conference on Data Mining, 1151–1156. https://doi.org/10.1109/ICDM.2013.167.
Zhou, Y, Cheng H, Yu JX (2009) Graph clustering based on structural/attribute similarities. Proc VLDB Endow 2(1):718–729. https://doi.org/10.14778/1687627.1687709.
Zhu, X, Ghahramani Z, Lafferty JD (2003) Semisupervised learning using gaussian fields and harmonic functions In: Proceedings of the 20th International Conference on Machine Learning (ICML03), 912–919.
Funding
This work is supported by the scheme ‘INFRAIA0120182019: Research and Innovation action’, Grant Agreement n. 871042 ‘SoBigData++: European Integrated Infrastructure for Social Mining and Big Data Analytics’.
Author information
Authors and Affiliations
Contributions
Salvatore Citraro and Giulio Rossetti designed research, performed research, and wrote the paper. Salvatore Citraro contributed to the acquisition, the analysis and the interpretation of experiment and tool parts. Giulio Rossetti contributed to the development of the algorithm rationale and its implementation. Both authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Citraro, S., Rossetti, G. Identifying and exploiting homogeneous communities in labeled networks. Appl Netw Sci 5, 55 (2020). https://doi.org/10.1007/s41109020003021
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s41109020003021