In this chapter you will be introduced to labelled networks, network learning and the challanges that can arise.
In this chapter you will learn about homophily and how to compute the two measures that can be used to characterice it, dyadicity and heterophilicty.
In this chapter you will use the igraph package to compute various network features and add them to the network.
In this chapter you will use the network from Chapter 3 to create a flat dataset. Using standard data mining techniques, you will build predictive models and measure their performance with AUC and top decile lift.