Lectures related to Levenshtein distance

Distances and Motif Counts

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

Advanced Structure Discovery: Distance Metrics and Time Series Data

Explores clustering algorithms, distance metrics, and time series data analysis techniques.

Graph metrics: Statistical analysis

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

Error-Correcting Codes: Hamming Distance and Polynomial Multiplication

Covers error-correcting codes, Hamming distance, and polynomial multiplication in algebraic fields.

Temporality and Entity Resolution

Explores challenges in data temporality and techniques for entity resolution.

Error Correction Codes: Structure and Properties

Explores error correction codes, focusing on structure, properties, and the Singleton bound.

Spelling Error Correction

Explores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.

Error Correction Codes: Basics

Introduces erasure and error channels, Hamming distance, and error correction codes.

E8 Lattice Optimality

Delves into the construction and optimality of the E8 lattice as the densest sphere packing in dimension eight.

Convolutional Codes: Mapping Symbols and Paths

Covers Convolutional Codes, focusing on mapping symbols and paths.

Supervised Learning: k-NN and Decision Trees

Introduces supervised learning with k-NN and decision trees, covering techniques, examples, and ensemble methods.

Ergodic properties of low complexity symbolic systems

Explores the influence of complexity on ergodic properties of symbolic systems, presenting the Curtis-Hedlund-Lyndon Theorem and constructions of minimal subshifts.

Error-Correcting Codes: Reed-Solomon

Explains Reed-Solomon error-correcting codes and their unique decoding property over finite fields.

Binary Parity Check Code

Explores binary parity check codes, systematic generator matrix, and Gaussian elimination.

Error Correction Codes: Theory and Applications

Covers error correction codes theory and applications, emphasizing the importance of minimizing distance for reliable communication.

Euclidean Spaces: Properties and Concepts

Covers the properties of Euclidean spaces, focusing on R^n and its applications in analysis.

Advanced Physics I: Inertia Tensor and Rotation

Covers the determination of inertia tensor for rotating objects and the concept of non-principal axes.

Time Series Clustering

Covers clustering time series data using dynamic time warping, string metrics, and Markov models.

KNN Classifier: Nearest Neighbor Approach

Explains the K-Nearest Neighbors classifier, assigning labels based on closest points and smoothing noise in labels.

Orthogonal Bases and Projection

Introduces orthogonal bases, projection onto subspaces, and the Gram-Schmidt process in linear algebra.