Sciweavers

2018 search results - page 116 / 404
» Magnitude-preserving ranking algorithms
Sort
View
WWW
2010
ACM
16 years 1 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...
SIGIR
2009
ACM
16 years 25 days ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
WIDM
2005
ACM
15 years 12 months ago
DirectoryRank: ordering pages in web directories
Web Directories are repositories of Web pages organized in a hierarchy of topics and sub-topics. In this paper, we present DirectoryRank, a ranking framework that orders the pages...
Vlassis Krikos, Sofia Stamou, Pavlos Kokosis, Alex...
VLDB
1997
ACM
80views Database» more  VLDB 1997»
15 years 10 months ago
Merging Ranks from Heterogeneous Internet Sources
Many sources on the Internet and elsewhere rank the objects in query results according to how well these objects match the original query. For example, a real-estate agent might r...
Luis Gravano, Hector Garcia-Molina
CEC
2005
IEEE
15 years 8 months ago
Rank and proximity based crossover (RPC) to improve convergence in genetic search
A new crossover technique, we named Rank and Proximity Based Crossover (RPC), to improve the speed and quality of solutions in Genetic search, is proposed. In the proposed strategy...
Goutam Chakraborty, Basabi Chakraborty