Sciweavers

180 search results - page 20 / 36
» Learning random walks to rank nodes in graphs
Sort
View
IM
2007
13 years 7 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
WWW
2009
ACM
14 years 8 months ago
Tag ranking
Social media sharing web sites like Flickr allow users to annotate images with free tags, which significantly facilitate Web image search and organization. However, the tags assoc...
Dong Liu, Xian-Sheng Hua, Linjun Yang, Meng Wang, ...
ICML
2003
IEEE
14 years 8 months ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty
ECCV
2006
Springer
14 years 9 months ago
Robust Multi-body Motion Tracking Using Commute Time Clustering
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
Huaijun Qiu, Edwin R. Hancock
WWW
2010
ACM
14 years 2 months ago
SourceRank: relevance and trust assessment for deep web sources based on inter-source agreement
We consider the problem of deep web source selection and argue that existing source selection methods are inadequate as they are based on local similarity assessment. Specificall...
Raju Balakrishnan, Subbarao Kambhampati