Sciweavers

45 search results - page 2 / 9
» Using a Layered Markov Model for Distributed Web Ranking Com...
Sort
View
WWW
2011
ACM
12 years 12 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
CIKM
2009
Springer
13 years 11 months ago
A general markov framework for page importance computation
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...
CSDA
2011
12 years 12 months ago
Approximate forward-backward algorithm for a switching linear Gaussian model
Motivated by the application of seismic inversion in the petroleum industry we consider a hidden Markov model with two hidden layers. The bottom layer is a Markov chain and given ...
Hugo Hammer, Håkon Tjelmeland
ITA
2006
163views Communications» more  ITA 2006»
13 years 4 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
ICCSA
2009
Springer
13 years 11 months ago
Learning and Predicting Key Web Navigation Patterns Using Bayesian Models
Abstract. The accurate prediction of Web navigation patterns has immense commercial value as the Web evolves into a primary medium for marketing and sales for many businesses. Ofte...
Malik Tahir Hassan, Khurum Nazir Junejo, Asim Kari...