Stability and similarity of link analysis ranking algorithms

dc.contributor.authorDonato, D.en
dc.contributor.authorLeonardi, S.en
dc.contributor.authorTsaparas, P.en
dc.date.accessioned2015-11-24T17:00:57Z
dc.date.available2015-11-24T17:00:57Z
dc.identifier.issn0302-9743-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10846
dc.rightsDefault Licence-
dc.titleStability and similarity of link analysis ranking algorithmsen
heal.abstractRecently, there has been a surge of research activity in the area of Link Analysis Ranking, where hyperlink structures are used to determine the relative authority of Web pages. One of the seminal works in this area is that of Kleinberg [15], who proposed the HITS algorithm. In this paper, we undertake a theoretical analysis of the properties of the HITS algorithm on a broad class of random graphs. Working within the framework of Borodin et al. [7], we prove that on this class (a) the HITS algorithm is stable with high probability, and (b) the HITS algorithm is similar to the INDEGREE heuristic that assigns to each node weight proportional to the number of incoming links. We demonstrate that our results go through for the case that the expected in-degrees of the graph follow a power-law distribution, a situation observed in the actual Web graph [9]. We also study experimentally the similarity between HITS and INDEGREE, and we investigate the general conditions under which the two algorithms are similar.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.journalNameAutomata, Languages and Programming, Proceedingsen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2005-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Φόρτωση...
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή: