Advertisement

Using Hierarchies in Online Social Networks to Determine Link Prediction

  • Ravinder AhujaEmail author
  • Vipul Singhal
  • Alisha Banga
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 898)

Abstract

Social hierarchy is one of the most basic concepts in sociology and analysis of networks. In today’s world, online social networks are very popular, and thus, there is a need to analyze social hierarchies in the form of complex networks. Social hierarchies can help in improving link prediction, optimize page rank, provide efficient query results, etc. These networks can provide us with important information about social interactions and how to efficiently use it. Social network will be modeled as directed graph, and then, social hierarchies are explored by converting directed graph to directed acyclic graph. By converting to directed acyclic graph (DAG), we can partition the graph into different levels which will divide the network into multiple hierarchies. The topmost level signifies highest social ranking, while bottom ones represent the least ranking. Most algorithms widely used calculate DAG in O(n3), which is fine for small graphs, but when dealing with large social networks, it is not practically feasible. Thus here, we devise a new method to compute DAG. In this method, we will remove all the cycles from graph G′. In addition to this, we use a two-phase algorithm—compute and refine. The result is used to improve link prediction. The algorithm used two orders faster than the basic algorithm.

Keywords

Directed acyclic graph Eulerian graph Link prediction Social hierarchy Social network 

References

  1. 1.
    Zhang, H., Quan, W., Song, J., Jiang, Z., Yu, S.: Link state prediction-based reliable transmission for high-speed railway networks. IEEE Trans. Veh. Technol. 65(12), 9617–9629 (2016)CrossRefGoogle Scholar
  2. 2.
    Nagappan V.K., Elango, P.: Agent-based weighted page ranking algorithm for web content information retrieval, pp. 31–36 (2015)Google Scholar
  3. 3.
    Li, D., Li, D., Mao, J.: On a maximum number of an edge in a spanning Eulerian subgraph. Discr. Math. 274(1/3), 299–302 (2004)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Gupta, M., Shankar, P., Li, J., Muthukrishnan, S., Iftode, L.: Finding hierarchy in directed online social networks. In: Proceedings of 20th International Conference on World Wide Web, pp. 557–566 (2011)Google Scholar
  5. 5.
    Gould, R.V.: The origins of status hierarchies: a formal theory and empirical test. Am. J. Soc. 107(5), 1143–1178 (2002)CrossRefGoogle Scholar
  6. 6.
    Maiya, A.S., Berger-Wolf, T.Y.: Inferring the maximum likelihood hierarchy in social networks. In: Proceedings of International Conference Computer Science Engineering, pp. 245–250 (2009)Google Scholar
  7. 7.
    Zhang, J., Wang, C., Wang, J.: Who proposed the relationship?: recovering the hidden directions of undirected social networks. In: Proceedings of 23rd International Conference on World Wide Web, pp. 807–818 (2014)Google Scholar
  8. 8.
    Catlin, P.A.: Supereulerian graphs: a survey. J. Graph Theory 16(2), 177–196 (1992)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Chen, Z., Lai, H.: Reduction techniques for supereulerian graphs and related topics: a survey. Combinatorics Graph Theory, vol. 1. World Sci. Pub., River Edge, NY, USA (1995)Google Scholar
  10. 10.
    Fleischner, H.: Eulerian Graphs and Related Topics, vol. 1. North-Holland, Amsterdam, The Netherlands (1990)zbMATHGoogle Scholar
  11. 11.
    Doreian, P., Batagelj, V., Ferligoj, A.: Symmetric-acyclic decompositions of networks. J. Classif. 17(1), 3–28 (2000)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Jaypee Institute of Information TechnologyNoidaIndia
  2. 2.Satyug Darshan Institute of Engineering and TechnologyFaridabadIndia

Personalised recommendations