Abstract

Advantages of machine learning algorithms are compared in terms of “generalization,” which means how accurate they perform upon unseen data. There are many applications in which test data are available (obviously without target). A central question with regard to “generalization” is as follows: Would it be possible to deploy test feature vectors in the training phase? For test data, nonetheless, there is no target—this is the paradox. Transductive learning is a form of learning that uses test data in addition to train data in the training phase. Using decision tree as the base model reveals many errors occur on those data, the feature values of which, are very close to splitting values of decision tree’s nodes. This observation is the essence of answering the aforementioned paradox in this study. This paper proposes a combination of decision tree and a novel Fisher discriminant analysis, in which the proposed modified FDA has an embedded mechanism using test data as a shortcut to generalization. This combination further arranged in a boosting system with weights on both train and test data. Experiments are evaluated on 21 datasets from various fields. The results decisively demonstrate the promising performance of the proposed method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.