Sciweavers

17 search results - page 1 / 4
» Measuring extremal dependencies in web graphs
Sort
View
WWW
2008
ACM
14 years 5 months ago
Measuring extremal dependencies in web graphs
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...
Yana Volkovich, Nelly Litvak, Bert Zwart
COCOON
2007
Springer
13 years 11 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang
WWW
2010
ACM
13 years 12 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...
WAW
2010
Springer
231views Algorithms» more  WAW 2010»
13 years 2 months ago
Modeling Traffic on the Web Graph
Abstract. Analysis of aggregate and individual Web requests shows that PageRank is a poor predictor of traffic. We use empirical data to characterize properties of Web traffic not ...
Mark R. Meiss, Bruno Gonçalves, Jose J. Ram...
SAC
2010
ACM
13 years 11 months ago
Referrer graph: a low-cost web prediction algorithm
This paper presents the Referrer Graph (RG) web prediction algorithm as a low-cost solution to predict next web user accesses. RG is aimed at being used in a real web system with ...
B. de la Ossa, Ana Pont, Julio Sahuquillo, Jos&eac...