Skip to main content

Cooperation Prediction in GitHub Developers Network with Restricted Boltzmann Machine

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9622))

Included in the following conference series:

  • 1729 Accesses

Abstract

In order to solve link prediction problem with higher accuracy than achieved by classical supervised approaches we provide a proposal of the method based on information extracted from network using pre-processing done by Restricted Boltzmann Machine (RBM) and statistical inference models. Input space is fed to RBM in order to provide new sparse coded feature space that is used in order to estimate parameters of classical inference models. By accomplishing link prediction with proposed RBM pre-processing noticeable increase of all accuracy related measures was observed in comparison to state-of-the-art approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Adamic, L.A., Adar, E.: Predicting missing links via local information. Soc. Netw. 25(3), 211–230 (2003)

    Article  Google Scholar 

  • Brin, S., Page, L.: Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput. Netw. 56(18), 3825–3833 (2012)

    Article  Google Scholar 

  • Carreira-Perpinan, M.A., Hinton, G.E.: On contrastive divergence learning. In: Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, pp. 33–40. Citeseer (2005)

    Google Scholar 

  • Davis, D., Lichtenwalter, R.N., Chawla, N.V.: Multi-relational link prediction in heterogeneous information networks. In: 2011 International Conference on Advances in Social Networks Analysis and Mining, pp. 281–288 (2011)

    Google Scholar 

  • Dunlavy, D.M., Kolda, T.G., Acar, E.: Temporal link prediction using matrix and tensor factorizations. ACM Trans. Knowl. Discov. Data (TKDD) 5(2), 10 (2011)

    Google Scholar 

  • Fouss, F., Pirotte, A., Renders, J.-M., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19(3), 355–369 (2007)

    Article  Google Scholar 

  • Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35–41 (1977)

    Article  Google Scholar 

  • Hinton, G.E.: Training products of experts by minimizing contrastive divergence. Neural Comput. 14(8), 1771–1800 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  • Jaccard, P.: Etude comparative de la distribution florale dans une portion des Alpes et du Jura. Impr, Corbaz (1901)

    Google Scholar 

  • Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39–43 (1953)

    Article  MATH  Google Scholar 

  • 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)

    Google Scholar 

  • Liu, H., Hu, Z., Haddadi, H., Tian, H.: Hidden link prediction based on node centrality and weak ties. EPL (Europhys. Lett.) 101(1), 18004 (2013)

    Article  Google Scholar 

  • Newman, M.E.: The mathematics of networks. New Palgrave Encycl. Econ. 2(2008), 1–12 (2008)

    Google Scholar 

  • Newman, M.E.J.: Clustering and preferential attachment in growing networks, 1–13 (2001). http://bit.ly/1OBhDPL

  • Nickel, M., Murphy, K., Tresp, V., Gabrilovich, E.: A review of relational machine learning for knowledge graphs from multi-relational link prediction to automated knowledge graph construction, pp. 1–18 (2015). http://bit.ly/1OBhyLS

  • Peng, W., Baowen, X.U., Yurong, W.U., Xiaoyu, Z.: Link prediction in social networks: the state-of-the-art. 8 December 2014, vol. 58, pp. 1–38, January 2015. arXiv:1411.5118v2 [cs.SI]

  • Pržulj, N., Corneil, D.G., Jurisica, I.: Modeling interactome: scale-free or geometric? Bioinformatics 20(18), 3508–3515 (2004)

    Article  Google Scholar 

  • Sabidussi, G.: The centrality index of a graph. Psychometrika 31(4), 581–603 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  • Smolensky, P.: Information Processing in Dynamical Systems: Foundations of Harmony Theory (1986)

    Google Scholar 

Download references

Acknowledgements

The work was partially supported by The National Science Centre, decision no. DEC-2013/09/B/ST6/02317 and the European Commission under the 7th Framework Programme, Coordination and Support Action, Grant Agreement Number 316097, Engine project.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Roman Bartusiak or Tomasz Kajdanowicz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bartusiak, R., Kajdanowicz, T., Wierzbicki, A., Bukowski, L., Jarczyk, O., Pawlak, K. (2016). Cooperation Prediction in GitHub Developers Network with Restricted Boltzmann Machine. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49390-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49390-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49389-2

  • Online ISBN: 978-3-662-49390-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics