Sciweavers

4972 search results - page 7 / 995
» Ranking on graph data
Sort
View
SBP
2011
Springer
14 years 4 months ago
Ranking Information in Networks
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
Tina Eliassi-Rad, Keith Henderson
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
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
15 years 4 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta
SEMWEB
2009
Springer
15 years 4 months ago
Using Naming Authority to Rank Data and Ontologies for Web Search
Abstract. The focus of web search is moving away from returning relevant documents towards returning structured data as results to user queries. A vital part in the architecture of...
Andreas Harth, Sheila Kinsella, Stefan Decker
WWW
2010
ACM
15 years 4 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...