The Minimum Feature Subset Selection Problem

在线阅读 下载PDF 导出详情
摘要 Inapplicationsoflearningfromexamplestoreal-worldtasks,featuresubsetselectionisimportanttospeeduptrainingandtoimprovegeneralizationperformance.Ideally,aninductivealgorithmshouldusesubsetoffeaturesassmallaspossible.Inthispaperhowever,theauthorsshowthattheproblemofselectingtheminimumsubsetoffeaturesisNP-hard.Thepaperthenpresentsagreedyalgorithmforreaturesubsetselection.Theresultofrunningthegreedyalgorithmonhand-writtennumeralrecognitionproblemisalsogiven.
机构地区 不详
出版日期 1997年02月12日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献