首页> 外文会议>Canadian conference on artificial intelligence >The K-Modes Method under Possibilistic Framework
【24h】

The K-Modes Method under Possibilistic Framework

机译:PositIbilistic框架下的K模型方法

获取原文

摘要

In this paper, we develop a new clustering method combining the possibility theory with the standard k-modes method (SKM). The proposed method is called KM-PF to express the fact that it is a modification of k-modes algorithm under possibilistic framework. KM-PM incorporates possibilistic theory in two distinct stages in application of the SKM combining the possibilistic k-modes (PKM) and the k-modes using possibilistic membership (KM-PM). First, it deals with uncertain attribute values of instances using possibilistic distributions. Then, it computes the possibilistic membership degrees of each object to all clusters. Experimental results show that the proposed method compares favourably to the SKM, PKM and KM-PM.
机译:在本文中,我们开发了一种新的聚类方法,将可能性理论与标准K-MODES(SKM)相结合。所提出的方法称为KM-PF,表达了它是在可能主义框架下进行K-Modes算法的修改。 KM-PM在两个不同的阶段中包含了应用SKM的两个不同阶段,将可能性化K-MODES(PKM)和K模式相结合使用可能性隶属(KM-PM)。首先,它处理了使用可能性分布的情况的不确定属性值。然后,它将每个对象的可能的成员资格学位计算到所有集群。实验结果表明,该方法对SKM,PKM和KM-PM有利地比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号