Sciweavers

860 search results - page 112 / 172
» Biased Random Walks
Sort
View
NIPS
2007
14 years 11 months ago
Semi-Supervised Multitask Learning
A semi-supervised multitask learning (MTL) framework is presented, in which M parameterized semi-supervised classifiers, each associated with one of M partially labeled data mani...
Qiuhua Liu, Xuejun Liao, Lawrence Carin
NIPS
2004
14 years 11 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
NIPS
2003
14 years 11 months ago
Ranking on Data Manifolds
The Google search engine has enjoyed huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks....
Dengyong Zhou, Jason Weston, Arthur Gretton, Olivi...
TREC
2007
14 years 11 months ago
University of Twente at the TREC 2007 Enterprise Track: Modeling Relevance Propagation for the Expert Search Task
This paper describes several approaches which we used for the expert search task of the TREC 2007 Enterprise track. We studied several methods of relevance propagation from docume...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 10 months ago
Local Information Based Algorithms for Packet Transport in Complex Networks
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
Bernard Kujawski, G. J. Rodgers, Bosiljka Tadic