Conference Paper

WebRank: A Hybrid Page Scoring Approach Based on Social Network Analysis.

Conference: Rough Set and Knowledge Technology - 5th International Conference, RSKT 2010, Beijing, China, October 15-17, 2010. Proceedings
Source: DBLP

ABSTRACT Applying the centrality measures from social network analysis to score web pages may well represent the essential role of pages and distribute their authorities in a web social network with complex link structures. To effectively score the pages, we propose a hybrid page scoring algorithm, called WebRank, based on the PageRank algorithm and three centrality measures including degree, betweenness, and closeness. The basis idea of WebRank is that: (1) use PageRank to accurately rank pages, and (2) apply centrality measures to compute the importance of pages in web social networks. In order to evaluate the performance of WebRank, we develop a web social network analysis system which can partition web pages into distinct groups and score them in an effective fashion. Experiments conducted on real data show that WebRank is effective at scoring web pages with less time deficiency than centrality measures based social network analysis algorithm and PageRank.

2 Followers
 · 
116 Views
  • [Show abstract] [Hide abstract]
    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.
    International Journal of Computational Intelligence Systems 12/1011; September 2011(Vol. 4):1012-1021. DOI:10.1080/18756891.2011.9727849 · 0.45 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: As the Web contains rich and convenient information, Web search engine is increasingly becoming the dominant information retrieving approach. In order to rank the query results of web pages in an effective and efficient fashion, we propose a new page rank algorithm based on similarity measure from the vector space model, called SimRank, to score web pages. Firstly, we propose a new similarity measure to compute the similarity of pages and apply it to partition a web database into several web social networks (WSNs). Secondly, we improve the traditional PageRank algorithm by taking into account the relevance of page to a given query. Thirdly, we design an efficient web crawler to download the web data. And finally, we perform experimental studies to evaluate the time efficiency and scoring accuracy of SimRank with other approaches.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Identifying key members from web-based social networks assists in assessing the risk of criminal network formation. To manage the uncertainty in complex web-based social networks, we first formally defined the binary relation and uncertainty of pages in web-based social networks. Secondly, we proposed an effective algorithm for Mining Key member from uncertain web-based social networks, called MiKey, by integrating uncertainty of pages into three centrality measures including degree, betweenness, and closeness. MiKey takes into a full consideration of the uncertainty in web-based social networks by computing the transition probability from one page to another. Furthermore, we briefly introduced the approach of calculating the k-order transition matrix of pages. Finally, we conducted experiments on real web data and the results show that MiKey is effective in discovering key pages from web-based social networks with less time deficiency than the centrality measures based algorithm.
    International Journal of Uncertainty Fuzziness and Knowledge-Based Systems 07/2012; 20(supp01). DOI:10.1142/S0218488512400119 · 0.62 Impact Factor