File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Find via
Supplementary
-
Citations:
- Appears in Collections:
Article: On Computing Prestige in a Network with Negative Relations
| Title | On Computing Prestige in a Network with Negative Relations |
|---|---|
| Authors | |
| Keywords | Markov chain Networks Prestige Negative Relations |
| Issue Date | 2005 |
| Publisher | Research 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? |
| Abstract | The 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 Identifier | http://hdl.handle.net/10722/75192 |
| ISSN |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Tai, AH | en_HK |
| dc.contributor.author | Ching, WK | en_HK |
| dc.contributor.author | Cheung, WS | en_HK |
| dc.date.accessioned | 2010-09-06T07:08:49Z | - |
| dc.date.available | 2010-09-06T07:08:49Z | - |
| dc.date.issued | 2005 | en_HK |
| dc.identifier.citation | International Journal of Applied Mathematical Sciences, 2005, v. 2 n. 1, p. 97-104 | en_HK |
| dc.identifier.issn | 0973-0176 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/75192 | - |
| dc.description.abstract | The 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.language | eng | en_HK |
| dc.publisher | Research India Publications. The Journal's web site is located at http://www.ripublication.com/jams.htm | - |
| dc.relation.ispartof | International Journal of Applied Mathematical Sciences | en_HK |
| dc.subject | Markov chain | - |
| dc.subject | Networks | - |
| dc.subject | Prestige | - |
| dc.subject | Negative Relations | - |
| dc.title | On Computing Prestige in a Network with Negative Relations | en_HK |
| dc.type | Article | en_HK |
| dc.identifier.email | Tai, AH: allenhtai@graduate.hku.hk | en_HK |
| dc.identifier.email | Ching, WK: wching@hkucc.hku.hk | en_HK |
| dc.identifier.email | Cheung, WS: wshun@graduate.hku.hk | en_HK |
| dc.identifier.authority | Ching, WK=rp00679 | en_HK |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.hkuros | 103858 | en_HK |
| dc.identifier.volume | 2 | - |
| dc.identifier.issue | 1 | - |
| dc.identifier.spage | 97 | - |
| dc.identifier.epage | 104 | - |
| dc.publisher.place | India | - |
| dc.identifier.issnl | 0973-0176 | - |