Bipartite ranking is a fundamental ranking problem that learns to order relevant instances ahead of irrelevant ones. The pair-wise approach for bi-partite ranking construct a quadratic number of pairs to solve the problem, which is infeasible for large-scale data sets. The point-wise approach, albeit more efficient, often results in inferior performance. That is, it is difficult to conduct bipartite ranking accurately and efficiently at the same time. In this paper, we develop a novel active sampling scheme within the pair-wise approach to conduct bipartite ranking efficiently. The scheme is inspired from active learning and can reach a competitive ranking performance while focusing only on a small subset of the many pairs during training. Moreover, we propose a general Combined Ranking and Classification (CRC) framework to accurately conduct bipartite ranking. The framework unifies point-wise and pair-wise approaches and is simply based on the idea of treating each instance point as a pseudo-pair. Experiments on 14 real-word large-scale data sets demonstrate that the proposed algorithm of Active Sampling within CRC, when coupled with a linear Support Vector Machine, usually outperforms state-of-the-art point-wise and pair-wise ranking approaches in terms of both accuracy and efficiency.
Colorado State University(科罗拉多州立大学);Fort Collins, USA(美国科罗拉多州科林斯堡(此处仅作说明,按要求机构粒度为大学级别,原机构为Colorado State University,Fort Collins, USA是其所在城市和国家,按要求提取到大学级别即可,故主要机构为Colorado State University,Fort Collins, USA作为补充说明,但严格按要求,机构名称应为Colorado State University,Fort Collins, USA?但根据示例,原机构是Colorado State University, Fort Collins, USA,所以正确提取应为:{)
Surrogate Regret Bounds for Bipartite Ranking via Strongly Proper Losses
Indian Institute of Science(印度科学学院)
二分排名问题,其中实例被标记为正面或负面,目标是学习一个评分函数,该函数最大限度地减少对一对正面和负面实例的错误排名概率(或等效地,最大化ROC曲线下的面积),近年来已被广泛研究。一个占主导地位的理论和算法框架的问题已经减少二分排名成对分类,特别是,它是众所周知的,二分排名遗憾可以制定成对分类遗憾,这反过来又可以使用通常的遗憾界分类问题的上限。最近,Kotlowski et al.(2011)根据与标准(非成对)逻辑和指数损失的平衡版本相关的遗憾,显示了二分排序的遗憾界限。在本文中,我们表明,这种(非成对)代理遗憾界的二分排名可以得到一个广泛的类适当的(复合)损失,我们的术语作为强适当的。我们的证明技术比Kotlowski等人(2011)简单得多,并且依赖于Reid和Williamson(2010,2011)和其他人最近阐明的适当(复合)损失的性质。我们的结果产生明确的代理边界(没有隐藏的平衡条款)在各种强适当的损失,包括例如逻辑,指数,平方和平方铰链损失的特殊情况。我们还通过Clemencon和Robbiano(2011)的最新结果在某些低噪声条件下获得了更紧密的代理边界。
Addressing Class-Imbalance Problem in Personalized Ranking
King Abdullah University of Science and Technology(阿卜杜拉国王科技大学);Brandeis University(布兰迪斯大学);Sun Yat-Sen University(中山大学);Yahoo Research(雅虎研究院);University of Notre Dame(圣母大学)
Bipartite Graph Variational Auto-Encoder with Fair Latent Representation to Account for Sampling Bias in Ecological Networks
agroparistech(巴黎农业学院);MNHN, CNRS, SU(法国国家自然博物馆、国家科学研究中心、苏弗尔(SU));Sorbonne Université, CNRS, IRD, INRAE, Université Paris Est Créteil, Université Paris Cité, Institute of Ecology and Environmental Sciences (iEES-Paris)(索邦大学、国家科学研究中心、国际发展研究所、法国国家农业食品研究咨询中心、巴黎东部大学、巴黎城市大学、生态与环境科学研究所(iEES-巴黎))
DBGL: Decay-aware Bipartite Graph Learning for Irregular Medical Time Series Classification
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong, China(香港大学电子与电气工程系);Shenzhen MSU-BIT University, China(深圳MSU-BIT大学);Department of Data Science, City University of Hong Kong, China(香港城市大学数据科学系);Engineering Research Centre of Applied Technology on Machine Translation and Artificial Intelligence, Macao Polytechnic University(澳门理工大学机器翻译与人工智能应用技术研究中心)
FastUMAP: Scalable Dimensionality Reduction via Bipartite Landmark Sampling
School of Life Science and Technology, Institute of Science Tokyo(生命科学与技术学院,科学东京研究所);Department of Computational Biology and Medical Sciences, Graduate School of Frontier Sciences(计算生物学与医学科学系,前沿科学研究生院)
Statistical Significance of Feature Importance Rankings
Department of Statistics University of California, Berkeley(统计学系加州大学伯克利分校);Department of Statistics and Data Science University of Pennsylvania(统计学与数据科学系宾夕法尼亚大学)
本文针对特征重要性排名因随机采样而不稳定的问题,提出基于假设检验的验证方法和两种高效采样算法,能以超过 1-α 的概率正确识别前 K 个重要特征及其顺序,并在 SHAP 和 LIME 上验证了有效性。
Attention Down-Sampling Transformer, Relative Ranking and Self-Consistency for Blind Image Quality Assessment
King Fahd University of Petroleum and Minerals(法赫德国王石油与矿业大学);SDAIA-KFUPM Joint Research Center for Artificial Intelligence(沙特数据与人工智能局-法赫德国王石油与矿业大学人工智能联合研究中心)