An efficient algorithm for density-balanced partitioning in distributed pagerank
© 2014 IEEE. Google's PageRank is the most notable approach for web search ranking. In general, web pages are represented by web-link graph; a web-page is represented by a node, and a link between two pages is represented by an edge. In particular, it is not efficient to perform PageRank of a l...
Saved in:
Main Authors: | Sumalee Sangamuang, Pruet Boonma, Juggapong Natwichai |
---|---|
Format: | Conference Proceeding |
Published: |
2018
|
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84930452384&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/45315 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
An efficient algorithm for density-balanced partitioning in distributed pagerank
by: Sumalee Sangamuang, et al.
Published: (2018) -
An algorithm for min-cut density-balanced partitioning in P2P web ranking
by: Sumalee Sangamuang, et al.
Published: (2018) -
An algorithm for min-cut density-balanced partitioning in P2P web ranking
by: Sumalee Sangamuang, et al.
Published: (2018) -
Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
by: Sumalee Sangamuang, et al.
Published: (2019) -
IDBP: A distributed min-cut density-balanced algorithm for incremental web-pages ranking
by: Sumalee Sangamuang, et al.
Published: (2020)