Applying probabilistic model for ranking Webs in multi-context
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 qu...
Lưu vào:
| Tác giả chính: | , , |
|---|---|
| Định dạng: | Bài trích |
| Ngôn ngữ: | English |
| Thông tin xuất bản: |
H. : ĐHQGHN
2017
|
| Chủ đề: | |
| Truy cập trực tuyến: | http://repository.vnu.edu.vn/handle/VNU_123/57486 |
| Từ khóa: |
Thêm từ khóa bạn đọc
Không có từ khóa, Hãy là người đầu tiên gắn từ khóa cho biểu ghi này!
|
| id |
oai:112.137.131.14:VNU_123-57486 |
|---|---|
| record_format |
dspace |
| spelling |
oai:112.137.131.14:VNU_123-574862018-08-03T02:50:05Z Applying probabilistic model for ranking Webs in multi-context Le, Trung Kien Tran, Loc Hung Le, Anh Vu Applying probabilistic Model Webs Multi-context 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 supporting multi-context for ranking Webs. A Web now has different ranking scores, which depends on the given multi topics. The basic idea in establishing the new MPageRank model is that partition our Web graph into smaller-size sub Web graph. As a consequence of evaluation and rejection about pages influence weakly to other pages, the rank score of pages of the original Web graph can be approximated from the rank score of pages in the new partition Web graph. Similar to the PageRank, the multi ranking scores in the MPageRank are pre-computed and reflect the hyperlink of Web environment. 2017-08-18T04:25:43Z 2017-08-18T04:25:43Z 2007 Article Le, T. K., Tran, L. H., Le, A. V. (2007). Applying probabilistic model for ranking Webs in multi-context. VNU Journal of Science, Mathematics - Physics, Vol. 23, No.1(2007), 35-46. 2588-1124 http://repository.vnu.edu.vn/handle/VNU_123/57486 en VNU Journal of Science application/pdf H. : ĐHQGHN |
| institution |
Đại học Quốc Gia Hà Nội |
| collection |
DSpace |
| language |
English |
| topic |
Applying probabilistic Model Webs Multi-context |
| spellingShingle |
Applying probabilistic Model Webs Multi-context Le, Trung Kien Tran, Loc Hung Le, Anh Vu Applying probabilistic model for ranking Webs in multi-context |
| description |
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 supporting multi-context for ranking Webs. A Web now has different ranking scores, which depends on the given multi topics. The basic idea in establishing the new MPageRank model is that partition our Web graph into smaller-size sub Web graph. As a consequence of evaluation and rejection about pages influence weakly to other pages, the rank score of pages of the original Web graph can be approximated from the rank score of pages in the new partition Web graph. Similar to the PageRank, the multi ranking scores in the MPageRank are pre-computed and reflect the hyperlink of Web environment. |
| format |
Article |
| author |
Le, Trung Kien Tran, Loc Hung Le, Anh Vu |
| author_facet |
Le, Trung Kien Tran, Loc Hung Le, Anh Vu |
| author_sort |
Le, Trung Kien |
| title |
Applying probabilistic model for ranking Webs in multi-context |
| title_short |
Applying probabilistic model for ranking Webs in multi-context |
| title_full |
Applying probabilistic model for ranking Webs in multi-context |
| title_fullStr |
Applying probabilistic model for ranking Webs in multi-context |
| title_full_unstemmed |
Applying probabilistic model for ranking Webs in multi-context |
| title_sort |
applying probabilistic model for ranking webs in multi-context |
| publisher |
H. : ĐHQGHN |
| publishDate |
2017 |
| url |
http://repository.vnu.edu.vn/handle/VNU_123/57486 |
| work_keys_str_mv |
AT letrungkien applyingprobabilisticmodelforrankingwebsinmulticontext AT tranlochung applyingprobabilisticmodelforrankingwebsinmulticontext AT leanhvu applyingprobabilisticmodelforrankingwebsinmulticontext |
| _version_ |
1768572915721175040 |