一种快速聚类属性选择的软集方法

D. Hartama, I. R. Yanto, M. Zarlis
{"title":"一种快速聚类属性选择的软集方法","authors":"D. Hartama, I. R. Yanto, M. Zarlis","doi":"10.1109/IAC.2016.7905681","DOIUrl":null,"url":null,"abstract":"Attribute-based data clustering has been proven as one of the efficient methods in data clustering. Set theory approaches for data clustering exist to handle attribute-based data clustering. The MDDS, a soft set based technique has proven its applicability in data clustering. However, in reviewing MDDS, where its calculations are based on comparing all constructed multi-soft sets, it still suffers from high computational time. This research presents a modification of the MDDS by generating an alternative technique to reduce its computational complexity. To provide alternative solutions from MDDS algorithm, we derive a new algorithm that can lesser response time. It is using theory of soft set by selecting and excluding the set having no effect domination on other sets. The experiments are implemented in MATLAB software thought to UCI benchmark datasets. The computation experiment illustrate that the time response can be speed up to 67.56 % by proposed algorithm compared with MDDS.","PeriodicalId":404904,"journal":{"name":"2016 International Conference on Informatics and Computing (ICIC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A soft set approach for fast clustering attribute selection\",\"authors\":\"D. Hartama, I. R. Yanto, M. Zarlis\",\"doi\":\"10.1109/IAC.2016.7905681\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Attribute-based data clustering has been proven as one of the efficient methods in data clustering. Set theory approaches for data clustering exist to handle attribute-based data clustering. The MDDS, a soft set based technique has proven its applicability in data clustering. However, in reviewing MDDS, where its calculations are based on comparing all constructed multi-soft sets, it still suffers from high computational time. This research presents a modification of the MDDS by generating an alternative technique to reduce its computational complexity. To provide alternative solutions from MDDS algorithm, we derive a new algorithm that can lesser response time. It is using theory of soft set by selecting and excluding the set having no effect domination on other sets. The experiments are implemented in MATLAB software thought to UCI benchmark datasets. The computation experiment illustrate that the time response can be speed up to 67.56 % by proposed algorithm compared with MDDS.\",\"PeriodicalId\":404904,\"journal\":{\"name\":\"2016 International Conference on Informatics and Computing (ICIC)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Informatics and Computing (ICIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IAC.2016.7905681\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Informatics and Computing (ICIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAC.2016.7905681","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

基于属性的数据聚类是一种有效的数据聚类方法。数据聚类的集合理论方法用于处理基于属性的数据聚类。MDDS是一种基于软集的聚类技术,在数据聚类中具有很强的适用性。然而,在回顾MDDS时,它的计算基于比较所有构造的多软集,仍然存在计算时间长的问题。本研究通过生成一种替代技术来改进MDDS,以降低其计算复杂度。为了提供MDDS算法的替代解决方案,我们推导了一种可以缩短响应时间的新算法。它运用软集理论,选择和排除对其他集合没有支配作用的集合。实验在MATLAB软件中以UCI基准数据集为背景进行。计算实验表明,与MDDS相比,该算法的时间响应速度可提高67.56%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A soft set approach for fast clustering attribute selection
Attribute-based data clustering has been proven as one of the efficient methods in data clustering. Set theory approaches for data clustering exist to handle attribute-based data clustering. The MDDS, a soft set based technique has proven its applicability in data clustering. However, in reviewing MDDS, where its calculations are based on comparing all constructed multi-soft sets, it still suffers from high computational time. This research presents a modification of the MDDS by generating an alternative technique to reduce its computational complexity. To provide alternative solutions from MDDS algorithm, we derive a new algorithm that can lesser response time. It is using theory of soft set by selecting and excluding the set having no effect domination on other sets. The experiments are implemented in MATLAB software thought to UCI benchmark datasets. The computation experiment illustrate that the time response can be speed up to 67.56 % by proposed algorithm compared with MDDS.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信