Sciweavers

292 search results - page 23 / 59
» Scaling properties of the Internet graph
Sort
View
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
CVPR
2010
IEEE
14 years 3 months ago
Image Webs: Computing and Exploiting Connectivity in Image Collections
The widespread availability of digital cameras and ubiquitous Internet access have facilitated the creation of massive image collections. These collections can be highly interconn...
Kyle Heath
WWW
2007
ACM
14 years 8 months ago
Web projections: learning from contextual subgraphs of the web
Graphical relationships among web pages have been leveraged as sources of information in methods for ranking search results. To date, specific graphical properties have been used ...
Jure Leskovec, Susan T. Dumais, Eric Horvitz
COLING
1996
13 years 9 months ago
Distributedness and Non-Linearity of LOLITA's Semantic Network
'Phis paper describes SemNet the internal Knowledge t{epresentation lbr LOLI'I'A I. LOMTA is a large scale Natural Language Engineering (NLE) system. As such the in...
S. Short, Simon Shiu, Roberto Garigliano
WEBI
2005
Springer
14 years 1 months ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...