.png){kind=icon}
返回
Simple decision forests for multi-relational classification
.png){kind=icon}
OA
AI
DOI：10.1016/j.dss.2012.11.017.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An important task in multi-relational data mining is link-based classification which takes advantage of attributes of links and linked entities, to predict the class label. The relational Naive Bayes classifier exploits independence assumptions to achieve scalability. We introduce a weaker independence assumption to the effect that information from different data tables is independent given the class label. The independence assumption entails a closed-form formula for combining probabilistic predictions based on decision trees learned on different database tables. Logistic regression learns different weights for information from different tables and prunes irrelevant tables. In experiments, learning was very fast with competitive accuracy. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Link-based classification
Multi-relational Naive Bayes classifiers
Multi-relational decision trees
Logistic regression
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
