schliessen

Filtern

 

Bibliotheken

The Application of Matrix Partitioning Algorithm in PageRank Computational Efficiency

With the vigorous development of the Internet information age, work efficiency can be improved by finding the information needed accurately and quickly. Therefore, it is of vital importance to make an ordering for the relevant information web pages that are provided by the Internet. This paper propo... Full description

Journal Title: Advanced materials research 2014-07-30, Vol.998-999, p.939-942
Main Author: Jiang, Ming Fu
Format: Electronic Article Electronic Article
Language: English
ID: ISSN: 1022-6680
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: cdi_crossref_primary_10_4028_www_scientific_net_AMR_998_999_939
title: The Application of Matrix Partitioning Algorithm in PageRank Computational Efficiency
format: Article
creator:
  • Jiang, Ming Fu
ispartof: Advanced materials research, 2014-07-30, Vol.998-999, p.939-942
description: With the vigorous development of the Internet information age, work efficiency can be improved by finding the information needed accurately and quickly. Therefore, it is of vital importance to make an ordering for the relevant information web pages that are provided by the Internet. This paper proposes a kind of PageRank algorithm based on matrix partitioning to complete the ordering of relevant information web pages and applies this algorithm in the calculation cases whose experimental results on the aspect of improving PageRank computational efficiency show matrix partitioning can reduce iterations and improve computational efficiency.
language: eng
source:
identifier: ISSN: 1022-6680
fulltext: no_fulltext
issn:
  • 1022-6680
  • 1662-8985
  • 1662-8985
url: Link


@attributes
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
RANK2.1940162
LOCALfalse
PrimoNMBib
record
control
sourceidtranstech_cross
recordidTN_cdi_crossref_primary_10_4028_www_scientific_net_AMR_998_999_939
sourceformatXML
sourcesystemPC
sourcerecordid10_4028_www_scientific_net_AMR_998_999_939
originalsourceidFETCH-LOGICAL-c1819-a803081f24cd383800d9563be01f70b747737770adada199b09af09c7b1fb8150
addsrcrecordideNqVkNtKAzEQhoMoWKvvkGtht5M9Jblcaz1Ai1La65BNkzZ1u1uSlNq3N1XBaxmGGWaYn38-hO4JpAVkbHQ8HlOvrO6CNValnQ6jejZPOWcJ5zzlOb9AA1JVWcI4Ky9jD1mWVBWDa3Tj_RagKkhWDtBysdG43u9bq2SwfYd7g2cyOPuJ36UL9jyz3RrX7bp3Nmx22HZxs9Zz2X3gcb_bH8L3oWzxxEQv0ZM63aIrI1uv737rEC2fJovxSzJ9e34d19NEEUZ4IhnkwIjJCrXKWc4AVrys8kYDMRQaWlCaU0pBrmIQzhvg0gBXtCGmYaSEIXr40VWu995pI_bO7qQ7CQLiDEpEUOIPlIigRAQlIqiYXERQUeTxRyQ42fmg1UZs-4OLH_n_yHwBAFh83g
sourcetypeAggregation Database
isCDItrue
recordtypearticle
display
typearticle
titleThe Application of Matrix Partitioning Algorithm in PageRank Computational Efficiency
creatorJiang, Ming Fu
creatorcontribJiang, Ming Fu
descriptionWith the vigorous development of the Internet information age, work efficiency can be improved by finding the information needed accurately and quickly. Therefore, it is of vital importance to make an ordering for the relevant information web pages that are provided by the Internet. This paper proposes a kind of PageRank algorithm based on matrix partitioning to complete the ordering of relevant information web pages and applies this algorithm in the calculation cases whose experimental results on the aspect of improving PageRank computational efficiency show matrix partitioning can reduce iterations and improve computational efficiency.
identifier
0ISSN: 1022-6680
1ISSN: 1662-8985
2EISSN: 1662-8985
3DOI: 10.4028/www.scientific.net/AMR.998-999.939
languageeng
ispartofAdvanced materials research, 2014-07-30, Vol.998-999, p.939-942
rights2014 Trans Tech Publications Ltd
lds50peer_reviewed
links
openurl$$Topenurl_article
thumbnail$$Uhttps://www.scientific.net/Image/TitleCover/3349?width=600
search
creatorcontribJiang, Ming Fu
title
0The Application of Matrix Partitioning Algorithm in PageRank Computational Efficiency
1Advanced materials research
descriptionWith the vigorous development of the Internet information age, work efficiency can be improved by finding the information needed accurately and quickly. Therefore, it is of vital importance to make an ordering for the relevant information web pages that are provided by the Internet. This paper proposes a kind of PageRank algorithm based on matrix partitioning to complete the ordering of relevant information web pages and applies this algorithm in the calculation cases whose experimental results on the aspect of improving PageRank computational efficiency show matrix partitioning can reduce iterations and improve computational efficiency.
issn
01022-6680
11662-8985
21662-8985
fulltextfalse
rsrctypearticle
creationdate2014
recordtypearticle
recordideNqVkNtKAzEQhoMoWKvvkGtht5M9Jblcaz1Ai1La65BNkzZ1u1uSlNq3N1XBaxmGGWaYn38-hO4JpAVkbHQ8HlOvrO6CNValnQ6jejZPOWcJ5zzlOb9AA1JVWcI4Ky9jD1mWVBWDa3Tj_RagKkhWDtBysdG43u9bq2SwfYd7g2cyOPuJ36UL9jyz3RrX7bp3Nmx22HZxs9Zz2X3gcb_bH8L3oWzxxEQv0ZM63aIrI1uv737rEC2fJovxSzJ9e34d19NEEUZ4IhnkwIjJCrXKWc4AVrys8kYDMRQaWlCaU0pBrmIQzhvg0gBXtCGmYaSEIXr40VWu995pI_bO7qQ7CQLiDEpEUOIPlIigRAQlIqiYXERQUeTxRyQ42fmg1UZs-4OLH_n_yHwBAFh83g
startdate20140730
enddate20140730
creatorJiang, Ming Fu
scope
0AAYXX
1CITATION
sort
creationdate20140730
titleThe Application of Matrix Partitioning Algorithm in PageRank Computational Efficiency
authorJiang, Ming Fu
facets
frbrtype5
frbrgroupidcdi_FETCH-LOGICAL-c1819-a803081f24cd383800d9563be01f70b747737770adada199b09af09c7b1fb8150
rsrctypearticles
prefilterarticles
languageeng
creationdate2014
toplevelpeer_reviewed
creatorcontribJiang, Ming Fu
collectionCrossRef
jtitleAdvanced materials research
delivery
delcategoryRemote Search Resource
fulltextno_fulltext
addata
auJiang, Ming Fu
formatjournal
genrearticle
ristypeJOUR
atitleThe Application of Matrix Partitioning Algorithm in PageRank Computational Efficiency
jtitleAdvanced materials research
date2014-07-30
risdate2014
volume998-999
spage939
epage942
pages939-942
issn
01022-6680
11662-8985
eissn1662-8985
notesSelected, peer reviewed papers from the 2014 International Conference on Applied Sciences, Engineering and Technology (ICASET 2014), July 28-29, 2014, Qingdao, China
abstractWith the vigorous development of the Internet information age, work efficiency can be improved by finding the information needed accurately and quickly. Therefore, it is of vital importance to make an ordering for the relevant information web pages that are provided by the Internet. This paper proposes a kind of PageRank algorithm based on matrix partitioning to complete the ordering of relevant information web pages and applies this algorithm in the calculation cases whose experimental results on the aspect of improving PageRank computational efficiency show matrix partitioning can reduce iterations and improve computational efficiency.
doi10.4028/www.scientific.net/AMR.998-999.939