Research on a text data preprocessing method suitable for clustering algorithm

Chunlin Wang, Neng Yang, Wanjin Xu, Junjie Wang, Jianyong Sun, Xiaolin Chen
{"title":"Research on a text data preprocessing method suitable for clustering algorithm","authors":"Chunlin Wang, Neng Yang, Wanjin Xu, Junjie Wang, Jianyong Sun, Xiaolin Chen","doi":"10.1109/ISPDS56360.2022.9874172","DOIUrl":null,"url":null,"abstract":"In the clustering process, the eigenvalues in the data set have mixed type attributes such as numerical and text, and the measurement methods are inconsistent. In this paper, the distance between samples is easily affected by the eigenvalues of a certain dimension. This includes affecting clustering performance and the inability of continuous algorithms to deal with discrete data. These two problems focus on two points in the algorithm of this paper. First, each characteristic attribute of the dataset is analyzed. The type and number of ranges for each attribute is counted. Attributes that are not affected by the clustering algorithm are deleted. Secondly, the text feature attributes with more than 2 range are extended to multiple new feature attributes. Each attribute has only two value fields, replaced by 0 or 1 respectively. This approach makes all textual and numeric attributes use a uniform metric. This method was used to preprocess the mushroom dataset. This keeps the values in the dataset in the same range. Clustering algorithm is used to classify it. In the experiment, the classification accuracy of k-means++ algorithm is improved from 70.9% to 89.2% compared with LabelEncoder method. It also applies to more algorithms. This proves that our method works.","PeriodicalId":280244,"journal":{"name":"2022 3rd International Conference on Information Science, Parallel and Distributed Systems (ISPDS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 3rd International Conference on Information Science, Parallel and Distributed Systems (ISPDS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDS56360.2022.9874172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the clustering process, the eigenvalues in the data set have mixed type attributes such as numerical and text, and the measurement methods are inconsistent. In this paper, the distance between samples is easily affected by the eigenvalues of a certain dimension. This includes affecting clustering performance and the inability of continuous algorithms to deal with discrete data. These two problems focus on two points in the algorithm of this paper. First, each characteristic attribute of the dataset is analyzed. The type and number of ranges for each attribute is counted. Attributes that are not affected by the clustering algorithm are deleted. Secondly, the text feature attributes with more than 2 range are extended to multiple new feature attributes. Each attribute has only two value fields, replaced by 0 or 1 respectively. This approach makes all textual and numeric attributes use a uniform metric. This method was used to preprocess the mushroom dataset. This keeps the values in the dataset in the same range. Clustering algorithm is used to classify it. In the experiment, the classification accuracy of k-means++ algorithm is improved from 70.9% to 89.2% compared with LabelEncoder method. It also applies to more algorithms. This proves that our method works.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
研究一种适合聚类算法的文本数据预处理方法
在聚类过程中,数据集中的特征值具有数值和文本等混合类型属性,测量方法不一致。在本文中,样本间的距离容易受到某一维度特征值的影响。这包括影响聚类性能和连续算法无法处理离散数据。这两个问题集中在本文算法中的两点上。首先,对数据集的各个特征属性进行分析。计算每个属性的范围类型和数量。删除不受聚类算法影响的属性。其次,将范围大于2的文本特征属性扩展为多个新的特征属性;每个属性只有两个值字段,分别用0或1替换。这种方法使所有文本和数字属性使用统一的度量。利用该方法对蘑菇数据集进行预处理。这将使数据集中的值保持在同一范围内。采用聚类算法对其进行分类。在实验中,与LabelEncoder方法相比,k- meme++算法的分类准确率从70.9%提高到89.2%。它也适用于更多的算法。这证明我们的方法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on Intelligent Quality Inspection of Customer Service Under the “One Network” Operation Mode of Toll Roads Application of AE keying technology in film and television post-production Study on Artifact Classification Identification Based on Deep Learning Design of Real-time Target Detection System in CCD Vertical Target Coordinate Measurement An evaluation method of municipal pipeline cleaning effect based on image processing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1