Aug 11, 2013 · Inspired by the success of myopic methods for active learning and bandit problems, we propose a myopic method for active search on graphs.
People also ask
What are the search techniques for graphs?
What is a graph search?
What is the best graph search algorithm?
How can you tell the difference between a search tree and a search graph?
We consider active search on graphs, where the nodes represent the set of instances users want to search over and the edges encode pairwise similarity among ...
We test the proposed algorithm empirically on real-world graphs and show that it outperforms popular approaches for active learning and bandit problems as well ...
Active search is an increasingly important learning problem in which we use a limited budget of label queries to discover as many members of a certain class ...
Active Search is an emerging paradigm that helps users quickly find relevant information by efficiently collecting and learning from user feedback. We consider ...
Active search is an increasingly important learning problem in which we use a limited budget of label queries to discover as many members of a certain class ...
Active Search is an emerging paradigm that helps users quickly find relevant information by efficiently collecting and learning from user feedback. We consider ...
This work relates the active search setting to multi-armed bandits whose rewards are binary values indicating search hits or misses and arms cannot be ...
In this paper, we consider the problem of Active Search where we are given a similarity function between data points. Information Retrieval · Retrieval. 1.
... Active search [12, 13] refers to the task of efficiently discovering members of a desired class (targets) by making online sequential adaptive data ...