谷歌浏览器插件
订阅小程序
在清言上使用

Relational tree ensembles and feature rankings

Knowledge-Based Systems(2022)

引用 1|浏览22
暂无评分
摘要
As the complexity of data increases, so does the importance of powerful representations, such as relational and logical representations, as well as the need for machine learning methods that can learn predictive models in such representations. A characteristic of these representations is that they give rise to a huge number of features to be considered, thus drastically increasing the difficulty of learning in terms of computational complexity and the curse of dimensionality. Despite this, methods for ranking features in this context, i.e., estimating their importance are practically non-existent.
更多
查看译文
关键词
Relational learning,Tree ensembles,Feature ranking,Propositionalization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要