Sciweavers

611 search results - page 43 / 123
» Random web crawls
Sort
View
WWW
2007
ACM
15 years 10 months ago
Optimizing web search using social annotations
This paper explores the use of social annotations to improve web search. Nowadays, many services, e.g. del.icio.us, have been developed for web users to organize and share their f...
Shenghua Bao, Gui-Rong Xue, Xiaoyuan Wu, Yong Yu, ...
WIDM
2006
ACM
15 years 3 months ago
Coarse-grained classification of web sites by their structural properties
In this paper, we identify and analyze structural properties which reflect the functionality of a Web site. These structural properties consider the size, the organization, the co...
Christoph Lindemann, Lars Littig
JSCIC
2010
104views more  JSCIC 2010»
14 years 4 months ago
The Kemeny Constant for Finite Homogeneous Ergodic Markov Chains
A quantity known as the Kemeny constant, which is used to measure the expected number of links that a surfer on the World Wide Web, located on a random web page, needs to follow b...
M. Catral, Stephen J. Kirkland, M. Neumann, N.-S. ...
IJCNN
2006
IEEE
15 years 3 months ago
Predictive Random Graph Ranking on the Web
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
Haixuan Yang, Irwin King, Michael R. Lyu
WWW
2005
ACM
15 years 10 months ago
Predictive ranking: a novel page ranking approach by estimating the web structure
PageRank (PR) is one of the most popular ways to rank web pages. However, as the Web continues to grow in volume, it is becoming more and more difficult to crawl all the available...
Haixuan Yang, Irwin King, Michael R. Lyu