首页> 外文会议>Computational intelligence for knowledge-based systems design >Aggregation Functions with Stronger Types of Monotonicity
【24h】

Aggregation Functions with Stronger Types of Monotonicity

机译:具有更强单调类型的聚集函数

获取原文
获取原文并翻译 | 示例

摘要

Following the ideas of stronger forms of monotonicity for unary real functions and for capacities, fc-monotone and strongly k-monotone aggregation functions are introduced and discussed. In the special case k = 2 also some applications are given.
机译:遵循针对一元实函数和容量的更强单调形式的思想,引入并讨论了fc-单调和强k-单调聚合函数。在特殊情况下,k = 2,也给出了一些应用。

著录项

  • 来源
  • 会议地点 Dortmund(DE);Dortmund(DE)
  • 作者单位

    Department of Knowledge-Based Mathematical Systems,Johannes Kepler University, Linz, Austria;

    Department of Pure and Applied Mathematics,University of Padua, Padova, Italy;

    Department of Mathematics and Descriptive Geometry,Faculty of Civil Engineering, Slovak University of Technology, Bratislava, Slovakia, Institute of Theory of Information and Automation,Czech Academy of Sciences, Prague, Czech Republic;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 信息处理(信息加工);
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号