首页> 外文会议>International Conference on Computation of Power, Energy Information and Commuincation >Improvement of data object's membership by using Fuzzy K-Means clustering approach
【24h】

Improvement of data object's membership by using Fuzzy K-Means clustering approach

机译:使用模糊K-均值聚类方法改善数据对象的隶属度

获取原文

摘要

Clustering is classified into two categories namely-Hard clustering and Soft clustering. The hard clustering restricts that the data object in the given data belongs to exactly one cluster. The problem with hard K-Means (KM) clustering is that the different initial partitions can result in different final clusters. Soft clustering which also known as fuzzy clustering forms clusters such that data object can belong to more than one cluster based on their membership values. But sometimes the resulting membership values do not always correspond well to the degrees of belonging of the data. So to overcome the problems in hard K-means (KM) clustering, the Fuzzy K-Means (FKM) clustering approach is proposed. The Proposed Fuzzy K-Means clustering assigns membership to an object inversely related to the relative distance of the object to cluster prototype. Fuzzy clustering uses membership values to assign data objects to one or more clusters. The membership values indicate the strength of the association between that data object and a particular cluster. The proposed work also compares the execution time and required memory of Proposed Fuzzy K-Means (FKM) to that of hard K-means (KM) clustering. The result shows membership of data object is improved, also the execution time and memory required for Proposed Fuzzy K-Means (FKM) clustering is less than that of hard K-Means (KM) clustering.
机译:聚类分为硬聚类和软聚类两类。硬群集限制了给定数据中的数据对象恰好属于一个群集。硬K均值(KM)聚类的问题在于,不同的初始分区可能导致不同的最终聚类。软聚类(也称为模糊聚类)形成聚类,以便数据对象可以根据其隶属度值属于一个以上的聚类。但是有时,所得的隶属度值并不总是与数据的归属度很好地对应。因此,为了克服硬K均值(KM)聚类的问题,提出了模糊K均值(FKM)聚类方法。拟议的模糊K均值聚类将对象的隶属关系分配给与该对象到聚类原型的相对距离成反比的对象。模糊聚类使用隶属度值将数据对象分配给一个或多个聚类。成员资格值指示该数据对象与特定群集之间的关联强度。拟议的工作还比较了拟议的模糊K均值(FKM)和硬K均值(KM)聚类的执行时间和所需的内存。结果表明,改进了数据对象的隶属度,并且建议的模糊K均值(FKM)聚类所需的执行时间和内存比硬K均值(KM)聚类所需的时间少。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号