Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints

Ehsan Kazemi 0001, Morteza Zadimoghaddam, Amin Karbasi. Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints. In Jennifer G. Dy, Andreas Krause 0001, editors, Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsmässan, Stockholm, Sweden, July 10-15, 2018. Volume 80 of JMLR Workshop and Conference Proceedings, pages 2549-2558, JMLR.org, 2018. [doi]

@inproceedings{0001ZK18,
  title = {Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints},
  author = {Ehsan Kazemi 0001 and Morteza Zadimoghaddam and Amin Karbasi},
  year = {2018},
  url = {http://proceedings.mlr.press/v80/kazemi18a.html},
  researchr = {https://researchr.org/publication/0001ZK18},
  cites = {0},
  citedby = {0},
  pages = {2549-2558},
  booktitle = {Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsmässan, Stockholm, Sweden, July 10-15, 2018},
  editor = {Jennifer G. Dy and Andreas Krause 0001},
  volume = {80},
  series = {JMLR Workshop and Conference Proceedings},
  publisher = {JMLR.org},
}