Network Analysis and Network Optimization in SAS(R) Viya(R)

Cílová skupina

Tato část není lokalizována

Struktura kurzu

Tato část není lokalizována

Concepts in Network Analysis

• Introduction.
• Network-level concepts.
• Adjacency matrices and degree centrality.
• Introduction to the NETWORK procedure.

Centrality Measures

• Introduction.
• Eigenvector centrality.
• Betweenness and closeness centrality.
• Influence centrality (self-study).
• Hub and authority centrality.
• PageRank centrality.

Analysis of Subnetworks

• Connected and biconnected components.
• Maximal cliques.
• Community detection.
• Paths, shortest paths, and cycles.
• Pattern matching.

Bipartite Networks

• Introduction to bipartite networks.
• Network projection.

Network Optimization

• Introduction.
• Linear assignment problem.
• Minimum spanning tree.
• Maximum spanning tree (self-study).
• Traveling salesman problem.
• Minimum cost network flow (self-study).

Appendix A: Network Optimization Using the OPTMODEL Procedure

• Total unduplicated reach and frequency (TURF) analysis.
• Multiple traveling salesman problem (mTSP).
• Minimum cost network flow.

Appendix B: Centrality Measures Using the IML Action Set

• Introduction.
• Eigenvector centrality using IML.
• Hub and authority centrality using IML.
• PageRank centrality using IML.