Fuzzy Interval Number K-Means Clustering for Region Division of Pork Market

IF 0.6 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Xiangyan Meng, Muyan Liu, Ailing Qiao, Huiqiu Zhou, Jingyi Wu, F. Xu, Qiufeng Wu
{"title":"Fuzzy Interval Number K-Means Clustering for Region Division of Pork Market","authors":"Xiangyan Meng, Muyan Liu, Ailing Qiao, Huiqiu Zhou, Jingyi Wu, F. Xu, Qiufeng Wu","doi":"10.4018/ijdsst.2020070103","DOIUrl":null,"url":null,"abstract":"This article proposes a new clustering algorithm named FINK-means. First, this article converts original data into a fuzzy interval number (FIN). Second, it proves the F that denotes the collection of FINs is a lattice. Finally, it introduces a novel metric distance on the lattice F. The contrast experiments about FINK-means, k-means, and FCM algorithm are carried out on two simulated datasets and four public datasets. The results show that the FINK-means algorithm has better clustering performance on three evaluation indexes including the purity, loss cost, and silhouette coefficient. FINK-means is applied to the task of region division of pork market in China based on the daily data of pork price for different provinces of China from August 9, 2017 to August 9, 2018. The results show that regions of pork market in China was divided into five categories, namely very low, low, medium, high, and very high. Every category has been discussed as well. At last, an additional experiment about region division in Canada was carried out to prove the efficiency of FINK-means further.","PeriodicalId":42414,"journal":{"name":"International Journal of Decision Support System Technology","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Decision Support System Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijdsst.2020070103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This article proposes a new clustering algorithm named FINK-means. First, this article converts original data into a fuzzy interval number (FIN). Second, it proves the F that denotes the collection of FINs is a lattice. Finally, it introduces a novel metric distance on the lattice F. The contrast experiments about FINK-means, k-means, and FCM algorithm are carried out on two simulated datasets and four public datasets. The results show that the FINK-means algorithm has better clustering performance on three evaluation indexes including the purity, loss cost, and silhouette coefficient. FINK-means is applied to the task of region division of pork market in China based on the daily data of pork price for different provinces of China from August 9, 2017 to August 9, 2018. The results show that regions of pork market in China was divided into five categories, namely very low, low, medium, high, and very high. Every category has been discussed as well. At last, an additional experiment about region division in Canada was carried out to prove the efficiency of FINK-means further.
猪肉市场区域划分的模糊区间数k均值聚类
本文提出了一种新的聚类算法FINK-means。首先,本文将原始数据转换为模糊区间数(FIN)。其次,证明了表示fin集合的F是一个格。最后,在格子f上引入了一种新的度量距离,在两个模拟数据集和四个公共数据集上进行了FINK-means、k-means和FCM算法的对比实验。结果表明,FINK-means算法在纯度、损失代价和轮廓系数三个评价指标上具有较好的聚类性能。基于2017年8月9日至2018年8月9日中国各省猪肉价格的每日数据,将FINK-means应用于中国猪肉市场区域划分任务。结果表明,中国猪肉市场区域划分为极低、低、中、高、高5类。每个类别也都被讨论过。最后,在加拿大进行了区域划分实验,进一步验证了FINK-means的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Decision Support System Technology
International Journal of Decision Support System Technology COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
2.20
自引率
18.20%
发文量
40
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信