FST::Search_Sequential< RETURNTYPE, DIMTYPE, SUBSET, CRITERION, EVALUATOR > Class Template Reference

Abstract class, defines interface for sequential search method implementations, provides common implementation of the "sequential step" operation. More...

#include <search_seq.hpp>

Inheritance diagram for FST::Search_Sequential< RETURNTYPE, DIMTYPE, SUBSET, CRITERION, EVALUATOR >:

[legend]

Collaboration diagram for FST::Search_Sequential< RETURNTYPE, DIMTYPE, SUBSET, CRITERION, EVALUATOR >:

[legend]

List of all members.

Public Types
typedef Search< RETURNTYPE, DIMTYPE, SUBSET, CRITERION >	parent
typedef boost::shared_ptr < EVALUATOR >	PEvaluator
typedef boost::shared_ptr < CRITERION >	PCriterion
typedef boost::shared_ptr< SUBSET >	PSubset
Public Member Functions
	Search_Sequential (const PEvaluator evaluator)
virtual bool	search (const DIMTYPE target_d, RETURNTYPE &result, const PSubset sub, const PCriterion crit, std::ostream &os)=0
	returns found subset + criterion value
bool	Step (const bool forward, RETURNTYPE &result, const PSubset sub, const PCriterion crit, std::ostream &os=std::cout)
	modifies sub by adding/removing best/worst feature g-tuple, returns true if sub has been changed
void	set_generalization_level (const DIMTYPE g)
	optional parameter to enlarge the number of considered candidates (g is the number of features added/removed in one Step)
DIMTYPE	get_generalization_level () const
void	enable_initial_subset ()
void	disable_initial_subset ()
bool	initial_subset_enabled () const
Protected Attributes
PEvaluator	_evaluator
DIMTYPE	_generalization_level
bool	_initial_subset_enabled
	by default all concrete search methods ignore the contents of supplied 'PSubset set' and initialize sub according to their definition; if enabled, then (if possible) the search() starts from supplied 'PSubset sub' contents

---

Detailed Description

template<class RETURNTYPE, typename DIMTYPE, class SUBSET, class CRITERION, class EVALUATOR>
class FST::Search_Sequential< RETURNTYPE, DIMTYPE, SUBSET, CRITERION, EVALUATOR >

Abstract class, defines interface for sequential search method implementations, provides common implementation of the "sequential step" operation.

Note:

To prevent misunderstanding: _generalization_level here does not relate to classification peformance on unknown data, but to "generalization" of the course of search, i.e., the number of features added/removed while generating candidate subsets in one sequential step (higher generalization=more candidates). See book Devijver, Kittler, 1982 for discussion.

---

The documentation for this class was generated from the following file:

• search_seq.hpp