SVM pAUC tight-Reference-Cited by-同舟云学术

SVM pAUC tight

Published:2013-08-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
language:
Short-container-title:

Author:

Narasimhan Harikrishna¹,Agarwal Shivani¹

Affiliation:

1. Indian Institute of Science, Bangalore, India

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2487575.2487674

Reference34 articles.

1. The Infinite Push: A New Support Vector Ranking Algorithm that Directly Optimizes Accuracy at the Absolute Top of the List

2. Ranking Chemical Structures for Drug Discovery: A New Machine Learning Approach

3. Sequential Alternating Proximal Method for Scalable Sparse Structural SVMs

4. D. P. Bertsekas. Nonlinear Programming. Athena Scientific Belmont MA 1999. D. P. Bertsekas. Nonlinear Programming. Athena Scientific Belmont MA 1999.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Weakly Supervised AUC Optimization: A Unified Partial AUC Approach;IEEE Transactions on Pattern Analysis and Machine Intelligence;2024-07

2. Lower-Left Partial AUC: An Effective and Efficient Optimization Metric for Recommendation;Proceedings of the ACM Web Conference 2024;2024-05-13

3. Malicious Log Detection Using Machine Learning to Maximize the Partial AUC;2024 IEEE 21st Consumer Communications & Networking Conference (CCNC);2024-01-06

4. Rank-based Decomposable Losses in Machine Learning: A Survey;IEEE Transactions on Pattern Analysis and Machine Intelligence;2023

5. AUC Maximization in the Era of Big Data and AI: A Survey;ACM Computing Surveys;2022-12-23