2020
DOI: 10.1038/s41598-020-72626-y
|View full text |Cite
|
Sign up to set email alerts
|

Community detection with node attributes in multilayer networks

Abstract: Community detection in networks is commonly performed using information about interactions between nodes. Recent advances have been made to incorporate multiple types of interactions, thus generalizing standard methods to multilayer networks. Often, though, one can access additional information regarding individual nodes, attributes, or covariates. A relevant question is thus how to properly incorporate this extra information in such frameworks. Here we develop a method that incorporates both the topology of i… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
47
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 57 publications
(47 citation statements)
references
References 49 publications
0
47
0
Order By: Relevance
“…Community detection seeks to describe the large-scale structure of a network by dividing its nodes into communities (or groups), based only on the pattern of links among those nodes (Contisciani et al [10]). Nodes belonging to communities are more highly connected to each other than to the rest of the network and probably share common properties.…”
Section: Community Detectionmentioning
confidence: 99%
“…Community detection seeks to describe the large-scale structure of a network by dividing its nodes into communities (or groups), based only on the pattern of links among those nodes (Contisciani et al [10]). Nodes belonging to communities are more highly connected to each other than to the rest of the network and probably share common properties.…”
Section: Community Detectionmentioning
confidence: 99%
“…(ii) an efficient interior point solver for Problem (2-7a-2-7d), only used if the relocation candidate was not filtered out due to the previous conditions (Lines [14][15][16][17][18][19].…”
Section: Likelihood Maximizationmentioning
confidence: 99%
“…Contisciani et al [17] introduced a probabilistic model for community detection in multi-layer graphs, combining sample features with relational information, where the sample features are categorical. Each category has a probability of being observed in a community, while an SBM variant serves to model relational information.…”
Section: Related Work and Backgroundmentioning
confidence: 99%
See 2 more Smart Citations