Operators of preference composition for CP-nets |
| |
| Affiliation: | 1. International Business School, Shaanxi Normal University, Xi’an 710119, China;2. School of Economics & Management, China University of Petroleum, Qingdao 266580, China;3. School of Management, Wuhan University of Technology, Wuhan 430070, China;4. Department of Electrical & Computer Engineering, University of Alberta, Alberta T6G 2R3, Canada;5. LeBow College of Business, Drexel University, Philadelphia, PA 19104, USA;6. Department of Electrical and Computer Engineering, Faculty of Engineering, King Abdulaziz University, Jeddah 21589, Saudi Arabia;7. Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland;1. The MOE Key Laboratory of Intelligent Computing & Information Processing, Xiangtan University, Xiangtan 411105, China;2. College of Information Engineering, Xiangtan University, Xiangtan 411105, China;1. Department of Business Administration, Hansung University, Seoul, South Korea;2. Department of Business Administration, Seoul National University, Seoul, South Korea;3. Department of Business Administration, Sangji Youngseo College, 660 Usan-dong, Wonju-si, Gangwon-do 26339, South Korean;1. Department of Computer Engineering, Omer Halisdemir University, 51245 Nigde, Turkey;2. Department of Computer Engineering, Erciyes University, 38039 Kayseri, Turkey |
| |
| Abstract: | Now the handling of user preference is becoming an increasingly important issue in database fields where they capture soft criteria for queries. A broader category of qualitative preferences with dependent relations among multiple attributes is widely existing, which is CP-nets. In this article, we focus on designing the operators of preference composition for CP-nets. Firstly, we extend Pareto composition to our model by including equivalence relation ≈, incomparability relation ∥ and conflicting relation ⊥, which can preserve a strict partial order and conditional associativity. On this basis, two questions are solved: (a) the generation of satisfiability sequences for CP-nets, (b) the top-k queries of relational database with CP-nets preference. For (a), a CP-net is induced into multiple tables, consequently the strong dominance tests between outcomes can be solved by using preference composition instead of using induced preference graph of CP-nets. For (b), we adopt the concept of Query Lattice to provide a natural semantics for the block sequence answering a preference query, where two algorithms (called QOCP and IQOCP) are introduced. These questions are solved efficiently and effectively at the perspective of combination of graph model and relational database. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
