Estimating the Importance of Relational Features by Using Gradient Boosting

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With data becoming more and more complex, the standard tabular data format often does not suffice to represent datasets. Richer representations, such as relational ones, are needed. However, a relational representation opens a much larger space of possible descriptors (features) of the examples that are to be classified. Consequently, it is important to assess which features are relevant (and to what extent) for predicting the target. In this work, we propose a novel relational feature ranking method that is based on our novel version of gradient-boosted relational trees and extends the Genie3 score towards relational data. By running the algorithm on six well-known benchmark problems, we show that it yields meaningful feature rankings, provided that the underlying classifier can learn the target concept successfully.

Cite

CITATION STYLE

APA

Petković, M., Ceci, M., Kersting, K., & Džeroski, S. (2020). Estimating the Importance of Relational Features by Using Gradient Boosting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12117 LNAI, pp. 362–371). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-59491-6_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free