.png){kind=icon}
返回
A scalable decision-tree-based method to explain interactions in dyadic data
.png){kind=icon}
OA
AI
DOI：10.1016/j.dss.2019.113141.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Gaining relevant insight from a dyadic dataset, which describes interactions between two entities, is an open problem that has sparked the interest of researchers and industry data scientists alike. However, the existing methods have poor explainability, a quality that is becoming essential in certain applications. We describe an explainable and scalable method that, operating on dyadic datasets, obtains an easily interpretable high-level summary of the relationship between entities. To do this, we propose a quality measure, which can be configured to a level that suits the user, that factors in the explainability of the model. We report experiments that confirm better results for the proposed method over alternatives, in terms of both explainability and accuracy. We also analyse the method's capacity to extract relevant actionable information and to handle large datasets.
Keyword:
Dyadic data
Machine teaming
Interpretable machine learning
Explainable artificial intelligence
Scalable machine learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.8
论文数:
3.8K
被引数:
1.5W
机构
引用论文
.png){kind=icon}
An extended self-organizing map network for market segmentation - a telecommunication example用于市场细分的扩展自组织地图网络-电信示例
PREAI
分享收藏Evolutionary Fuzzy Systems for Explainable Artificial Intelligence: Why, When, What for, and Where to?可解释人工智能的进化模糊系统: 为什么，何时，为什么以及在哪里？
OAAI
OAAI分享收藏Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks基于非重访随机游走的动态无线传感器网络查询
PREAI
分享收藏
查看更多内容