2009
DOI: 10.1007/978-3-642-03070-3_16
|View full text |Cite
|
Sign up to set email alerts
|

Relevance and Redundancy Analysis for Ensemble Classifiers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
27
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
5
4

Relationship

2
7

Authors

Journals

citations
Cited by 21 publications
(27 citation statements)
references
References 13 publications
0
27
0
Order By: Relevance
“…The features are checked in pairs using redundancy analysis method [23,24]. Firstly, two sets of feature vectors, 1 and 2 , are selected randomly from the feature set obtained by ReliefF.…”
Section: Feature Integration Methods Based On Compressed Randommentioning
confidence: 99%
“…The features are checked in pairs using redundancy analysis method [23,24]. Firstly, two sets of feature vectors, 1 and 2 , are selected randomly from the feature set obtained by ReliefF.…”
Section: Feature Integration Methods Based On Compressed Randommentioning
confidence: 99%
“…If the SU between the feature and the class equals 1, this feature is definitely related to that class. However, if the SU is equal to 0, the features are believed to be irrelevant to this class [35].…”
Section: Data Set Relevance Analysismentioning
confidence: 99%
“…Duangsoithong and Windeatt [10] presented a method for reducing the data volume in the series which have high features and low samples as well as classification performance. By removing the irrelevant and repetitive data, new data sets are created.…”
Section: Introductionmentioning
confidence: 99%