Graph Algorithms for Data Science

8 Constructing a nearest neighbor similarity network

This chapter covers

• Manually extracting node features
• Presenting network motifs and graphlets
• Introducing betweenness and closeness centralities
• Constructing a monopartite network based on pairwise cosine similarities
• Using the community detection algorithm to complete a user segmentation task

This chapter will describe constructing a similarity network based on node properties or features. Like a typical machine learning preprocessing workflow, each data point or node is represented as a vector. In the machine learning context, a vector is a list of one or more numerical values. When dealing with graphs, there are generally two approaches you could take to describe a node as a vector. You ...