Proposing Ties in a Dense Hypergraph of Academics

Abstract

Abstract. Nearly all personal relationships exhibit a multiplexity where people relate to one another in many different ways. Using a set of faculty CVs from multiple research institutions, we mined a hypergraph of researchers connected by co-occurring named entities (people, places and organizations). This results in an edge-sparse, link-dense structure with weighted connections that accurately encodes faculty department structure. We introduce a novel model that generates dyadic proposals of how well two nodes should be connected based on both the mass and distributional similarity of links through shared neighbors. Similar link prediction tasks have been primarily explored in unipartite settings, but for hypergraphs where hyper-edges out-number nodes 25-to-1, accounting for link similarity is crucial. Our model is tested by using its proposals to recover link strengths from four systematically lesioned versions of the graph. The model is also compared to other link prediction methods in a static setting. Our results show the model is able to recover a majority of link mass in various settings and that it out-performs other link prediction methods. Overall, the results support the descriptive fidelity of our text-mined, named entity hypergraph of multi-faceted relationships and underscore the importance of link similarity in analyzing link-dense multiplexitous relationships.

Optimal Physician Shared-Patient Networks and the Diffusion of Medical Technologies

“…One may also question the utility of projecting the network to a unipartite space at all. Network methods exist that analyze data in the bipartite space, avoiding the loss of information that occurs in projection, such as hypergraph representations (Gerow et al, 2015). However, for many uses of networks, such methods will be further afield than using well-known methods on a network constructed a different way.…”

Cloud Kotta: Enabling secure and scalable data analytics in the cloud

“…3) Network Analysis: Researchers in the computational social sciences are increasingly interested in large scale, complex network analysis. Early work on CLOUD KOTTA was leveraged in developing and analyzing a massive, dynamic hyper-graph model of biomedical science [5] and a dynamic hypergraph model of practicing scientists and scholars [6]. For the biomedical study, researchers extracted all authors, chemicals, diseases, and methods represented in the National Library of Medicine's 20 million article MEDLINE dataset and constructed a dynamic hypergraph model through time (e.g.…”

A secure data enclave and analytics platform for social scientists

“…The final outputs of these runs were used to develop an interactive platform for researchers ( Fig. 4) to generate explore commonalities and to propose future collaborators based on their existing work [7].…”