.png){kind=icon}
返回
Learning CP-Nets Structure From Preference Data Streams
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2873087.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With the sharp increase of digital data emerging at present, the data in new applications are generated fast. Continuous cumulative data have gradually become massive and difficult to be handled due to limited workspace and limited amount of time. The conventional learning conditional preference networks' algorithm cannot successfully process the data streams. In this paper, we introduce the model of learning CP-nets from preference data streams and formalize the question. Then, an incremental approach is presented through which we can learn the CP-nets with gradually increasing data streams. The proposed method is verified on simulated data and real data, and it is also compared with other works.
Keyword:
Preference learning
dynamic CP-net
data streams
incremental approach
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions走向下一代推荐系统: 对最新技术和可能扩展的调查
PREAI
分享收藏
查看更多内容