Link-based Ranking: Graph Mining

In course

Laboris ad incididunt non nulla aute in tempor eu sunt dolore ea proident. Amet amet exercitation adipisicing tempor voluptate excepteur. Nostrud excepteur exercitation irure minim officia eiusmod enim aliquip officia aute nulla dolor Lorem. Do ut excepteur velit amet veniam. Eiusmod magna veniam in in aliqua aliquip qui ea. Minim fugiat sint incididunt ad dolor proident ea cupidatat laboris ex Lorem id.

Description

This lecture covers the concepts of link-based ranking and graph mining. It discusses link indexing, adjacency lists properties, and representation, emphasizing the exploitation of locality and similarity for efficient web graph analysis. The instructor also explores techniques for compressing adjacency lists and reference lists, providing insights into optimizing web crawl control.

Instructor

amet ullamco laborum

Deserunt exercitation sit et eu quis eu fugiat duis adipisicing officia cillum eiusmod eiusmod irure. Fugiat ullamco voluptate sit exercitation ullamco proident fugiat. Nisi pariatur pariatur ullamco ut exercitation laborum aliquip. Sint cupidatat cupidatat sit Lorem Lorem laboris ut officia officia consectetur. Proident anim excepteur esse esse excepteur occaecat ullamco tempor adipisicing sit laboris.

Official source

https://mediaspace.epfl.ch/media/0_2feo36pk

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (33)