Applying randomness effectively based on random forests for classification task of datasets of insufficient information (Q1952805): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Random forests / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bagging predictors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improvements on Cross-Validation: The .632+ Bootstrap Method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Supervised ranking in the WEKA environment / rank | |||
Normal rank |
Revision as of 11:19, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Applying randomness effectively based on random forests for classification task of datasets of insufficient information |
scientific article |
Statements
Applying randomness effectively based on random forests for classification task of datasets of insufficient information (English)
0 references
3 June 2013
0 references
Summary: Random forests are known to be good for data mining of classification tasks, because random forests are robust for datasets having insufficient information possibly with some errors. But applying random forests blindly may not produce good results, and a dataset in the domain of rotogravure printing is one of such datasets. Hence, in this paper, some best classification accuracy based on clever application of random forests to predict the occurrence of cylinder bands in rotogravure printing is investigated. Since random forests could generate good results with an appropriate combination of parameters like the number of randomly selected attributes for each split and the number of trees in the forests, an effective data mining procedure considering the property of the target dataset by way of trial random forests is investigated. The effectiveness of the suggested procedure is shown by experiments with very good results.
0 references
classification tasks
0 references
data mining
0 references
random forests
0 references