An Efficient Procedure to Select a Near-Optimal Subset of Pattern Classification Features

منو

" An Efficient Procedure to Select a Near-Optimal Subset of Pattern Classification Features "

Document Type	:	Latin Dissertation
Language of Document	:	English
Record Number	:	149522
Doc. No	:	ET21314
Main Entry	:	Kwang W. Lee
Title Proper	:	An Efficient Procedure to Select a Near-Optimal Subset of Pattern Classification Features
Note	:	This document is digital این مدرک بصورت الکترونیکی می باشد
Abstract	:	This dissertation proposes a feature subset selection method that combines several known techniques. Feature subset selection has been identified as one of the most important processes in various applications, especially in pattern classification problems. However, when too many attributes are involved, training a machine to classify patterns into their respective classes is difficult. Hence, selecting good feature subsets is important. Although numerous methods to select feature subsets have been proposed, no universal solution for this problem exists, and the Exhaustive Search method is not practical. Some heuristic techniques such as Sequential.
Subject	:	Electericl tess
	:	برق
electronic file name	:	TL44471.pdf
Title and statement of responsibility and	:	An Efficient Procedure to Select a Near-Optimal Subset of Pattern Classification Features [Thesis]