Lecture

Link-based Ranking: Graph Mining

Related lectures (30)

Graph Algorithms: Memory Management and Traversal

Explores memory management, graph representation, and traversal algorithms in Python, emphasizing BFS and DFS.

Link-based Ranking: Fundamentals and Algorithms

Covers the fundamentals and algorithms of link-based ranking, including anchor text indexing, PageRank, HITS, and practical implementations.

Graph Algorithms: Basics

Introduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.

Graph Algorithms: Modeling and Representation

Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.

Link-based ranking: PageRank & HITS

Explores link-based ranking through PageRank and HITS algorithms, covering practical examples and challenges in web search and ranking methods.

Link Indexing

Explores adjacency lists, locality, similarity, and efficient representation in link indexing.

Graph Algorithms: Modeling and Traversal

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Compression: Prefix-Free Codes

Explains prefix-free codes for efficient data compression and the significance of uniquely decodable codes.

Graphical Models: Representing Probabilistic Distributions

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Graphs: Properties and Representations

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Graphs: BFS

Introduces elementary graph algorithms, focusing on Breadth-First Search and Depth-First Search.

Neural Signal Compression

Explores analog-to-digital conversion, neural signal optimization, multichannel architectures, and on-chip compression techniques in neuroengineering.

Data Compression: Shannon-Fano Algorithm

Explores the Shannon-Fano algorithm for efficient data compression and its applications in lossless and lossy compression techniques.

Depth-First Search: Traversing and Sorting Graphs

Explores depth-first search, breadth-first search, graph representation, and topological sorting in graphs.

JPEG 2000: Image Compression

Explores image compression principles, focusing on JPEG 2000, covering transform-based coding, quantization, entropy coding, region of interest, error resilience, and software implementations.

JPEG XS & JPEG XL: Next-Gen Image Compression

Explores the cutting-edge JPEG XS and JPEG XL image compression standards, emphasizing their efficiency and versatility in various applications.

Information Retrieval: Indexing and Retrieval

Covers indexing techniques, distributed retrieval algorithms, and challenges in large-scale web indexing.

Data Compression: Entropy Definition

Explores data compression through entropy definition, types, and practical examples, illustrating its role in efficient information storage and transmission.

Entropy and Compression I

Explores entropy theory, compression without loss, and the efficiency of the Shannon-Fano algorithm in data compression.

Irreducible Matrices and Strong Connectivity

Explores irreducible matrices and strong connectivity in networked control systems, emphasizing the importance of adjacency matrices and graph structures.