基于相关性的特征子集选择

Hui Wang, David Bell, Fionn Murtagh
{"title":"基于相关性的特征子集选择","authors":"Hui Wang,&nbsp;David Bell,&nbsp;Fionn Murtagh","doi":"10.1016/S0083-6656(97)00043-3","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper an axiomatic characterisation of feature subset selection is presented. Two axioms are presented: sufficiency axiom—preservation of learning information, and necessity axiom—minimising encoding length. The sufficiency axiom concerns the existing dataset and is derived based on the following understanding: any selected feature subset should be able to describe the training dataset without losing information, i.e. it is consistent with the training dataset. The necessity axiom concerns the predictability and is derived from Occam's razor, which states that the simplest among different alternatives is preferred for prediction. The two axioms are then restated in terms of relevance in a concise form: maximising both the <em>r</em>(<em>X</em>; <em>Y</em>) and <em>r</em>(<em>Y</em>; <em>X</em>) relevance. Based on the relevance characterisation, four feature subset selection algorithms are presented and analysed: one is exhaustive and the remaining three are heuristic. Experimentation is also presented and the results are encouraging. Comparison is also made with some well-known feature subset selection algorithms, in particular, with the built-in feature selection mechanism in C4.5.</p></div>","PeriodicalId":101275,"journal":{"name":"Vistas in Astronomy","volume":"41 3","pages":"Pages 387-396"},"PeriodicalIF":0.0000,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0083-6656(97)00043-3","citationCount":"11","resultStr":"{\"title\":\"Feature subset selection based on relevance\",\"authors\":\"Hui Wang,&nbsp;David Bell,&nbsp;Fionn Murtagh\",\"doi\":\"10.1016/S0083-6656(97)00043-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper an axiomatic characterisation of feature subset selection is presented. Two axioms are presented: sufficiency axiom—preservation of learning information, and necessity axiom—minimising encoding length. The sufficiency axiom concerns the existing dataset and is derived based on the following understanding: any selected feature subset should be able to describe the training dataset without losing information, i.e. it is consistent with the training dataset. The necessity axiom concerns the predictability and is derived from Occam's razor, which states that the simplest among different alternatives is preferred for prediction. The two axioms are then restated in terms of relevance in a concise form: maximising both the <em>r</em>(<em>X</em>; <em>Y</em>) and <em>r</em>(<em>Y</em>; <em>X</em>) relevance. Based on the relevance characterisation, four feature subset selection algorithms are presented and analysed: one is exhaustive and the remaining three are heuristic. Experimentation is also presented and the results are encouraging. Comparison is also made with some well-known feature subset selection algorithms, in particular, with the built-in feature selection mechanism in C4.5.</p></div>\",\"PeriodicalId\":101275,\"journal\":{\"name\":\"Vistas in Astronomy\",\"volume\":\"41 3\",\"pages\":\"Pages 387-396\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0083-6656(97)00043-3\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Vistas in Astronomy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0083665697000433\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vistas in Astronomy","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0083665697000433","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

本文给出了特征子集选择的一个公理化表征。给出了两个公理:充分性公理—学习信息的保存;必要性公理—编码长度的最小化。充分性公理涉及现有数据集,并基于以下理解推导:任何选择的特征子集都应该能够描述训练数据集而不丢失信息,即与训练数据集一致。必然性公理与可预测性有关,由奥卡姆剃刀推导而来,它指出,在不同的选择中,最简单的是预测的首选。然后以简洁的形式重申这两个公理的相关性:最大化r(X;Y)和r(Y;X)的相关性。基于相关性表征,提出并分析了四种特征子集选择算法:一种是穷举算法,其余三种是启发式算法。实验结果令人鼓舞。并与一些知名的特征子集选择算法进行了比较,特别是与C4.5中内置的特征选择机制进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Feature subset selection based on relevance

In this paper an axiomatic characterisation of feature subset selection is presented. Two axioms are presented: sufficiency axiom—preservation of learning information, and necessity axiom—minimising encoding length. The sufficiency axiom concerns the existing dataset and is derived based on the following understanding: any selected feature subset should be able to describe the training dataset without losing information, i.e. it is consistent with the training dataset. The necessity axiom concerns the predictability and is derived from Occam's razor, which states that the simplest among different alternatives is preferred for prediction. The two axioms are then restated in terms of relevance in a concise form: maximising both the r(X; Y) and r(Y; X) relevance. Based on the relevance characterisation, four feature subset selection algorithms are presented and analysed: one is exhaustive and the remaining three are heuristic. Experimentation is also presented and the results are encouraging. Comparison is also made with some well-known feature subset selection algorithms, in particular, with the built-in feature selection mechanism in C4.5.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信