首页> 外文会议>International conference on rough sets, fuzzy sets, data mining, and granular computing >Empirical Risk Minimization for Variable Consistency Dominance-Based Rough Set Approach
【24h】

Empirical Risk Minimization for Variable Consistency Dominance-Based Rough Set Approach

机译:基于可变一致性优势的粗糙集方法的经验风险最小化

获取原文

摘要

The paper concerns reasoning about partially inconsistent ordinal data. We reveal the relation between Variable Consistency Dominance-based Rough Set Approach (VC-DRSA) and the empirical risk minimization problem. VC-DRSA is an extension of DRSA that admits some degree of inconsistency with respect to dominance, which is controlled by thresholds on a consistency measure. To prove this relation, we first solve an optimization problem to find thresholds ensuring assignment of a maximum number of objects under disjoint and balanced setting of extended lower approximations of two complementary unions of ordered decision classes: "at least" class i, and "at most" class i - 1, for a given i ∈ {2,… ,p}, where p is the total number of classes. For a given i, each object is supposed to be assigned to at most one of the two extended lower approximations. Moreover, the assignment is not influenced by unions' cardinalities. Second, we prune the set of objects not assigned to any extended lower approximation. Then, from a definable set, for a given i, we derive a classification function, which indicates assignment of an object to one of the two unions of decision classes. We define empirical risk associated with the classification function as a hinge loss function. We prove that the classification function minimizing the empirical risk function corresponds to the extended lower approximation in VC-DRSA involving thresholds obtained from the above optimization problem, followed by the pruning.
机译:本文涉及有关部分不一致的序数数据的推理。我们揭示了基于可变一致性优势的粗糙集方法(VC-DRSA)与经验风险最小化问题之间的关系。 VC-DRSA是DRSA的扩展,它允许在某种程度上关于主导性的不一致,这由一致性度量中的阈值控制。为了证明这种关系,我们首先解决一个优化问题,以找到阈值,以确保在有序决策类的两个互补并集的扩展下近似的不相交和平衡设置下分配最大数量的对象:“至少”类i和“在”对于给定的i∈{2,…,p},最“类i-1,其中p是类的总数。对于给定的i,应该将每个对象最多分配给两个扩展的较低近似值之一。此外,分配不受工会基数的影响。其次,我们修剪未分配给任何扩展的较低近似的对象集。然后,从一个可定义的集合中,对于给定的i,我们得出一个分类函数,该函数指示将一个对象分配给两个决策类联合之一。我们将与分类函数相关的经验风险定义为铰链损失函数。我们证明,将经验风险函数最小化的分类函数对应于VC-DRSA中的扩展下近似,涉及从上述优化问题中获得的阈值,然后进行修剪。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号