MAXIMIZATION

作品数：204被引量：172H指数：5
导出分析报告
相关领域：自动化与计算机技术更多>>
相关作者：王佳丁洁丽官小平郭小卫王宏琦更多>>
相关机构：武汉大学清华大学北京东方泰坦科技股份有限公司中国科学院研究生院更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划国家高技术研究发展计划高等学校学科创新引智计划更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Frontiers of Computer Sciencex
共 条 记 录，以下是1-4
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Robust AUC maximization for classification with pairwise confidence comparisons
《Frontiers of Computer Science》2024年第4期73-83,共11页Haochen SHI Mingkun XIE Shengjun HUANG 
Natural Science Foundation of Jiangsu Province,China(BK20222012,BK20211517);National Key R&D Program of China(2020AAA0107000);National Natural Science Foundation of China(Grant No.62222605)。
Supervised learning often requires a large number of labeled examples,which has become a critical bottleneck in the case that manual annotating the class labels is costly.To mitigate this issue,a new framework called ...
关键词：method pairwise WEAKLY 
Max-difference maximization criterion: a feature selection method for text categorization
《Frontiers of Computer Science》2023年第1期237-239,共3页Lingbin JIN Li ZHANG Lei ZHAO 
supported in part by the Natural Science Foundation of the Jiangsu Higher Education Institutions of China(19KJA550002).
1 IntroductionText categorization methods based on machine learning always encounter the curse of dimensionality. Therefore, it is crucial to perform feature selection to reduce dimensionality of text vectors. Methods...
关键词：dimensionality DIFFERENCE CRITERION 
Optimal bundles for sponsored search auctions via bracketing scheme
《Frontiers of Computer Science》2019年第2期333-342,共10页Zheng-Dong XIA Tian-Ming BU Wen-Hui GONG 
the National Natural Science Foundation of China (Grant No. 61672012).
Sponsored search auction has been recently studied and auctioneer's revenue is an important consideration in probabilistic single-item second-price auctions. Some papers have analyzed the revenue maximization problem ...
关键词：sponsored search AUCTION REVENUE MAXIMIZATION bracketing SCHEME NP-HARDNESS 
Optimizing top-k retrieval： submodularity analysis and search strategies被引量：1
《Frontiers of Computer Science》2016年第3期477-487,共11页Chaofeng SHA Keqiang WANG Dell ZHANG Xiaoling WANG Aoying ZHOU 
This work was supported by the National Natural Science Foundation of China （Grant Nos. 61572135 and 61170085）, 973 project （2010CB328106）, Program for New Century Excellent Talents in China （NCET-10-0388）.
The key issue in top-k retrieval, finding a set of k documents （from a large document collection） that can best answer a user＇s query, is to strike the optimal balance between relevance and diversity. In this paper...
关键词：top-k retrieval DIVERSIFICATION submodular function maximization 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部