Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1080/18756891.2011.9727849 | INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS |
Keywords | Field | DocType |
uncertainty, web social network, PageRank, centrality measures | Network science,PageRank,HITS algorithm,Web page,Computer science,Social network analysis,Centrality,Betweenness centrality,Artificial intelligence,Network theory,Machine learning | Journal |
Volume | Issue | ISSN |
4 | 5 | 1875-6891 |
Citations | PageRank | References |
2 | 0.40 | 13 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shaojie Qiao | 1 | 201 | 25.93 |
| Tianrui Li | 2 | 3176 | 191.76 |
| Michael Chau | 3 | 1471 | 97.79 |
| Jing Peng | 4 | 27 | 1.91 |
| Yan Zhu | 5 | 5 | 5.19 |
| Hong Li | 6 | 119 | 16.81 |