一种基于多维变化的周期更新粗糙逼近的新方法

Faryal Nosheen, Usman Qamar, S. Raza
{"title":"一种基于多维变化的周期更新粗糙逼近的新方法","authors":"Faryal Nosheen, Usman Qamar, S. Raza","doi":"10.1109/ICoDT255437.2022.9787436","DOIUrl":null,"url":null,"abstract":"In present era, transformation of almost all fields of life toward digitalization, poses various challenges. One of them is effective data analysis of large datasets and its complexity multiplies when dataset evolves with time. Dominance based rough set theory is a mathematical based tool, which efficiently probes hidden patterns from preference ordered based datasets. But in case of large datasets, computation of DRSA approximations becomes crucial step. In conventional DRSA algorithm, approximation sets have to be re-calculated when some change occurs in data over time. Therefore, repetitive calculations further increase the computational cost of approximations in real-time domain. In this paper, we researched the execution cost of approximations and designed a periodic approach to efficiently update DRSA approximations when variations occur in an object set and value set of decision attribute. We tested and compared the proposed dynamic approach with conventional approach and another dynamic approach, using UCI datasets. The results have shown that the proposed approach marked 98% reduction in computational time in comparison with conventional approach and 25% reduction in comparison with dynamic approach while updating DRSA approximations upon multi-dimensional variations.","PeriodicalId":291030,"journal":{"name":"2022 2nd International Conference on Digital Futures and Transformative Technologies (ICoDT2)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Novel Approach for Periodically Updating Rough Approximations Upon Multi-Dimension Variation\",\"authors\":\"Faryal Nosheen, Usman Qamar, S. Raza\",\"doi\":\"10.1109/ICoDT255437.2022.9787436\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In present era, transformation of almost all fields of life toward digitalization, poses various challenges. One of them is effective data analysis of large datasets and its complexity multiplies when dataset evolves with time. Dominance based rough set theory is a mathematical based tool, which efficiently probes hidden patterns from preference ordered based datasets. But in case of large datasets, computation of DRSA approximations becomes crucial step. In conventional DRSA algorithm, approximation sets have to be re-calculated when some change occurs in data over time. Therefore, repetitive calculations further increase the computational cost of approximations in real-time domain. In this paper, we researched the execution cost of approximations and designed a periodic approach to efficiently update DRSA approximations when variations occur in an object set and value set of decision attribute. We tested and compared the proposed dynamic approach with conventional approach and another dynamic approach, using UCI datasets. The results have shown that the proposed approach marked 98% reduction in computational time in comparison with conventional approach and 25% reduction in comparison with dynamic approach while updating DRSA approximations upon multi-dimensional variations.\",\"PeriodicalId\":291030,\"journal\":{\"name\":\"2022 2nd International Conference on Digital Futures and Transformative Technologies (ICoDT2)\",\"volume\":\"184 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 2nd International Conference on Digital Futures and Transformative Technologies (ICoDT2)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICoDT255437.2022.9787436\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 2nd International Conference on Digital Futures and Transformative Technologies (ICoDT2)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICoDT255437.2022.9787436","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

当今时代,几乎所有的生活领域都在向数字化转型,这带来了各种各样的挑战。其中之一是大型数据集的有效数据分析,其复杂性随着数据集的时间推移而成倍增加。基于优势的粗糙集理论是一种基于数学的工具,可以有效地从基于偏好排序的数据集中探测隐藏模式。但对于大型数据集,DRSA近似的计算成为关键步骤。在传统的DRSA算法中,当数据随时间发生变化时,必须重新计算近似集。因此,重复计算进一步增加了实时域近似的计算成本。本文研究了近似的执行成本,设计了一种当决策属性的对象集和值集发生变化时有效更新DRSA近似的周期性方法。我们使用UCI数据集测试并比较了所提出的动态方法与传统方法和另一种动态方法。结果表明,该方法与传统方法相比,计算时间减少了98%,与动态方法相比,计算时间减少了25%,同时根据多维变化更新DRSA近似。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Approach for Periodically Updating Rough Approximations Upon Multi-Dimension Variation
In present era, transformation of almost all fields of life toward digitalization, poses various challenges. One of them is effective data analysis of large datasets and its complexity multiplies when dataset evolves with time. Dominance based rough set theory is a mathematical based tool, which efficiently probes hidden patterns from preference ordered based datasets. But in case of large datasets, computation of DRSA approximations becomes crucial step. In conventional DRSA algorithm, approximation sets have to be re-calculated when some change occurs in data over time. Therefore, repetitive calculations further increase the computational cost of approximations in real-time domain. In this paper, we researched the execution cost of approximations and designed a periodic approach to efficiently update DRSA approximations when variations occur in an object set and value set of decision attribute. We tested and compared the proposed dynamic approach with conventional approach and another dynamic approach, using UCI datasets. The results have shown that the proposed approach marked 98% reduction in computational time in comparison with conventional approach and 25% reduction in comparison with dynamic approach while updating DRSA approximations upon multi-dimensional variations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信