Lecture

Block Models: Continued Analysis

Related lectures (32)

Statistical Analysis of Network Data: Structures and Models

Explores statistical analysis of network data, covering graph structures, models, statistics, and sampling methods.

Explores Stochastic Blockmodel estimation, spectral clustering, network modularity, Laplacian matrix, and k-means clustering.

Graph metrics: Statistical analysis

Explores graph metrics and statistical analysis in network clustering, including ERGMs application in sociology and asymptotics.

Statistical Analysis of Networks: Link Prediction and Biclustering

Explores link prediction, logistic regression, causal inference, and biclustering in statistical network analysis.

Distances and Motif Counts

Explores distances on graphs, cut norms, spanning trees, blockmodels, metrics, norms, and ERGMs in network data analysis.

Clustering: Unsupervised Learning

Explores dimensionality reduction, clustering algorithms, and the state of machine learning.

Clustering: Theory and Practice

Covers the theory and practice of clustering algorithms, including PCA, K-means, Fisher LDA, spectral clustering, and dimensionality reduction.

Clustering: K-means & LDA

Covers clustering using K-means and LDA, PCA, K-means properties, Fisher LDA, and spectral clustering.

Statistical analysis of network data

Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.

Graph Statistics: Random Graphs, Graph Homomorphisms, and Network Analysis

Explores graph statistics, random graph generation, network analysis, centrality measures, and clustering coefficients.

Unsupervised Learning: Clustering Methods

Covers unsupervised learning focusing on clustering methods and the challenges faced in clustering algorithms like K-means and DBSCAN.

Unsupervised Behavior Clustering

Explores unsupervised behavior clustering and dimensionality reduction techniques, covering algorithms like K-Means, DBSCAN, and Gaussian Mixture Model.

Spectral Clustering: Theory and Applications

Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.

Statistical Consequences of Clustering

Covers the statistical consequences of clustering and the complexities of return level estimation in extreme events.

Clustering: Unsupervised Learning

Explores clustering in high-dimensional space, covering methods like hierarchical clustering, K-means, and DBSCAN.

Unsupervised Learning: Clustering

Explores unsupervised learning through clustering techniques, algorithms, applications, and challenges in various fields.

Supervised Learning Overview

Covers CNNs, RNNs, SVMs, and supervised learning methods, emphasizing the importance of tuning regularization and making informed decisions in machine learning.

Network clustering

Explores network clustering, spectral clustering, k-means algorithm, eigenvalue properties, block model estimation, and structural similarity measurement.

Spin Glasses and Bayesian Estimation

Covers the concepts of spin glasses and Bayesian estimation, focusing on observing and inferring information from a system closely.

Graph Coloring II

Explores advanced graph coloring concepts, including planted coloring, rigidity threshold, and frozen variables in BP fixed points.