Document Details
|
Document Type |
: |
Article In Journal |
|
Document Title |
: |
Decision tree ensembles based on kernel features فرق شجرة القرارات على أساس سمات النواة |
|
Subject |
: |
Computer Science |
|
Document Language |
: |
English |
|
Abstract |
: |
A classifier ensemble is a set of classifiers whose individual decisions are combined to classify new examples. Classifiers, which can represent complex decision boundaries are accurate. Kernel functions can also represent complex decision boundaries. In this paper, we study the usefulness of kernel features for decision tree ensembles as they can improve the representational power of individual classifiers. We first propose decision tree ensembles based on kernel features and found that the performance of these ensembles is strongly dependent on the kernel parameters; the selected kernel and the dimension of the kernel feature space. To overcome this problem, we present another approach to create ensembles that combines the existing ensemble methods with the kernel machine philosophy. In this approach, kernel features are created and concatenated with the original features. The classifiers of an ensemble are trained on these extended feature spaces. Experimental results suggest that the approach is quite robust to the selection of parameters. Experiments also show that different ensemble methods (Random Subspace, Bagging,Adaboost.M1 and Random Forests) can be improved by using this approach. |
|
ISSN |
: |
1573-7497 |
|
Journal Name |
: |
Applied Intelligence |
|
Volume |
: |
41 |
|
Issue Number |
: |
3 |
|
Publishing Year |
: |
1435 AH
2014 AD |
|
Article Type |
: |
Article |
|
Added Date |
: |
Monday, December 8, 2014 |
|
Researchers
| امير احمد | Ahmad, Amir | Investigator | Doctorate | amirahmad01@gmail.com |
|
Back To Researches Page
|