Learning CP-Nets Structure From Preference Data Streams

被引：1
|
作者：
Liu, Zhaowei [1 ,2 ]
Zhong, Zhaolin [2 ]
Zhang, Chenghui [1 ]
Yu, Yanwei [2 ]
Liu, Jinglei [2 ]
机构：
[1] Shandong Univ, Sch Control Sci & Engn, Jinan 250061, Shandong, Peoples R China
[2] Yantai Univ, Sch Comp Sci & Control Engn, Yantai 264005, Peoples R China
来源：
IEEE ACCESS | 2018年 / 6卷
基金：
中国国家自然科学基金;
关键词：
Preference learning; dynamic CP-net; data streams; incremental approach; GENERATION; NETWORK;
D O I：
10.1109/ACCESS.2018.2873087
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：56716 / 56726
页数：11
相关论文
共 50 条
  • [21] CP-nets:: A tool for representing and reasoning with conditional ceteris paribus preference statements
    Boutilier, C
    Brafman, RI
    Domshlak, C
    Hoos, HH
    Poole, D
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2004, 21 : 135 - 191
  • [22] Study on the Transformation From CP-nets to Game Theory
    Liu Zhaowei
    Liu Jinglei
    Sun Xuejiao
    COMPUTATIONAL MATERIALS SCIENCE, PTS 1-3, 2011, 268-270 : 1750 - 1754
  • [23] Constructing CP-Nets from Users Past Selection
    Khoshkangini, Reza
    Pini, Maria Silvia
    Rossi, Francesca
    AI 2019: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, 11919 : 130 - 142
  • [24] Constrained Optimization with Partial CP-nets
    Ahmed, Sultan
    Mouhoub, Malek
    2018 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2018, : 3361 - 3366
  • [25] Simplification of aggregation on multiple CP-nets
    Liu, Zhaowei
    Liu, Jinglei
    He, Lijian
    International Journal of Digital Content Technology and its Applications, 2012, 6 (11) : 102 - 108
  • [26] Making CP-Nets (More) Useful
    Allen, Thomas E.
    PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 3057 - 3058
  • [27] Aggregating CP-nets with Unfeasible Outcomes
    Grandi, Umberto
    Luo, Hang
    Maudet, Nicolas
    Rossi, Francesca
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2014, 2014, 8656 : 366 - 381
  • [28] An Approach to Approximating Dominance in CP-nets
    Huelsman, Michael
    Truszczynski, Miroslaw
    ALGORITHMIC DECISION THEORY (ADT 2019), 2019, 11834 : 170 - 171
  • [29] CP-nets with Indifference (Invited Paper)
    Allen, Thomas E.
    2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2013, : 1488 - 1495
  • [30] Generating CP-Nets Uniformly at Random
    Allen, Thomas E.
    Goldsmith, Judy
    Justice, Hayden E.
    Mattei, Nicholas
    Raines, Kayla
    THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 872 - 878
12345