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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adamic, L.A., Adar, E.: Friends and neighbors on the web. Social Networks 25(3), 211–230 (2003)
Al Hasan, M., Chaoji, V., Salem, S., Zaki, M.: Link prediction using supervised learning. In: Workshop on Link Discovery: Issues, Approaches and Applications (2005)
Baronchelli, A., Ferrer-i Cancho, R., Pastor-Satorras, R., Chater, N., Christiansen, M.H.: Networks in cognitive science. Trends in Cognitive Sciences 17(7), 348–360 (2013)
Boccaletti, S., Bianconi, G., Criado, R., Del Genio, C., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., Zanin, M.: The structure and dynamics of multilayer networks. Physics Reports (2014)
Bollobás, B.: Modern graph theory, vol. 184. Springer (1998)
Breiger, R.L.: The duality of persons and groups. Social Forces 53(2), 181–190 (1974)
Breiman, L.: Random forests. Machine Learning 45(1), 5–32 (2001)
Chung, F.R.: Spectral graph theory, vol. 92. American Mathematical Soc. (1997)
Cortes, C., Vapnik, V.: Support-vector networks. Machine Learning 20(3), 273–297 (1995)
Duan, D., Li, Y., Li, R., Lu, Z.: Incremental k-clique clustering in dynamic social networks. Artificial Intelligence Review 38(2), 129–147 (2012)
Dunbar, R.I., Spoors, M.: Social networks, support cliques, and kinship. Human Nature 6(3), 273–290 (1995)
Easley, D., Kleinberg, J.: Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge University Press (2010)
Feld, S.L.: The focused organization of social ties. American Journal of Sociology, 1015–1035 (1981)
Finkel, J.R., Grenager, T., Manning, C.: Incorporating non-local information into information extraction systems by gibbs sampling. In: Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, pp. 363–370. Association for Computational Linguistics (2005)
Fischman, J.: Arizona’s big bet: The research rethink. Nature 514(7522), 292 (2014)
Gerow, A.: Extracting clusters of specialist terms from unstructured text. In: Proceedings of the 2014 Conference on Conference on Empirical Methods in Natural Language Processing (EMNLP 2014), Doha, Qatar, pp. 1426–1434 (2014)
Gerow, A., Evans, J.: The modular community structure of linguistic predication networks. In: Proceedings of TextGraphs-9, Doha, Qatar, pp. 48–54 (2014)
Getoor, L., Diehl, C.P.: Link mining: a survey. ACM SIGKDD Explorations Newsletter 7(2), 3–12 (2005)
Getoor, L., Friedman, N., Koller, D., Taskar, B.: Learning probabilistic models of link structure. The Journal of Machine Learning Research 3, 679–707 (2003)
Goldberg, K., Roeder, T., Gupta, D., Perkins, C.: Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval 4(2), 133–151 (2001)
Guns, R., Rousseau, R.: Recommending research collaborations using link prediction and random forest classifiers. Scientometrics 101(2), 1461–1473 (2014)
Heintz, B., Chandra, A.: Beyond graphs: toward scalable hypergraph analysis systems. ACM SIGMETRICS Performance Evaluation Review 41(4), 94–97 (2014)
Holland, P.W., Leinhardt, S.: An exponential family of probability distributions for directed graphs. Journal of the American Statistical Association 76(373), 33–50 (1981)
Lang, J., Lapata, M.: Similarity-driven semantic role induction via graph partitioning. Computational Linguistics 40(3), 633–669 (2014)
Li, D., Xu, Z., Li, S., Sun, X.: Link prediction in social networks based on hypergraph. In: Proceedings of the 22nd International Conference on World Wide Web Companion, pp. 41–42 (2013)
Li, L., Li, T.: News recommendation via hypergraph learning: encapsulation of user behavior and news content. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 305–314. ACM (2013)
Li, X., Liu, B., Yu, P.S.: Discovering overlapping communities of named entities. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 593–600. Springer, Heidelberg (2006)
Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology 58(7), 1019–1031 (2007)
Lichtenwalter, R.N., Lussier, J.T., Chawla, N.V.: New perspectives and methods in link prediction. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 243–252. ACM (2010)
Ma, H., Yang, H., Lyu, M.R., King, I.: Sorec: social recommendation using probabilistic matrix factorization. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 931–940. ACM (2008)
Mika, P.: Ontologies are us: A unified model of social networks and semantics. Web Semantics: Science, Services and Agents on the World Wide Web 5(1), 5–15 (2007)
Mitchum, R., Brand, A., Transande, C.: White paper: Information, interaction, influence: Research information technologies and their role in advancing science (2014)
Newman, M.E.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)
Ng, A.Y., Jordan, M.I., Weiss, Y., et al.: On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems 2, 849–856 (2002)
Robins, G., Pattison, P., Kalish, Y., Lusher, D.: An introduction to exponential random graph (p*) models for social networks. Social Networks 29(2), 173–191 (2007)
Sharma, A., Srivastava, J., Chandra, A.: Predicting multi-actor collaborations using hypergraphs. arXiv preprint arXiv:1401.6404 (2014)
Shi, F., Foster, J.G., Evans, J.: Weaving the fabric of science: Dynamic network models of sciences unfolding structure. Social Networks (forthcoming, 2015)
Sintos, S., Tsaparas, P.: Using strong triadic closure to characterize ties in social networks. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1466–1475. ACM (2014)
Snijders, T.A.: Markov chain monte carlo estimation of exponential random graph models. Journal of Social Structure 3(2), 1–40 (2002)
Taramasco, C., Cointet, J.-P., Roth, C.: Academic team formation as evolving hypergraphs. Scientometrics 85(3), 721–740 (2010)
Tjong Kim Sang, E.F., De Meulder, F.: Introduction to the conll-2003 shared task: language-independent named entity recognition. In: Proceedings of the Seventh Conference on Natural Language Learning at HLT-NAACL 2003, vol. 4, pp. 142–147. Association for Computational Linguistics (2003)
Walter, F.E., Battiston, S., Schweitzer, F.: A model of a trust-based recommendation system on a social network. Autonomous Agents and Multi-Agent Systems 16(1), 57–74 (2008)
Xia, F., Chen, Z., Wang, W., Li, J., Yang, L.T.: Mvcwalker: Random walk based most valuable collaborators recommendation exploiting academic factors. IEEE Transcactions on Emerging Topics in Computing 2(3), 364–375 (2014)
Zhang, Z.-K., Liu, C.: A hypergraph model of social tagging networks. Journal of Statistical Mechanics: Theory and Experiment 2010(10), P10005 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Gerow, A., Lou, B., Duede, E., Evans, J. (2015). Proposing Ties in a Dense Hypergraph of Academics. In: Liu, TY., Scollon, C., Zhu, W. (eds) Social Informatics. SocInfo 2015. Lecture Notes in Computer Science(), vol 9471. Springer, Cham. https://doi.org/10.1007/978-3-319-27433-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-27433-1_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27432-4
Online ISBN: 978-3-319-27433-1
eBook Packages: Computer ScienceComputer Science (R0)