A P2P-based incremental web ranking algorithm
In this paper, we propose an incremental algorithm for web ranking in the Peer-to-Peer (P2P) environments. Not the same as the non-incremental algorithm, the proposed algorithm can partition the web link graphs, the graphs represented the connectivity structure among the web pages, into the changed...
Saved in:
Main Authors: | Sangamuang S., Boonma P., Natwichai J. |
---|---|
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2014
|
在線閱讀: | http://www.scopus.com/inward/record.url?eid=2-s2.0-84855856545&partnerID=40&md5=f61d096be77dc823c076646810a11d5f http://cmuir.cmu.ac.th/handle/6653943832/1531 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
A P2P-based incremental web ranking algorithm
由: Sumalee Sangamuang, et al.
出版: (2018) -
Incremental web ranking on P2P networks
由: Sangamuang S., et al.
出版: (2014) -
Incremental web ranking on P2P networks
由: Sumalee Sangamuang, et al.
出版: (2018) -
An algorithm for min-cut density-balanced partitioning in P2P web ranking
由: Sumalee Sangamuang, et al.
出版: (2018) -
An algorithm for min-cut density-balanced partitioning in P2P web ranking
由: Sumalee Sangamuang, et al.
出版: (2018)