粗集
关系(数据库)
完整信息
数据挖掘
集合(抽象数据类型)
计算机科学
对象(语法)
缺少数据
信息系统
学位(音乐)
机器学习
数学
人工智能
集合论
算法
数据集
信息论
数学优化
信息丢失
信息集成
不确定数据
作者
Mustafa Mat Deris,Heru Nurwarsito,Wayan Firdaus Mahmudy
标识
DOI:10.18517/ijaseit.15.5.21590
摘要
Information systems (IS) can be analyzed using various approaches to support the decision-making process. While many datasets contain complete information, others are incomplete. One widely used approach for studying information systems is using rough set theory, introduced by Pawlak in 1982. Pawlak’s classical rough set theory (RST), while excellent for analyzing complete datasets, struggles with incomplete information systems (IIS) in which some attribute values are missing or unknown, which are common in real-world scenarios. Thus, RST’s inability to handle missing attribute values limits its use in real-world scenarios where information is often imperfect. To manage incomplete information systems, several techniques, extensions of RST, are employed, including tolerance relations, non-symmetric similarity/affinity relations, and limited tolerance relations. The limited tolerance relation is typically preferred, yet disregarding the affinity degree between objects may lead to a loss of information. Moreover, the limited tolerance has weaknesses that prevent optimal data classification. This paper introduces a new limited-tolerance relation approach for incomplete information systems, designed to account for the degree of affinity among objects. The proposed approach improved classification accuracy by providing a more precise approximation of object relationships within incomplete information systems (IIS). By integrating the affinity-degree, the new limited tolerance relation demonstrates greater precision and improves the accuracy of approximation and classification of objects in IIS, which is worthy of attention.
科研通智能强力驱动
Strongly Powered by AbleSci AI