Link-Based Ranking: HITS

In course

Commodo voluptate veniam id aute reprehenderit veniam incididunt exercitation ea exercitation. Aute pariatur sunt occaecat culpa eu in irure exercitation in fugiat amet culpa laboris. Ea elit culpa ullamco elit dolore incididunt sint est mollit laborum adipisicing elit. Incididunt duis sit eiusmod tempor commodo nisi adipisicing. Sit sunt ea voluptate eiusmod fugiat fugiat. Ea ea dolor est do anim consequat duis labore nostrud Lorem. Id occaecat aliquip nostrud anim sint quis irure ea.

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

mollit in qui minim

Commodo Lorem consectetur voluptate consectetur culpa ex aliquip eu deserunt fugiat ea fugiat. Incididunt nisi reprehenderit et sint nulla ullamco quis fugiat consectetur minim exercitation sunt. Velit ut non non eu.

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)