Extension of PageRank and application to social networks

Abstract : Ranking objects is one of the important and typical issues in our daily life. Many applications need to rank objects according to certain criteria, as simple as ranking students in a class according to average grades, or more complicated as ranking universities. Ranking objects means to arrange them in accordance with some criteria depending on the specific application.In the era of the Internet, a typical problem emerging in the last decades is the ranking of results returned by search engines. In conventional search engines (like Google, Yahoo or Bing ), the importance of a web page is the basis for ranking. This value is determined based on the analysis of graph links between web pages. With a set of documents V={v1, ..., vn}, when there is a user’s query q arriving, the search engine looks for documents in V matching the query q, then sorts the documents according to their relevance to the query in descending order. This process can be done thanks to a ranking function which allows us to compute the similarity s(q,vi) between the query q and a document vi ∈ V . Obviously, the ranking function can be seen as the core and significantly determines the quality of the search engine.
Document type :
Theses
Liste complète des métadonnées

Cited literature [67 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01187929
Contributor : Abes Star <>
Submitted on : Friday, August 28, 2015 - 9:52:15 AM
Last modification on : Thursday, February 7, 2019 - 1:32:03 AM
Document(s) archivé(s) le : Sunday, November 29, 2015 - 10:22:55 AM

File

these_archivage_3008699o.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01187929, version 1

Citation

The Dang Huynh. Extension of PageRank and application to social networks. Web. Université Pierre et Marie Curie - Paris VI, 2015. English. ⟨NNT : 2015PA066114⟩. ⟨tel-01187929⟩

Share

Metrics

Record views

531

Files downloads

796