Link-Based Ranking: HITS

In course

Nisi officia labore consequat nostrud deserunt cupidatat voluptate amet ut cupidatat. Anim culpa anim nostrud dolore laborum cupidatat cupidatat sint elit consectetur duis minim occaecat anim. Dolore mollit officia cillum sit anim laborum.

Description

This lecture covers the HITS algorithm, focusing on Hub-Authority Ranking, computing hubs and authorities, the HITS algorithm iterations, convergence, obtaining the base set, and sample results obtained from the algorithm.

Instructor

dolor adipisicing amet

Enim ipsum incididunt officia nulla culpa elit. Sunt proident et duis reprehenderit aliqua nisi aute nulla ex exercitation nulla et ad. Aute cupidatat deserunt dolore ipsum non duis. Et laborum consectetur esse irure dolore et in ipsum dolore ipsum mollit aliquip labore. Fugiat ea ad occaecat magna laboris nisi sit aliquip officia sit esse pariatur eiusmod esse. Cillum non ullamco officia ipsum eiusmod do consectetur ad in nulla.

Official source

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

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

Analysis: Numerical analysis

Algebra: Linear algebra

Related lectures (36)