In this chapter you will be introduced to labelled networks, network learning and the challanges that can arise.

Motivation: social networks and predictive analytics

Most likely to churn

Create a network from an edgelist

Labeled networks and network learning

Labeling nodes

Coloring nodes

Visualizing Churners

Relational Neighbor Classifier

Challenges of network-based inference

Challenges in Network learning

Probabilistic Relational Neighbor Classifier

Collective Inferencing

Introduction, networks and labelled networks

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.

Homophily

Homophilic networks

Extracting types of edges

Counting types of edges

Counting nodes and computing connectance

Dyadicity

Same label edges

Dyadicity of churners

Dyadicity of non-churners

Heterophilicity

Cross label edges

Compute heterophilicity

Summary of homophily

Dyadicity, Heterophilicity, & Homophily

Is the network homophilic?

In this chapter you will use the igraph package to compute various network features and add them to the network.

Basic Network features

Simple network features

Centrality features

Transitivity

Link-Based Features

Adjacency matrices

Link-based features

Second order link-based features

Neighborhood link-based features

PageRank

Most influential node

Changes in PageRank

Convergence of PageRank

Personalized PageRank

Extract PageRank features

Network Featurization

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.

Extract a dataset

Getting a flat dataset

Missing Values

Replace missing values

Correlated variables

Building a predictive model

Split into train and test

Logistic regression model

Random forest model

Evaluating model performance

Predicting churn

Measure AUC

Measure top decile lift

Summary and final thoughts

Putting it all together

Student Customers dataset

Student Edge List dataset

Student Network dataset

In this course, you will learn to perform state-of-the art predictive analytics using networked data in R.  The aim of network analytics is to predict to which class a network node belongs, such as churner or not, fraudster or not, defaulter or not, etc.  To accomplish this, we discuss how to leverage information from the network and its underlying structure in a predictive way.  More specifically, we introduce the idea of featurization such that network features can be added to non-network features as such boosting the performance of any resulting analytical model.  In this course, you will use the igraph package to generate and label a network of customers in a churn setting and learn about the foundations of network learning. Then, you will learn about homophily, dyadicity and heterophilicty, and how these can be used to get key exploratory insights in your network. Next, you will use the functionality of the igraph package to compute various network features to calculate both node-centric as well as neighbor based network features.  Furthermore, you will use the Google PageRank algorithm to compute network features and empirically validate their predictive power. Finally, we teach you how to generate a flat dataset from the network and analyze it using logistic regression and random forests.

Network Analysis in R

Supervised Learning in R: Classification

Learn to predict labels of nodes in networks using network learning and by extracting descriptive features from the network

Predictive Analytics using Networked Data in R

Is the network homophilic?

Predictive Analytics using Networked Data in R

Uygulamalı interaktif egzersiz