2100 search results - page 150 / 420 » Learning to rank on graphs |
150
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
161
click to vote
ACL
2010
15 years 4 months ago
2010
The translation of sentiment information is a task from which sentiment analysis systems can benefit. We present a novel, graph-based approach using SimRank, a well-established ve...
170
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
158
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
175
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...