Attribute reduction for incomplete mixed data based on neighborhood information system

IF 2.4 4区 计算机科学 Q2 COMPUTER SCIENCE, THEORY & METHODS International Journal of General Systems Pub Date : 2023-09-12 DOI:10.1080/03081079.2023.2256464
Ran Li, Hongchang Chen, Shuxin Liu, Haocong Jiang, Biao Wang
{"title":"Attribute reduction for incomplete mixed data based on neighborhood information system","authors":"Ran Li, Hongchang Chen, Shuxin Liu, Haocong Jiang, Biao Wang","doi":"10.1080/03081079.2023.2256464","DOIUrl":null,"url":null,"abstract":"In an era of data-based and information-centric Industry 4.0, extracting potential knowledge and valuable information from data is central to data mining tasks. Yet, the ambiguity, imprecision, incompleteness, and hybrid in real-world data pose tremendous challenges to critical information mining. Accordingly, we propose a new Max-Correlation Min-Redundant (MCMR) attribute reduction model from the uncertainty relation of attributes to avoid information loss in incomplete mixed data. Specifically, the neighbor relations are primarily developed based on the soft computing approach of the neighborhood information system, which divides the objects into neighborhood covers to maximize the utilization of the information in the incomplete mixed data. Then, we detailly analyze the internal and external consistency relationships of the four main uncertainty functions. Based on this, a new MCMR uncertain function is designed with maximum relevance and minimum redundancy. Experiments on nine real-world datasets validate the proposed model can improve data quality by mining critical information in classification tasks and achieving optimal performance with a minimum number of attributes.","PeriodicalId":50322,"journal":{"name":"International Journal of General Systems","volume":"26 1","pages":"0"},"PeriodicalIF":2.4000,"publicationDate":"2023-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of General Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/03081079.2023.2256464","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

In an era of data-based and information-centric Industry 4.0, extracting potential knowledge and valuable information from data is central to data mining tasks. Yet, the ambiguity, imprecision, incompleteness, and hybrid in real-world data pose tremendous challenges to critical information mining. Accordingly, we propose a new Max-Correlation Min-Redundant (MCMR) attribute reduction model from the uncertainty relation of attributes to avoid information loss in incomplete mixed data. Specifically, the neighbor relations are primarily developed based on the soft computing approach of the neighborhood information system, which divides the objects into neighborhood covers to maximize the utilization of the information in the incomplete mixed data. Then, we detailly analyze the internal and external consistency relationships of the four main uncertainty functions. Based on this, a new MCMR uncertain function is designed with maximum relevance and minimum redundancy. Experiments on nine real-world datasets validate the proposed model can improve data quality by mining critical information in classification tasks and achieving optimal performance with a minimum number of attributes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于邻域信息系统的不完全混合数据属性约简
在以数据为基础、以信息为中心的工业4.0时代,从数据中提取潜在知识和有价值的信息是数据挖掘任务的核心。然而,现实世界数据的模糊性、不精确性、不完整性和混合性给关键信息挖掘带来了巨大的挑战。为此,从属性的不确定性关系出发,提出了一种新的最大相关最小冗余属性约简模型,以避免不完全混合数据中的信息丢失。具体来说,邻域关系主要是基于邻域信息系统的软计算方法开发的,邻域信息系统将对象划分为邻域覆盖,最大限度地利用不完全混合数据中的信息。然后,详细分析了四种主要不确定性函数的内外一致性关系。在此基础上,设计了一种关联度最大、冗余度最小的MCMR不确定函数。在9个真实数据集上的实验验证了该模型可以通过挖掘分类任务中的关键信息,以最少的属性数量实现最优性能,从而提高数据质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of General Systems
International Journal of General Systems 工程技术-计算机:理论方法
CiteScore
4.10
自引率
20.00%
发文量
38
审稿时长
6 months
期刊介绍: International Journal of General Systems is a periodical devoted primarily to the publication of original research contributions to system science, basic as well as applied. However, relevant survey articles, invited book reviews, bibliographies, and letters to the editor are also published. The principal aim of the journal is to promote original systems ideas (concepts, principles, methods, theoretical or experimental results, etc.) that are broadly applicable to various kinds of systems. The term “general system” in the name of the journal is intended to indicate this aim–the orientation to systems ideas that have a general applicability. Typical subject areas covered by the journal include: uncertainty and randomness; fuzziness and imprecision; information; complexity; inductive and deductive reasoning about systems; learning; systems analysis and design; and theoretical as well as experimental knowledge regarding various categories of systems. Submitted research must be well presented and must clearly state the contribution and novelty. Manuscripts dealing with particular kinds of systems which lack general applicability across a broad range of systems should be sent to journals specializing in the respective topics.
期刊最新文献
Stress–strength reliability estimation of s-out-of-k multicomponent systems based on copula function for dependent strength elements under progressively censored sample Reliability of a consecutive k-out-of-n: G system with protection blocks Two-way concept-cognitive learning method: a perspective from progressive learning of fuzzy skills Disturbance-observer-based adaptive neural event-triggered fault-tolerant control for uncertain nonlinear systems against sensor faults Idempotent uninorms on bounded lattices with at most a single point incomparable with the neutral element: Part II
×
引用
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