File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1080/18756891.2011.9727849
- Scopus: eid_2-s2.0-84857451347
- WOS: WOS:000297797300024
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: WebScore: An Effective Page Scoring Approach for Uncertain Web Social Networks
Title | WebScore: An Effective Page Scoring Approach for Uncertain Web Social Networks |
---|---|
Authors | |
Keywords | centrality measures PageRank uncertainty web social network |
Issue Date | 2011 |
Publisher | Atlantis Press. The Journal's web site is located at http://www.atlantis-press.com/publications/ijcis/ |
Citation | International Journal Of Computational Intelligence Systems, 2011, v. 4 n. 5, p. 1012-1021 How to Cite? |
Abstract | To effectively score pages with uncertainty in web social networks, we first proposed a new concept called transition probability matrix and formally defined the uncertainty in web social networks. Second, we proposed a hybrid page scoring algorithm, called WebScore, based on the PageRank algorithm and three centrality measures including degree, betweenness, and closeness. Particularly, WebScore takes into a full consideration of the uncertainty of web social networks by computing the transition probability from one page to another. The basic idea of WebScore is to: (1) integrate uncertainty into PageRank in order to accurately rank pages, and (2) apply the centrality measures to calculate the importance of pages in web social networks. In order to verify the performance of WebScore, we developed a web social network analysis system which can partition web pages into distinct groups and score them in an effective fashion. Finally, we conducted extensive experiments on real data and the results show that WebScore is effective at scoring uncertain pages with less time deficiency than PageRank and centrality measures based page scoring algorithms. © 2011 Copyright Taylor and Francis Group, LLC. |
Persistent Identifier | http://hdl.handle.net/10722/164737 |
ISSN | 2023 Impact Factor: 2.5 2023 SCImago Journal Rankings: 0.564 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Qiao, S | en_HK |
dc.contributor.author | Li, T | en_HK |
dc.contributor.author | Chau, M | en_HK |
dc.contributor.author | Peng, J | en_HK |
dc.contributor.author | Zhu, Y | en_HK |
dc.contributor.author | Li, H | en_HK |
dc.date.accessioned | 2012-09-20T08:08:59Z | - |
dc.date.available | 2012-09-20T08:08:59Z | - |
dc.date.issued | 2011 | en_HK |
dc.identifier.citation | International Journal Of Computational Intelligence Systems, 2011, v. 4 n. 5, p. 1012-1021 | en_HK |
dc.identifier.issn | 1875-6891 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/164737 | - |
dc.description.abstract | To effectively score pages with uncertainty in web social networks, we first proposed a new concept called transition probability matrix and formally defined the uncertainty in web social networks. Second, we proposed a hybrid page scoring algorithm, called WebScore, based on the PageRank algorithm and three centrality measures including degree, betweenness, and closeness. Particularly, WebScore takes into a full consideration of the uncertainty of web social networks by computing the transition probability from one page to another. The basic idea of WebScore is to: (1) integrate uncertainty into PageRank in order to accurately rank pages, and (2) apply the centrality measures to calculate the importance of pages in web social networks. In order to verify the performance of WebScore, we developed a web social network analysis system which can partition web pages into distinct groups and score them in an effective fashion. Finally, we conducted extensive experiments on real data and the results show that WebScore is effective at scoring uncertain pages with less time deficiency than PageRank and centrality measures based page scoring algorithms. © 2011 Copyright Taylor and Francis Group, LLC. | en_HK |
dc.language | eng | en_US |
dc.publisher | Atlantis Press. The Journal's web site is located at http://www.atlantis-press.com/publications/ijcis/ | - |
dc.relation.ispartof | International Journal of Computational Intelligence Systems | en_HK |
dc.subject | centrality measures | en_HK |
dc.subject | PageRank | en_HK |
dc.subject | uncertainty | en_HK |
dc.subject | web social network | en_HK |
dc.title | WebScore: An Effective Page Scoring Approach for Uncertain Web Social Networks | en_HK |
dc.type | Article | en_HK |
dc.identifier.email | Chau, M: mchau@hkucc.hku.hk | en_HK |
dc.identifier.authority | Chau, M=rp01051 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1080/18756891.2011.9727849 | en_HK |
dc.identifier.scopus | eid_2-s2.0-84857451347 | en_HK |
dc.identifier.hkuros | 207065 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-84857451347&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 4 | en_HK |
dc.identifier.issue | 5 | en_HK |
dc.identifier.spage | 1012 | en_HK |
dc.identifier.epage | 1021 | en_HK |
dc.identifier.isi | WOS:000297797300024 | - |
dc.publisher.place | France | - |
dc.identifier.scopusauthorid | Qiao, S=16205409900 | en_HK |
dc.identifier.scopusauthorid | Li, T=7406372548 | en_HK |
dc.identifier.scopusauthorid | Chau, M=7006073763 | en_HK |
dc.identifier.scopusauthorid | Peng, J=7401958564 | en_HK |
dc.identifier.scopusauthorid | Zhu, Y=8921604000 | en_HK |
dc.identifier.scopusauthorid | Li, H=36656039500 | en_HK |
dc.identifier.issnl | 1875-6883 | - |