180 search results - page 29 / 36 » Learning random walks to rank nodes in graphs |
COMAD
2009
13 years 8 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
The goal of semi-supervised learning (SSL) methods is to reduce the amount of labeled training data required by learning from both labeled and unlabeled instances. Macskassy and Pr...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...