Purpose： This study aims to answer the question to what extent different types of networks can be used to predict future co-authorship among authors.Design/methodology/approach： We compare three types ot networks： ...Purpose： This study aims to answer the question to what extent different types of networks can be used to predict future co-authorship among authors.Design/methodology/approach： We compare three types ot networks： unwelgntea networks, in which a link represents a past collaboration; weighted networks, in which links are weighted by the number of joint publications; and bipartite author-publication networks. The analysis investigates their relation to positive stability, as well as their potential in predicting links in future versions of the co-authorship network. Several hypotheses are tested.Findings： Among other results, we find that weighted networks do not automatically lead to better predictions. Bipartite networks, however, outperform unweighted networks in almost all cases. Research limitations： Only two relatively small case studies are considered Practical implications： The study suggests that future link prediction studies on networks should consider using the bipartite network as a training network. Originality/value： This is the first systematic comparison of unweighted, weighted, and bipartite training networks in link prediction.展开更多
In this paper we investigate the potential of Subset Multiple Correspondence Analysis (s-MCA), a variant of MCA, to visually explore two-mode networks. We discuss how s-MCA can be useful to focus the analysis on inter...In this paper we investigate the potential of Subset Multiple Correspondence Analysis (s-MCA), a variant of MCA, to visually explore two-mode networks. We discuss how s-MCA can be useful to focus the analysis on interesting subsets of events in an affiliation network while preserving the properties of the analysis of the complete network. This unique characteristic of the method is also particularly relevant to address the problem of missing data, where it can be used to partial out their influence and reveal the more substantive relational patterns. Similar to ordinary MCA, s- MCA can also alleviate the problem of overcrowded visualizations and can effectively identify associations between observed relational patterns and exogenous variables. All of these properties are illustrated on a student course-taking affiliation network.展开更多
文摘Purpose： This study aims to answer the question to what extent different types of networks can be used to predict future co-authorship among authors.Design/methodology/approach： We compare three types ot networks： unwelgntea networks, in which a link represents a past collaboration; weighted networks, in which links are weighted by the number of joint publications; and bipartite author-publication networks. The analysis investigates their relation to positive stability, as well as their potential in predicting links in future versions of the co-authorship network. Several hypotheses are tested.Findings： Among other results, we find that weighted networks do not automatically lead to better predictions. Bipartite networks, however, outperform unweighted networks in almost all cases. Research limitations： Only two relatively small case studies are considered Practical implications： The study suggests that future link prediction studies on networks should consider using the bipartite network as a training network. Originality/value： This is the first systematic comparison of unweighted, weighted, and bipartite training networks in link prediction.
文摘In this paper we investigate the potential of Subset Multiple Correspondence Analysis (s-MCA), a variant of MCA, to visually explore two-mode networks. We discuss how s-MCA can be useful to focus the analysis on interesting subsets of events in an affiliation network while preserving the properties of the analysis of the complete network. This unique characteristic of the method is also particularly relevant to address the problem of missing data, where it can be used to partial out their influence and reveal the more substantive relational patterns. Similar to ordinary MCA, s- MCA can also alleviate the problem of overcrowded visualizations and can effectively identify associations between observed relational patterns and exogenous variables. All of these properties are illustrated on a student course-taking affiliation network.
