Lecture

Biclustering: Networks MA448

Related lectures (32)

Covers K-means, hierarchical, and DBSCAN clustering methods with practical examples.

Explains k-means clustering, assigning data points to clusters based on proximity and minimizing squared distances within clusters.

Linear Algebra: Matrices Properties

Explores properties of 3x3 matrices with real coefficients and determinant calculation methods.

Computational Methods: Paths and Strings

Covers computational methods focusing on paths and strings, including examples of concatenation, regex elements, and string operations.

Machine Learning: Fundamentals and Applications

Introduces machine learning basics, covering data segmentation, clustering, classification, and practical applications like image classification and face similarity.

Unsupervised Learning: Clustering & Dimensionality Reduction

Introduces unsupervised learning through clustering with K-means and dimensionality reduction using PCA, along with practical examples.

Machine Learning Fundamentals

Covers key concepts and examples of machine learning algorithms and techniques.

Algorithmic Paradigms for Dynamic Graph Problems

Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.

Unsupervised Behavior Clustering

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

Kernel K-means Clustering

Explores Kernel K-means clustering, interpreting solutions, handling missing data, and dataset selection for machine learning.

Unsupervised Learning: Clustering

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

Trade-offs in Data and Time

Explores trade-offs between data and time in computational problems, emphasizing diminishing returns and continuous trade-offs.

Clusters and Communities

Explores clustering, community detection, K-means, GMM, modularity, and the Louvain method.

K-means Algorithm

Covers the K-means algorithm for clustering data samples into k classes without labels, aiming to minimize the loss function.

Computational Quantum Physics

Explores computational methods in quantum physics, emphasizing exact diagonalization and space discretization techniques.

Unsupervised Learning: Dimensionality Reduction and Clustering

Covers unsupervised learning, focusing on dimensionality reduction and clustering, explaining how it helps find patterns in data without labels.

Supervised Learning Overview

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

Clustering & Density Estimation

Covers dimensionality reduction, PCA, clustering techniques, and density estimation methods.

Clustering: Unsupervised Learning

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

Berni Alder Prize: Celebrating 50 Years of CECAM

Commemorates 50 years of CECAM and the Berni J. Alder CECAM Prize, covering milestones in computational methods, quantum mechanics, slip motion, and more.