short-paper

Top-k retrieval using conditional preference networks

Authors:

Hongbing Wang,

Xuan Zhou,

Wujin Chen,

Peisheng MaAuthors Info & Claims

CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management

Pages 2075 - 2079

https://doi.org/10.1145/2396761.2398576

Published: 29 October 2012 Publication History

Get Access

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.

References

[1]

C. Boutilier, R. I. Brafman, H. H. Hoos, and D. Poole, "Reasoning with conditional ceteris paribus preference statements," in UAI, 1999, pp. 71--80.

Digital Library

Google Scholar

[2]

C. Boutilier, R. I. Brafman, C. Domshlak, H. H. Hoos, and D. Poole, "Cp-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements," J. Artif. Intell. Res. (JAIR), vol. 21, pp. 135--191, 2004.

Crossref

Google Scholar

[3]

W. Kießling, "Foundations of preferences in database systems," in VLDB '02: Proceedings of the 28th international conference on Very Large Data Bases. VLDB Endowment, 2002, pp. 311--322.

Digital Library

Google Scholar

[4]

R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," in PODS '01: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. New York, NY, USA: ACM, 2001, pp. 102--113.

Digital Library

Google Scholar

[5]

S. Chaudhuri and L. Gravano, "Evaluating top-k selection queries," in VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1999, pp. 397--410.

Digital Library

Google Scholar

[6]

S. Börzsönyi, D. Kossmann, and K. Stocker, "The skyline operator," in Proceedings of the 17th International Conference on Data Engineering. Washington, DC, USA: IEEE Computer Society, 2001, pp. 421--430.

Digital Library

Google Scholar

[7]

R. Agrawal, R. Rantzau, and E. Terzi, "Context-sensitive ranking," in SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data. New York, NY, USA: ACM, 2006, pp. 383--394.

Digital Library

Google Scholar

[8]

J. Goldsmith, J. Lang, M. Truszczynski, and N. Wilson, "The computational complexity of dominance and consistency in cp-nets," in IJCAI, 2005, pp. 144--149.

Digital Library

Google Scholar

[9]

C. Domshlak, F. Rossi, K. B. Venable, and T. Walsh, "Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques," CoRR, vol. abs/0905.3766, 2009.

Digital Library

Google Scholar

Cited By

View all

Di Noia TLukasiewicz TMartinez MSimari GTifrea-Marciuska O(2015)Combining existential rules with the power of CP-theoriesProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832581.2832657(2918-2925)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832581.2832657
Noia TLukasiewicz TMartinez MSimari GTifrea-Marciuska O(2013)Ontological CP-NetsRevised Selected Papers of the ISWC International Workshops on Uncertainty Reasoning for the Semantic Web III - Volume 881610.5555/2788478.2788493(289-308)Online publication date: 21-Oct-2013
https://dl.acm.org/doi/10.5555/2788478.2788493

Index Terms

Top-k retrieval using conditional preference networks
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Pareto Optimality for Conditional Preference Networks with Comfort
Advances and Trends in Artificial Intelligence. From Theory to Practice
Abstract
A Conditional Preference Network with Comfort (CPC-net) graphically represents both preference and comfort. Preference and comfort indicate user’s habitual behavior and genuine decisions correspondingly. Given that these two concepts might be ...
Preference elicitation in prioritized skyline queries

Preference queries incorporate the notion of binary preference relation into relational database querying. Instead of returning all the answers, such queries return only the best answers, according to a given preference relation. ...
Learning conditional preference networks

Conditional preference networks (CP-nets) have recently emerged as a popular language capable of representing ordinal preference relations in a compact and structured manner. In this paper, we investigate the problem of learning CP-nets in the well-...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management

October 2012

2840 pages

ISBN:9781450311564

DOI:10.1145/2396761

General Chair:
Xuewen Chen
Wayne State University, USA
,
Program Chairs:
Guy Lebanon
Georgia Institute of Technology
,
Haixun Wang
Microsoft Research Asia
,
Mohammed J. Zaki
Rensselaer Polytechnic Institute

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 October 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

CIKM'12

Sponsor:

CIKM'12: 21st ACM International Conference on Information and Knowledge Management

October 29 - November 2, 2012

Hawaii, Maui, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
208
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 21 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Di Noia TLukasiewicz TMartinez MSimari GTifrea-Marciuska O(2015)Combining existential rules with the power of CP-theoriesProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832581.2832657(2918-2925)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832581.2832657
Noia TLukasiewicz TMartinez MSimari GTifrea-Marciuska O(2013)Ontological CP-NetsRevised Selected Papers of the ISWC International Workshops on Uncertainty Reasoning for the Semantic Web III - Volume 881610.5555/2788478.2788493(289-308)Online publication date: 21-Oct-2013
https://dl.acm.org/doi/10.5555/2788478.2788493

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Pareto Optimality for Conditional Preference Networks with Comfort

Preference elicitation in prioritized skyline queries

Learning conditional preference networks