Browsing by Subject Applying probabilistic

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 1 of 1
  • 171.pdf.jpg
  • Article


  • Authors: Le, Trung Kien; Tran, Loc Hung; Le, Anh Vu (2007)

  • The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by applying probabilistic model on the link structure of Webs to evaluate the “importance” of Webs. In PageRank probabilistic niodel, the links and webs are uniform, so the rank score of vvebs are quite independent from their content. In practice, the researchers often hope that the web results can be ranked by their proposed topics. Moreover, when computer’s techniques solve given problems ineffectively, it*s necessary to do better research in theoretical problems. From this judgement, in this paper, we introduce and describe the MPageRank based on a nevv probabilistic model supporti...

Browsing by Subject Applying probabilistic

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 1 of 1
  • 171.pdf.jpg
  • Article


  • Authors: Le, Trung Kien; Tran, Loc Hung; Le, Anh Vu (2007)

  • The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by applying probabilistic model on the link structure of Webs to evaluate the “importance” of Webs. In PageRank probabilistic niodel, the links and webs are uniform, so the rank score of vvebs are quite independent from their content. In practice, the researchers often hope that the web results can be ranked by their proposed topics. Moreover, when computer’s techniques solve given problems ineffectively, it*s necessary to do better research in theoretical problems. From this judgement, in this paper, we introduce and describe the MPageRank based on a nevv probabilistic model supporti...