An algorithm for min-cut density-balanced partitioning in P2P web ranking

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Sumalee Sangamuang, Pruet Boonma, Juggapong Natwichai
Format: Book Series
Published: 2018
Subjects:
Computer Science
Engineering
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84931273886&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/54378
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
id th-cmuir.6653943832-54378
record_format dspace
spelling th-cmuir.6653943832-543782018-09-04T10:15:19Z An algorithm for min-cut density-balanced partitioning in P2P web ranking Sumalee Sangamuang Pruet Boonma Juggapong Natwichai Computer Science Engineering © 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 ranking until converge. In this paper, the problem of partitioning web-link graph for web ranking in P2P is formulated as a minimal cut-set with density-balanced partitioning. Then, an efficient algorithm called DBP-dRanking is proposed to address such problem. The algorithm can solve the problem with computational complexity of a polynomial function to the web-link graph size. The results also confirm that the proposed algorithm can reduce the ranking error by partitioning web-link graph and perform faster than two other algorithms. 2018-09-04T10:12:37Z 2018-09-04T10:12:37Z 2015-01-01 Book Series 21945357 2-s2.0-84931273886 10.1007/978-3-319-19024-2_26 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84931273886&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54378
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
topic Computer Science
Engineering
spellingShingle Computer Science
Engineering
Sumalee Sangamuang
Pruet Boonma
Juggapong Natwichai
An algorithm for min-cut density-balanced partitioning in P2P web ranking
description © 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 ranking until converge. In this paper, the problem of partitioning web-link graph for web ranking in P2P is formulated as a minimal cut-set with density-balanced partitioning. Then, an efficient algorithm called DBP-dRanking is proposed to address such problem. The algorithm can solve the problem with computational complexity of a polynomial function to the web-link graph size. The results also confirm that the proposed algorithm can reduce the ranking error by partitioning web-link graph and perform faster than two other algorithms.
format Book Series
author Sumalee Sangamuang
Pruet Boonma
Juggapong Natwichai
author_facet Sumalee Sangamuang
Pruet Boonma
Juggapong Natwichai
author_sort Sumalee Sangamuang
title An algorithm for min-cut density-balanced partitioning in P2P web ranking
title_short An algorithm for min-cut density-balanced partitioning in P2P web ranking
title_full An algorithm for min-cut density-balanced partitioning in P2P web ranking
title_fullStr An algorithm for min-cut density-balanced partitioning in P2P web ranking
title_full_unstemmed An algorithm for min-cut density-balanced partitioning in P2P web ranking
title_sort algorithm for min-cut density-balanced partitioning in p2p web ranking
publishDate 2018
url https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84931273886&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/54378
_version_ 1681424309575221248

Similar Items