...
首页> 外文期刊>International journal of soft computing >A Comparative Analysis of Feature Selection Algorithms Based on Rough Set Theory
【24h】

A Comparative Analysis of Feature Selection Algorithms Based on Rough Set Theory

机译:基于粗糙集理论的特征选择算法比较分析

获取原文
           

摘要

Rough set theory introduced by Pawlak in 1982 has been applied successfully in all the fields. It creates a framework for handling imprecise and incomplete data in information systems. A Rough Set is a mathematical tool to deal with Uncertainty and vagueness of an information system. An information system can be presented as a Table with rows analogous to objects and columns analogous to attributes. Each row of the table contains values of particular attributes representing information about an object. Based on rough sets theory, this study proposes Modified Quickreduct algorithm and discusses the performance study of various reduct algorithms for constructing efficient rules. The experiments were carried out on data sets of UCI machine learning repository and the Human Immuno deficiency Virus(HIV) data set to analyze the performance study. Generally, in rule generation for taking decision from the information system, the reduct plays a vital role. The reduct algorithm that generates the least number of rules is considered an efficient one.
机译:Pawlak于1982年提出的粗糙集理论已成功应用于所有领域。它创建了一个用于处理信息系统中不精确和不完整数据的框架。粗糙集是一种处理信息系统不确定性和模糊性的数学工具。信息系统可以表示为具有类似于对象的行和类似于属性的列的表。该表的每一行都包含表示有关对象信息的特定属性的值。基于粗糙集理论,本研究提出了改进的Quickreduction算法,并讨论了各种用于构造有效规则的Reduction算法的性能研究。在UCI机器学习存储库的数据集和人类免疫缺陷病毒(HIV)数据集上进行了实验,以分析性能研究。通常,在从信息系统做出决策的规则生成中,归约法起着至关重要的作用。产生最少数量规则的归约算法被认为是一种有效的规则。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号