Uncertain Interval Data EFCM-ID Clustering Algorithm Based on Machine Learning

Author:

Mao Yimin,Liu Yinping,Khan Muhammad Asim,Wang Jiawei,Mao Dinghui,Hu Jian, , ,

Abstract

In clustering problems based on fuzzy c-means (FCM) for uncertain interval data, points within the interval are usually assumed to have uniform distribution, resulting in the difficulty of accurately describing the interval. Furthermore, the clustering results are considerably affected by the initial clustering centers, and the update speed of the membership degree is slow. To address these problems, a new clustering algorithm called uncertain FCM for interval data (EFCM-ID) is presented. On the basis of a quartile, a median quartile-spacing distance measurement for generally distributed interval data based on machine learning is designed to precisely determine these data. Simultaneously, we sample the whole dataset and consider the density centers as the initial clustering centers to increase accuracy. We call this method samplingbased density-center selection (SDCS). To reduce the running time, a new measurement based on competitive-learning theory to update the membership is developed. It accelerates the update speed by different degrees according to value of the membership degree. Experiments conducted on synthetic interval datasets show the feasibility of EFCM-ID.

Publisher

Fuji Technology Press Ltd.

Subject

Electrical and Electronic Engineering,General Computer Science

Reference21 articles.

1. K. Zhao, S. Yang, S. Ding et al., “On cluster validation,” Systems Engineering – Theory and Practice, No.9, pp. 2417-2431, 2014.

2. H. Li, Y. Li, P. Zhao et al., “The subdivision of railway passenger transport market based on rough clustering algorithm,” J. of Transportation Systems Engineering and Information Technology, Vol.18, No.3, pp. 9-14, 2018.

3. R. A. Gevorgyan and Y. B. Hakobyan, “A matching based clustering algorithm for categorical data,” Computer Science, Vol.12, No.9, pp. 1-9, 2018.

4. K. Peng, V. C. M. Leung, and Q. Huang, “Clustering approach based on mini batch K-means for intrusion detection system over big data,” IEEE Access, Vol.6, No.99, pp. 11897-11906, 2018.

5. Y. Lu and C. Xia, “Optimized k-Nearest Neighbors and Local Density-Based Clustering Algorithm for Uncertain Data,” Control and Decision, Vol.31, No.3, pp. 541-546, 2016.

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3