A review on ranking problems in statistical learning
원문 초록
Ranking problems, also known as preference learning problems, define a widely spread class of statistical learning problems with many applications, including fraud detection, document ranking, medicine, credit risk screening, image ranking or media memorability. In this article, we systematically review different types of instance ranking problems, i.e., ranking problems that require the prediction of an order of the response variables, and the corresponding loss functions resp. goodness criteria. We discuss the difficulties when trying to optimize those criteria. As for a detailed and comprehensive overview of existing machine learning techniques to solve such ranking problems, we systemize existing techniques and recapitulate the corresponding optimization problems in a unified notation. We also discuss to which of the ranking problems the respective algorithms are tailored and identify their strengths and limitations. Computational aspects and open research problems are also considered.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Precise Zero-Shot Pointwise Ranking with LLMs through Post-Aggregated Global Context Information
EDINET-Bench: Evaluating LLMs on Complex Financial Tasks using Japanese Financial Statements
GARG-AML against Smurfing: A Scalable and Interpretable Graph-Based Framework for Anti-Money Laundering
AD-AGENT: A Multi-agent Framework for End-to-end Anomaly Detection
Cyber Security Data Science: Machine Learning Methods and their Performance on Imbalanced Datasets
Federated Spectral Graph Transformers Meet Neural Ordinary Differential Equations for Non-IID Graphs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.