A method of constructing the frame of a directed graph

In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual us...

Full description

Saved in:
Bibliographic Details
Published in:International journal of applied mathematics and computer science 2013-12, Vol.23 (4), p.823-837
Main Authors: Hofuku, Ichiro, Oshima, Kunio
Format: Article
Language:English
Subjects:
Algorithms
Graph theory
Interference
Mathematical analysis
Mathematical models
Networks
Ranking
Search engines
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 837
container_issue 4
container_start_page 823
container_title International journal of applied mathematics and computer science
container_volume 23
creator Hofuku, Ichiro
Oshima, Kunio
description In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The WorldWideWeb can be expressed as an enormous directed graph. The purpose of the present study is to provide tools for studying the web as a directed graph in order to find clues to the solution of the problem of interference from superfluous information, and to reform the directed graph to clarify the relationships between the nodes.
doi_str_mv 10.2478/amcs-2013-0062
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_1567117770</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1567117770</sourcerecordid><originalsourceid>FETCH-LOGICAL-c348t-bbaac6323c74fb3e0d1ebe216e1173853288da4b4da254ac97dae3abb8c040463</originalsourceid><addsrcrecordid>eNpdjjtPwzAURi0EElXpymyJhcVw_YjtjlUFFKkSC0hs1bV90wQ1SYmd_095TEzf8B0dHcauJdwp4_w9djELBVILAKvO2EyB18KbpTpnM2mNFN7Z90u2yLkNIJ32lQQzY3bFOyrNkPhQ8zj0uYxTLG2_56UhXo_Y0feDPLUjxUKJ70c8NlfsosZDpsXfztnb48PreiO2L0_P69VWRG18ESEgRquVjs7UQRMkSYGUtCR_ErTyPqEJJqGqDMalS0gaQ_ARDBir5-z213sch8-Jctl1bY50OGBPw5R3srLupHIOTujNP_RjmMb-VLeTxnuQ3oDVX-eKVlI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1488018406</pqid></control><display><type>article</type><title>A method of constructing the frame of a directed graph</title><source>Freely Accessible Science Journals - check A-Z of ejournals</source><source>Publicly Available Content (ProQuest)</source><creator>Hofuku, Ichiro ; Oshima, Kunio</creator><creatorcontrib>Hofuku, Ichiro ; Oshima, Kunio</creatorcontrib><description>In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The WorldWideWeb can be expressed as an enormous directed graph. The purpose of the present study is to provide tools for studying the web as a directed graph in order to find clues to the solution of the problem of interference from superfluous information, and to reform the directed graph to clarify the relationships between the nodes.</description><identifier>ISSN: 1641-876X</identifier><identifier>EISSN: 2083-8492</identifier><identifier>DOI: 10.2478/amcs-2013-0062</identifier><language>eng</language><publisher>Zielona Góra: De Gruyter Poland</publisher><subject>Algorithms ; Graph theory ; Interference ; Mathematical analysis ; Mathematical models ; Networks ; Ranking ; Search engines</subject><ispartof>International journal of applied mathematics and computer science, 2013-12, Vol.23 (4), p.823-837</ispartof><rights>Copyright Versita Dec 2013</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/1488018406?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,25730,27900,27901,36988,36989,44565</link.rule.ids></links><search><creatorcontrib>Hofuku, Ichiro</creatorcontrib><creatorcontrib>Oshima, Kunio</creatorcontrib><title>A method of constructing the frame of a directed graph</title><title>International journal of applied mathematics and computer science</title><description>In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The WorldWideWeb can be expressed as an enormous directed graph. The purpose of the present study is to provide tools for studying the web as a directed graph in order to find clues to the solution of the problem of interference from superfluous information, and to reform the directed graph to clarify the relationships between the nodes.</description><subject>Algorithms</subject><subject>Graph theory</subject><subject>Interference</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Networks</subject><subject>Ranking</subject><subject>Search engines</subject><issn>1641-876X</issn><issn>2083-8492</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNpdjjtPwzAURi0EElXpymyJhcVw_YjtjlUFFKkSC0hs1bV90wQ1SYmd_095TEzf8B0dHcauJdwp4_w9djELBVILAKvO2EyB18KbpTpnM2mNFN7Z90u2yLkNIJ32lQQzY3bFOyrNkPhQ8zj0uYxTLG2_56UhXo_Y0feDPLUjxUKJ70c8NlfsosZDpsXfztnb48PreiO2L0_P69VWRG18ESEgRquVjs7UQRMkSYGUtCR_ErTyPqEJJqGqDMalS0gaQ_ARDBir5-z213sch8-Jctl1bY50OGBPw5R3srLupHIOTujNP_RjmMb-VLeTxnuQ3oDVX-eKVlI</recordid><startdate>20131201</startdate><enddate>20131201</enddate><creator>Hofuku, Ichiro</creator><creator>Oshima, Kunio</creator><general>De Gruyter Poland</general><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BYOGL</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PIMPY</scope><scope>PKEHL</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>S0W</scope></search><sort><creationdate>20131201</creationdate><title>A method of constructing the frame of a directed graph</title><author>Hofuku, Ichiro ; Oshima, Kunio</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c348t-bbaac6323c74fb3e0d1ebe216e1173853288da4b4da254ac97dae3abb8c040463</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Graph theory</topic><topic>Interference</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Networks</topic><topic>Ranking</topic><topic>Search engines</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hofuku, Ichiro</creatorcontrib><creatorcontrib>Oshima, Kunio</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest East Europe, Central Europe Database</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>ProQuest Engineering Database</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied &amp; Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering collection</collection><collection>ProQuest Central Basic</collection><collection>DELNET Engineering &amp; Technology Collection</collection><jtitle>International journal of applied mathematics and computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hofuku, Ichiro</au><au>Oshima, Kunio</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A method of constructing the frame of a directed graph</atitle><jtitle>International journal of applied mathematics and computer science</jtitle><date>2013-12-01</date><risdate>2013</risdate><volume>23</volume><issue>4</issue><spage>823</spage><epage>837</epage><pages>823-837</pages><issn>1641-876X</issn><eissn>2083-8492</eissn><abstract>In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The WorldWideWeb can be expressed as an enormous directed graph. The purpose of the present study is to provide tools for studying the web as a directed graph in order to find clues to the solution of the problem of interference from superfluous information, and to reform the directed graph to clarify the relationships between the nodes.</abstract><cop>Zielona Góra</cop><pub>De Gruyter Poland</pub><doi>10.2478/amcs-2013-0062</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1641-876X
ispartof International journal of applied mathematics and computer science, 2013-12, Vol.23 (4), p.823-837
issn 1641-876X
2083-8492
language eng
recordid cdi_proquest_miscellaneous_1567117770
source Freely Accessible Science Journals - check A-Z of ejournals; Publicly Available Content (ProQuest)
subjects Algorithms
Graph theory
Interference
Mathematical analysis
Mathematical models
Networks
Ranking
Search engines
title A method of constructing the frame of a directed graph
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-24T09%3A59%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20method%20of%20constructing%20the%20frame%20of%20a%20directed%20graph&rft.jtitle=International%20journal%20of%20applied%20mathematics%20and%20computer%20science&rft.au=Hofuku,%20Ichiro&rft.date=2013-12-01&rft.volume=23&rft.issue=4&rft.spage=823&rft.epage=837&rft.pages=823-837&rft.issn=1641-876X&rft.eissn=2083-8492&rft_id=info:doi/10.2478/amcs-2013-0062&rft_dat=%3Cproquest%3E1567117770%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c348t-bbaac6323c74fb3e0d1ebe216e1173853288da4b4da254ac97dae3abb8c040463%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1488018406&rft_id=info:pmid/&rfr_iscdi=true