Sciweavers

2100 search results - page 44 / 420
» Learning to rank on graphs
Sort
View
WWW
2005
ACM
15 years 10 months ago
PageRank as a function of the damping factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
DATAMINE
2006
139views more  DATAMINE 2006»
14 years 9 months ago
VizRank: Data Visualization Guided by Machine Learning
Data visualization plays a crucial role in identifying interesting patterns in exploratory data analysis. Its use is, however, made difficult by the large number of possible data p...
Gregor Leban, Blaz Zupan, Gaj Vidmar, Ivan Bratko
EJC
2010
14 years 9 months ago
Some graphs related to the small Mathieu groups
Two different constructions are given of a rank 8 arc-transitive graph with 165 vertices and valency 8, whose automorphism group
Alice Devillers, Michael Giudici, Cai Heng Li, Che...
CISS
2008
IEEE
15 years 4 months ago
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
Peter Marbach
WEBI
2010
Springer
14 years 7 months ago
How to Improve Your Google Ranking: Myths and Reality
Abstract--Search engines have greatly influenced the way people access information on the Internet as such engines provide the preferred entry point to billions of pages on the Web...
Ao-Jan Su, Y. Charlie Hu, Aleksandar Kuzmanovic, C...