An algorithm for min-cut density-balanced partitioning in P2P web ranking
© Springer International Publishing Switzerland 2015. In P2P-based PageRank computing, each computational peer contains a partitioned local web-link graph and its PageRank is computed locally. Then, collaborative web ranking between any two peers will be proceeded iteratively to adjust the web ranki...
Saved in:
Main Authors: | Sumalee Sangamuang, Pruet Boonma, Juggapong Natwichai |
---|---|
Format: | Book Series |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84931273886&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/44436 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
An algorithm for min-cut density-balanced partitioning in P2P web ranking
by: Sumalee Sangamuang, et al.
Published: (2018) -
IDBP: A distributed min-cut density-balanced algorithm for incremental web-pages ranking
by: Sumalee Sangamuang, et al.
Published: (2020) -
Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
by: Sumalee Sangamuang, et al.
Published: (2019) -
A P2P-based incremental web ranking algorithm
by: Sumalee Sangamuang, et al.
Published: (2018) -
An efficient algorithm for density-balanced partitioning in distributed pagerank
by: Sumalee Sangamuang, et al.
Published: (2018)