Active search on graphs

@inproceedings{Wang2013ActiveSO,
  title={Active search on graphs},
  author={Xuezhi Wang and Roman Garnett and Jeff G. Schneider},
  booktitle={KDD},
  year={2013}
}
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 as possible. Numerous real-world applications may be approached in this manner, including fraud detection, product recommendation, and drug discovery. Active search has model learning and exploration/exploitation features similar to those encountered in active learning and bandit problems, but algorithms for those problems do not fit active… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 23 CITATIONS

Active Transfer Learning

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Efficient Nonmyopic Active Search

VIEW 4 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS

Applications of Sampling and Estimation on Networks

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Active Search with Complex Actions and Rewards

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Overcoming uncertainty for within-network relational machine learning

VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Active Learning on Heterogeneous Information Networks: A Multi-armed Bandit Approach

  • 2018 IEEE International Conference on Data Mining (ICDM)
  • 2018
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.