Corpus ID: 49296171

Tight Bound of Incremental Cover Trees for Dynamic Diversification

@article{Marienwald2018TightBO,
  title={Tight Bound of Incremental Cover Trees for Dynamic Diversification},
  author={Hannah Marienwald and Wikor Pronobis and Klaus-Robert M{\"u}ller and Shinichi Nakajima},
  journal={ArXiv},
  year={2018},
  volume={abs/1806.06126}
}
  • Hannah Marienwald, Wikor Pronobis, +1 author Shinichi Nakajima
  • Published in ArXiv 2018
  • Mathematics, Computer Science
  • Dynamic diversification---finding a set of data points with maximum diversity from a time-dependent sample pool---is an important task in recommender systems, web search, database search, and notification services, to avoid showing users duplicate or very similar items. The incremental cover tree (ICT) with high computational efficiency and flexibility has been applied to this task, and shown good performance. Specifically, it was empirically observed that ICT typically provides a set with its… CONTINUE READING
    3
    Twitter Mentions

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 19 REFERENCES

    Plug & Play Generative Networks: Conditional Iterative Generation of Images in Latent Space

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Diverse Set Selection Over Dynamic Data

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    The discrete p-dispersion problem

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Faster cover trees

    VIEW 1 EXCERPT

    On query result diversification

    VIEW 2 EXCERPTS

    The Design of Approximation Algorithms

    VIEW 2 EXCERPTS