7 Inferring co-occurrence networks based on bipartite networks

This chapter covers

  • Extracting hashtags from tweets with Cypher query language
  • Calculating the Jaccard similarity coefficient
  • Constructing and analyzing monopartite networks using the Jaccard similarity coefficient
  • Using the label propagation algorithm to evaluate the community structure of a network
  • Using PageRank to find the most important node within a community

In the previous chapter, you learned how to transform a custom graph pattern into direct relationships to use them as an input to graph algorithms like PageRank. In this chapter, you will focus on bipartite networks and how to project them into monopartite networks. Let’s start with a quick refresher on bipartite networks. ...

Get Graph Algorithms for Data Science now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.