Modularity: Community Detection Algorithms

Related lectures (30)

Page 1 of 3

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Explores the structure of social and information networks, focusing on giant components, clustering, tie formation, and network connectivity.

Explores graph mining in social networks, covering modularity algorithms and community detection.

Explores energy systems modeling, optimization, and cost analysis for efficient operations.

Covers the optimization with constraints, focusing on the Karush-Kuhn-Tucker (KKT) conditions.

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Explores network analysis methods, operationalizing concepts, historical applications, and challenges in treating time within networks.

Covers optimization methods, focusing on gradient methods and line search techniques.

Covers semi-definite programming and optimization over positive semidefinite cones.

Covers fundamental concepts of optimization and operations research, exploring real-world examples and key topics over a semester.