File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
  • Find via Find It@HKUL
Supplementary

Article: On Computing Prestige in a Network with Negative Relations

TitleOn Computing Prestige in a Network with Negative Relations
Authors
KeywordsMarkov chain
Networks
Prestige
Negative Relations
Issue Date2005
PublisherResearch India Publications. The Journal's web site is located at http://www.ripublication.com/jams.htm
Citation
International Journal of Applied Mathematical Sciences, 2005, v. 2 n. 1, p. 97-104 How to Cite?
AbstractThe computation of network prestige is an important issue in studying networks such as the Internet and social networks. A number of iterative methods have been proposed for the measurement of prestige of symmetric or asymmetric network. The PageRank algorithm has been successfully applied in the computation of ranking of webpages and data mining in the Internet. In this paper, we propose a revised PageRank algorithm for the computation of prestige of a general networks and extend it to handle the case of negative relations.
Persistent Identifierhttp://hdl.handle.net/10722/75192
ISSN

 

DC FieldValueLanguage
dc.contributor.authorTai, AHen_HK
dc.contributor.authorChing, WKen_HK
dc.contributor.authorCheung, WSen_HK
dc.date.accessioned2010-09-06T07:08:49Z-
dc.date.available2010-09-06T07:08:49Z-
dc.date.issued2005en_HK
dc.identifier.citationInternational Journal of Applied Mathematical Sciences, 2005, v. 2 n. 1, p. 97-104en_HK
dc.identifier.issn0973-0176-
dc.identifier.urihttp://hdl.handle.net/10722/75192-
dc.description.abstractThe computation of network prestige is an important issue in studying networks such as the Internet and social networks. A number of iterative methods have been proposed for the measurement of prestige of symmetric or asymmetric network. The PageRank algorithm has been successfully applied in the computation of ranking of webpages and data mining in the Internet. In this paper, we propose a revised PageRank algorithm for the computation of prestige of a general networks and extend it to handle the case of negative relations.-
dc.languageengen_HK
dc.publisherResearch India Publications. The Journal's web site is located at http://www.ripublication.com/jams.htm-
dc.relation.ispartofInternational Journal of Applied Mathematical Sciencesen_HK
dc.subjectMarkov chain-
dc.subjectNetworks-
dc.subjectPrestige-
dc.subjectNegative Relations-
dc.titleOn Computing Prestige in a Network with Negative Relationsen_HK
dc.typeArticleen_HK
dc.identifier.emailTai, AH: allenhtai@graduate.hku.hken_HK
dc.identifier.emailChing, WK: wching@hkucc.hku.hken_HK
dc.identifier.emailCheung, WS: wshun@graduate.hku.hken_HK
dc.identifier.authorityChing, WK=rp00679en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.hkuros103858en_HK
dc.identifier.volume2-
dc.identifier.issue1-
dc.identifier.spage97-
dc.identifier.epage104-
dc.publisher.placeIndia-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats