tight: a new support vector method for optimizing partial AUC based on a tight convex upper bound

Harikrishna Narasimhan, Shivani Agarwal. tight: a new support vector method for optimizing partial AUC based on a tight convex upper bound. In Inderjit S. Dhillon, Yehuda Koren, Rayid Ghani, Ted E. Senator, Paul Bradley, Rajesh Parekh, Jingrui He, Robert L. Grossman, Ramasamy Uthurusamy, editors, The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2013, Chicago, IL, USA, August 11-14, 2013. pages 167-175, ACM, 2013. [doi]

@inproceedings{NarasimhanA13,
  title = {tight: a new support vector method for optimizing partial AUC based on a tight convex upper bound},
  author = {Harikrishna Narasimhan and Shivani Agarwal},
  year = {2013},
  doi = {10.1145/2487575.2487674},
  url = {http://doi.acm.org/10.1145/2487575.2487674},
  researchr = {https://researchr.org/publication/NarasimhanA13},
  cites = {0},
  citedby = {0},
  pages = {167-175},
  booktitle = {The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2013, Chicago, IL, USA, August 11-14, 2013},
  editor = {Inderjit S. Dhillon and Yehuda Koren and Rayid Ghani and Ted E. Senator and Paul Bradley and Rajesh Parekh and Jingrui He and Robert L. Grossman and Ramasamy Uthurusamy},
  publisher = {ACM},
  isbn = {978-1-4503-2174-7},
}