...
首页> 外文期刊>Applied Soft Computing >Prototypes construction from partial rankings to characterize the attractiveness of companies in Belgium
【24h】

Prototypes construction from partial rankings to characterize the attractiveness of companies in Belgium

机译:通过部分排名进行原型构建,以体现比利时公司的吸引力

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

获取外文期刊封面封底 >>

       

摘要

What are the most relevant factors to be considered by employees when searching for an employer? The answer to this question poses valuable knowledge from the Business Intelligence viewpoint since it allows companies to retain personnel and attract competent employees. It leads to an increase in sales of their products or services, therefore remaining competitive across similar companies in the market. In this paper we assess the attractiveness of companies in Belgium by using a new two-stage methodology based on Artificial Intelligence techniques. The proposed method allows constructing high-quality prototypes from partial rankings indicating experts' preferences. Being more explicit, in the first step we propose a fuzzy clustering algorithm for partial rankings called fuzzy c-aggregation. This algorithm is based on the well-known fuzzy c-means procedure and uses the Hausdorff distance as dissimilarity functional and a counting strategy for updating the center of each cluster. However, we cannot ensure the optimality of such prototypes, and therefore more accurate prototypes must be derived. That is why the second step is focused on solving the extended Kemeny ranking problem for each discovered cluster taking into account the estimated membership matrix. To accomplish that, we adopt an optimization method based on Swarm Intelligence that exploits a colony of artificial ants. Several simulations show the effectiveness of the proposal for the real-world problem under investigation. (C) 2016 Elsevier B.V. All rights reserved.
机译:员工在寻找雇主时应考虑哪些最相关的因素?这个问题的答案从商业智能的角度提出了宝贵的知识,因为它可以使公司留住人员并吸引有能力的员工。这导致其产品或服务的销售增加,从而在市场上的同类公司之间保持竞争优势。在本文中,我们通过使用基于人工智能技术的新的两阶段方法来评估比利时公司的吸引力。所提出的方法允许从表明专家偏好的部分排名中构建高质量的原型。更明确地说,在第一步中,我们针对部分排名提出了一种模糊聚类算法,称为模糊c聚合。该算法基于众所周知的模糊c均值程序,并使用Hausdorff距离作为相异函数和一种计数策略来更新每个聚类的中心。但是,我们不能确保此类原型的最优性,因此必须导出更准确的原型。这就是为什么第二步专注于解决每个发现的集群的扩展Kemeny排序问题的原因,同时考虑了估计的成员矩阵。为此,我们采用了基于群智能的优化方法,该方法利用了人工蚁群。若干模拟显示了该建议对于所研究的实际问题的有效性。 (C)2016 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号