MEDIAN

作品数：316被引量：399H指数：9
导出分析报告
相关领域：医药卫生更多>>
相关作者：郑广寰王守强林锦贤肖进杰朱大铭更多>>
相关机构：中国科学院山东大学福州大学中国环境科学研究院更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划中国博士后科学基金国家教育部博士点基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Science China（Information Sciences）x
共 条 记 录，以下是1-5
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
An approximation algorithm for lower-bounded k-median with constant factor被引量：1
《Science China(Information Sciences)》2022年第4期89-97,共9页Xiaoliang WU Feng SHI Yutian GUO Zhen ZHANG Junyu HUANG Jianxin WANG 
supported by National Natural Science Foundation of China(Grant Nos.61872450,62172446,61802441).
The lower-bounded k-median problem plays a key role in many applications related to privacy protection, which requires that the amount of assigned client to each facility should not be less than the requirement. Unfor...
关键词：approximation algorithm k-median lower-bounded k-median 
On the robustness of median sampling in noisy evolutionary optimization被引量：1
《Science China(Information Sciences)》2021年第5期28-40,共13页Chao BIAN Chao QIAN Yang YU Ke TANG 
supported by National Key Research and Development Program of China(Grant No.2017YFB1003102);National Natural Science Foundation of China(Grant Nos.62022039,61672478,61876077);MOE University Scientific-Technological Innovation Plan Program。
Evolutionary algorithms(EAs)are a sort of nature-inspired metaheuristics,which have wide applications in various practical optimization problems.In these problems,objective evaluations are usually inaccurate,because n...
关键词：evolutionary algorithms noisy optimization median sampling computational complexity runtime analysis 
An approximation algorithm for k-median with priorities被引量：2
《Science China(Information Sciences)》2021年第5期41-42,共2页Zhen ZHANG Qilong FENG Jinhui XU Jianxin WANG 
supported by National Natural Science Foundation of China(Grant Nos.61872450,61672536,61828205,61802441,71631008);Hunan Provincial Key Lab on Bioinformatics,and Hunan Provincial Science and Technology Program(Grant No.2018WK4001)。
Dear editor,Clustering is a fundamental problem in computer science.This problem is to partition a given set of clients into several clusters such that clients in the same cluster are more similar to each other.In man...
关键词：CLIENT EDITOR SERVICES 
Robust low-rank tensor factorization by cyclic weighted median
《Science China(Information Sciences)》2015年第5期141-151,共11页MENG DeYu ZHANG Biao XU ZongBen ZHANG Lei GAO ChenQiang 
supported by the National Basic Research Program of China(Grant No.2013CB329404);the National Natural Science Fundation of China(Grant Nos.61373114,11131006,61075054&61102131)
Low-rank tensor factorization （LRTF） provides a useful mathematical tool to reveal and analyze multi-factor structures underlying data in a wide range of practical applications. One challenging issue in LRTF is how ...
关键词：tensor factorization low-rank weighted median filter tensorface 
A 16-competitive algorithm for hierarchical median problem
《Science China(Information Sciences)》2014年第3期142-148,共7页DAI WenQiang 
supported by National Natural Science Foundation of China (Grant No.70901012);Specialized Research Foundation for the Doctoral Program of Higher Education of China (Grant No.200806141084);Fundamental Research Funds for the Central Universities (Grant No.ZYGX2013J134)
The hierarchical median problem consists of finding a hierarchical assignment function sequence of solutions to the well-known k-median problems with growing cardinality. This sequence is said to be r competitive if t...
关键词：HIERARCHICAL LOCATION MEDIAN ALGORITHM competitive ratio 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部