Skip to main content
Erschienen in: Social Network Analysis and Mining 1/2015

01.12.2015 | Original Article

An author is known by the context she keeps: significance of network motifs in scientific collaborations

verfasst von: Tanmoy Chakraborty, Niloy Ganguly, Animesh Mukherjee

Erschienen in: Social Network Analysis and Mining | Ausgabe 1/2015

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Collaboration networks are elegant representations for studying the dynamical processes that shape the scientific community. In this paper, we are particularly interested in studying the local context of a node in collaboration network that can help explain the behavior of an author as an individual within the group and a member along with the group. The best representation of such local contextual substructures in a collaboration network are “network motifs”. In particular, we propose two fundamental goodness measures of such a group represented by a motif—productivity and longevity. We observe that while 4-semi clique motif, quite strikingly, shows highest longevity, the productivity of the 4-star and the 4-clique motifs is the largest among all the motifs. Based on the productivity distribution of the motifs, we propose a predictive model that successfully classifies the highly cited authors from the rest. Further, we study the characteristic features of motifs and show how they are related with the two goodness measures. Building on these observations, finally we propose two supervised classification models to predict, early in a researcher’s career, how long the group where she belongs to will persist (longevity) and how much the group would be productive. Thus this empirical study sets the foundation principles of a recommendation system that would forecast how long lasting and productive a given collaboration could be in future.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Abbasi A, Chung KSK, Hossain L (2012) Egocentric analysis of co-authorship network structure, position and performance. Inf Process Manag 48(4):671–679CrossRef Abbasi A, Chung KSK, Hossain L (2012) Egocentric analysis of co-authorship network structure, position and performance. Inf Process Manag 48(4):671–679CrossRef
Zurück zum Zitat Alon U (2007) Network motifs: theory and experimental approaches. Nat Rev Genet 8(6):450–461CrossRef Alon U (2007) Network motifs: theory and experimental approaches. Nat Rev Genet 8(6):450–461CrossRef
Zurück zum Zitat Backstrom L, Leskovec J (2011) Supervised random walks: predicting and recommending links in social networks. In: WSDM. ACM, New York, NY, USA, pp 635–644 Backstrom L, Leskovec J (2011) Supervised random walks: predicting and recommending links in social networks. In: WSDM. ACM, New York, NY, USA, pp 635–644
Zurück zum Zitat Baras JS, Hovareshti P (2011) Motif-based communication network formation for task specific collaboration in complex environments. In: ACC 2011. IEEE, Kerala, India Baras JS, Hovareshti P (2011) Motif-based communication network formation for task specific collaboration in complex environments. In: ACC 2011. IEEE, Kerala, India
Zurück zum Zitat Chakraborty T, Ganguly N, Mukherjee A (2014) Automatic classification of scientific groups as productive: an approach based on motif analysis. In: 2014 IEEE/ACM international conference on advances in social networks analysis and mining, ASONAM 2014, Beijing, China, August 17–20, 2014, pp 130–137 Chakraborty T, Ganguly N, Mukherjee A (2014) Automatic classification of scientific groups as productive: an approach based on motif analysis. In: 2014 IEEE/ACM international conference on advances in social networks analysis and mining, ASONAM 2014, Beijing, China, August 17–20, 2014, pp 130–137
Zurück zum Zitat Chakraborty T, Sikdar S, Tammana V, Ganguly N, Mukherjee A (2013) Computer science fields as ground-truth communities: their impact, rise and fall. In: Advances in social networks analysis and mining 2013, ASONAM ’13, Niagara, ON, Canada—August 25–29, 2013, pp 426–433 Chakraborty T, Sikdar S, Tammana V, Ganguly N, Mukherjee A (2013) Computer science fields as ground-truth communities: their impact, rise and fall. In: Advances in social networks analysis and mining 2013, ASONAM ’13, Niagara, ON, Canada—August 25–29, 2013, pp 426–433
Zurück zum Zitat Choobdar S, Ribeiro P, Bugla S, Silva F (2012) Comparison of co-authorship networks across scientific fields using motifs. In: ASONAM. IEEE Computer Society, Los Alamitos, pp 147–152 Choobdar S, Ribeiro P, Bugla S, Silva F (2012) Comparison of co-authorship networks across scientific fields using motifs. In: ASONAM. IEEE Computer Society, Los Alamitos, pp 147–152
Zurück zum Zitat Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273–297MATH Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273–297MATH
Zurück zum Zitat Dascal M (1989) On the roles of context and literal meaning in understanding. Cogn Sci 13(2):253–257CrossRef Dascal M (1989) On the roles of context and literal meaning in understanding. Cogn Sci 13(2):253–257CrossRef
Zurück zum Zitat Ding Y (2011) Scientific collaboration and endorsement: network analysis of coauthorship and citation networks. J Informetr 5(1):187–203CrossRef Ding Y (2011) Scientific collaboration and endorsement: network analysis of coauthorship and citation networks. J Informetr 5(1):187–203CrossRef
Zurück zum Zitat Hyun Yook S, Oltvai ZN, lszl Barabsi AL (2004) Functional and topological characterization of protein interaction networks. Proteomics 4:928–942CrossRef Hyun Yook S, Oltvai ZN, lszl Barabsi AL (2004) Functional and topological characterization of protein interaction networks. Proteomics 4:928–942CrossRef
Zurück zum Zitat Han Y, Zhou B, Pei J, Jia Y (2009) Understanding importance of collaborations in co-authorship networks: a supportiveness analysis approach. In: SDM. Springer, Berlin, pp 1111–1122 Han Y, Zhou B, Pei J, Jia Y (2009) Understanding importance of collaborations in co-authorship networks: a supportiveness analysis approach. In: SDM. Springer, Berlin, pp 1111–1122
Zurück zum Zitat Huang J, Zhuang Z, Li J, Giles CL (2008) Collaboration over time: characterizing and modeling network evolution. In: WSDM. ACM, New York, pp 107–116 Huang J, Zhuang Z, Li J, Giles CL (2008) Collaboration over time: characterizing and modeling network evolution. In: WSDM. ACM, New York, pp 107–116
Zurück zum Zitat Kairam SR, Wang DJ, Leskovec J (2012) The life and death of online groups: predicting group growth and longevity. In: Proceedings of the fifth ACM international conference on web search and data mining, WSDM '12. ACM, New York, NY, USA, pp 673–682. doi:10.1145/2124295.2124374 Kairam SR, Wang DJ, Leskovec J (2012) The life and death of online groups: predicting group growth and longevity. In: Proceedings of the fifth ACM international conference on web search and data mining, WSDM '12. ACM, New York, NY, USA, pp 673–682. doi:10.​1145/​2124295.​2124374
Zurück zum Zitat Kashtan N, Itzkovitz S, Milo R, Alon U (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11):1746–1758CrossRef Kashtan N, Itzkovitz S, Milo R, Alon U (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11):1746–1758CrossRef
Zurück zum Zitat Kronegger L, Mali F, Ferligoj A, Doreian P (2012) Collaboration structures in slovenian scientific communities. Scientometrics 90(2):631–647CrossRef Kronegger L, Mali F, Ferligoj A, Doreian P (2012) Collaboration structures in slovenian scientific communities. Scientometrics 90(2):631–647CrossRef
Zurück zum Zitat Krumov L, Fretter C, Müller-Hannemann M, Weihe K, Hütt M (2011) Motifs in co-authorship networks and their relation to the impact of scientific publications. EPJB 84(4):535–540CrossRef Krumov L, Fretter C, Müller-Hannemann M, Weihe K, Hütt M (2011) Motifs in co-authorship networks and their relation to the impact of scientific publications. EPJB 84(4):535–540CrossRef
Zurück zum Zitat Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019–1031CrossRef Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019–1031CrossRef
Zurück zum Zitat Liu J, Lei KH, Liu JY, Wang C, Han J (2013) Ranking-based name matching for author disambiguation in bibliographic data. In: Proceedings of the 2013 KDD cup 2013 workshop, KDD Cup ’13. ACM, New York, NY, USA, pp 8:1–8:8. doi:10.1145/2517288.2517296 Liu J, Lei KH, Liu JY, Wang C, Han J (2013) Ranking-based name matching for author disambiguation in bibliographic data. In: Proceedings of the 2013 KDD cup 2013 workshop, KDD Cup ’13. ACM, New York, NY, USA, pp 8:1–8:8. doi:10.​1145/​2517288.​2517296
Zurück zum Zitat Liu HT, Pei D, Wu Y (2012) A novel evolution model of collaboration network based on scale-free network. ICHIT 2:148–155 Liu HT, Pei D, Wu Y (2012) A novel evolution model of collaboration network based on scale-free network. ICHIT 2:148–155
Zurück zum Zitat Martinez-Romo J, Robles G, González-Barahona JM, Ortuño-Perez M (2008) Using social network analysis techniques to study collaboration between a floss community and a company. In: OSS. Springer, Berlin, pp 171–186 Martinez-Romo J, Robles G, González-Barahona JM, Ortuño-Perez M (2008) Using social network analysis techniques to study collaboration between a floss community and a company. In: OSS. Springer, Berlin, pp 171–186
Zurück zum Zitat Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824–827CrossRef Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824–827CrossRef
Zurück zum Zitat Newman MEJ (2001) The structure of scientific collaboration networks. PNAS 98(2):404–409MATHCrossRef Newman MEJ (2001) The structure of scientific collaboration networks. PNAS 98(2):404–409MATHCrossRef
Zurück zum Zitat Newman M (2004) Coauthorship networks and patterns of scientific collaboration. PNAS 101:5200–5205CrossRef Newman M (2004) Coauthorship networks and patterns of scientific collaboration. PNAS 101:5200–5205CrossRef
Zurück zum Zitat Prill RJ, Iglesias PA, Levchenko A (2005) Dynamic properties of network motifs contribute to biological network organization. PLoS Biol 3(11):e343CrossRef Prill RJ, Iglesias PA, Levchenko A (2005) Dynamic properties of network motifs contribute to biological network organization. PLoS Biol 3(11):e343CrossRef
Zurück zum Zitat Rennie JDM, Srebro N (2005) Fast maximum margin matrix factorization for collaborative prediction. In: ICML. ACM, New York, pp 713–719 Rennie JDM, Srebro N (2005) Fast maximum margin matrix factorization for collaborative prediction. In: ICML. ACM, New York, pp 713–719
Zurück zum Zitat Hassan S-U, Ichise R (2009) Discovering research domains using distance matrix and co-authorship network. SDM 3:1252–1257 Hassan S-U, Ichise R (2009) Discovering research domains using distance matrix and co-authorship network. SDM 3:1252–1257
Zurück zum Zitat Said YH, Wegman EJ, Sharabati WK, Rigsby JT (2008) Social networks of author-coauthor relationships. Comput Stat Data Anal 52(4):2177–2184MathSciNetCrossRef Said YH, Wegman EJ, Sharabati WK, Rigsby JT (2008) Social networks of author-coauthor relationships. Comput Stat Data Anal 52(4):2177–2184MathSciNetCrossRef
Zurück zum Zitat Shi X, Wu L, Yang H (2008) Scientific collaboration network evolution model based on motif emerging. In: ICYCS. IEEE Computer Society, Washington, pp 2748–2752 Shi X, Wu L, Yang H (2008) Scientific collaboration network evolution model based on motif emerging. In: ICYCS. IEEE Computer Society, Washington, pp 2748–2752
Zurück zum Zitat Wernicke S (2005) A faster algorithm for detecting network motifs. In: WABI. Springer, Berlin, pp 165–177 Wernicke S (2005) A faster algorithm for detecting network motifs. In: WABI. Springer, Berlin, pp 165–177
Zurück zum Zitat Wernicke S, Rasche F (2006) Fanmod: a tool for fast network motif detection. Bioinformatics 22(9):1152–1153CrossRef Wernicke S, Rasche F (2006) Fanmod: a tool for fast network motif detection. Bioinformatics 22(9):1152–1153CrossRef
Zurück zum Zitat Wu G, Harrigan M, Cunningham P (2012) Classifying wikipedia articles using network motif counts and ratios. In: Proceedings of the eighth annual international symposium on wikis and open collaboration, WikiSym ’12. ACM, New York, NY, USA, pp 12:1–12:10 Wu G, Harrigan M, Cunningham P (2012) Classifying wikipedia articles using network motif counts and ratios. In: Proceedings of the eighth annual international symposium on wikis and open collaboration, WikiSym ’12. ACM, New York, NY, USA, pp 12:1–12:10
Zurück zum Zitat Yeang CH, Huang LC, Liu WC (2012) Recurrent structural motifs reflect characteristics of distinct networks. In: Proceedings of the 2012 international conference on advances in social networks analysis and mining (ASONAM 2012), ASONAM ’12. IEEE Computer Society, Washington, DC, USA, pp 551–557. doi:10.1109/ASONAM.2012.94 Yeang CH, Huang LC, Liu WC (2012) Recurrent structural motifs reflect characteristics of distinct networks. In: Proceedings of the 2012 international conference on advances in social networks analysis and mining (ASONAM 2012), ASONAM ’12. IEEE Computer Society, Washington, DC, USA, pp 551–557. doi:10.​1109/​ASONAM.​2012.​94
Zurück zum Zitat Yu K, Lafferty J, Zhu S, Gong Y (2009) Large-scale collaborative prediction using a nonparametric random effects model. In: ICML. ACM, New York, pp 1185–1192 Yu K, Lafferty J, Zhu S, Gong Y (2009) Large-scale collaborative prediction using a nonparametric random effects model. In: ICML. ACM, New York, pp 1185–1192
Metadaten
Titel
An author is known by the context she keeps: significance of network motifs in scientific collaborations
verfasst von
Tanmoy Chakraborty
Niloy Ganguly
Animesh Mukherjee
Publikationsdatum
01.12.2015
Verlag
Springer Vienna
Erschienen in
Social Network Analysis and Mining / Ausgabe 1/2015
Print ISSN: 1869-5450
Elektronische ISSN: 1869-5469
DOI
https://doi.org/10.1007/s13278-015-0255-3

Weitere Artikel der Ausgabe 1/2015

Social Network Analysis and Mining 1/2015 Zur Ausgabe