Sciweavers

2100 search results - page 40 / 420
» Learning to rank on graphs
Sort
View
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
15 years 10 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
WAW
2007
Springer
133views Algorithms» more  WAW 2007»
15 years 3 months ago
Distribution of PageRank Mass Among Principle Components of the Web
We study the PageRank mass of principal components in a bow-tie Web Graph, as a function of the damping factor c. Using a singular perturbation approach, we show that the PageRank ...
Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham
COCOON
2009
Springer
15 years 4 months ago
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
Enoch Peserico, Luca Pretto
CIIA
2009
14 years 10 months ago
Ontology-Driven Method for Ranking Unexpected Rules
Several rule discovery algorithms have the disadvantage to discover too much patterns sometimes obvious, useless or not very interesting to the user. In this paper we propose a new...
Mohamed Said Hamani, Ramdane Maamri
ICICS
2007
Springer
15 years 3 months ago
Application of the PageRank Algorithm to Alarm Graphs
James J. Treinen, Ramakrishna Thurimella