Top-k retrieval using conditional preference networks

Authors:
Hongbing Wang;Xuan Zhou;Wujin Chen;Peisheng Ma
Affiliations:
Southeast University, Nanjing, China;Renmin University of China, Beijing, China;Southeast University, Nanjing, China;Southeast University, Nanjing, China
Venue:
Proceedings of the 21st ACM international conference on Information and knowledge management
Year:
2012

Citing 9
Cited 0

Optimal aggregation algorithms for middleware

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Skyline Operator

Proceedings of the 17th International Conference on Data Engineering
Evaluating Top-k Selection Queries

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Context-sensitive ranking

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Foundations of preferences in database systems

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The computational complexity of dominance and consistency in CP-nets

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reasoning with conditional ceteris paribus preference statements

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers top-k retrieval using Conditional Preference Network (CP-Net). As a model for expressing user preferences on multiple mutually correlated attributes, CP-Net is of great interest for decision support systems. However, little work has addressed how to conduct efficient data retrieval using CP-Nets. This paper presents an approach to efficiently retrieve the most preferred data items based on a user's CP-Net. The proposed approach consists of a top-k algorithm and an indexing scheme. We conducted extensive experiments to compare our approach against a baseline top-k method - sequential scan. The results show that our approach outperform sequential scan in several circumstances.