User preferences play a central role in supporting complex and multifactorial decision processes. Every personalized information filtering system should exploit a preferences model of the user in order to match her interests as much as possible. In a Linked Open Data (LOD) setting, the problem is twofold. On the one hand, there is the need of a standard way to represent complex preferences. On the other hand, we need tools able to query LOD datasets by taking into account user’s preferences. In this paper, we propose a vocabulary to represent statements formulated in terms of ceteris paribus semantics. We then show (i) how to represent a CP-net by means of this vocabulary and (ii) how to embed such compact preference model in a SPARQL 1.1 query in order to access semantic data in a personalized way.

Rosati, J., Di Noia, T., Lukasiewicz, T., De Leone, R., Maurino, A. (2015). Preference queries with ceteris paribus semantics for linked data. In On the Move to Meaningful Internet Systems: OTM 2015 Conferences Confederated International Conferences: CoopIS, ODBASE, and C&TC 2015, Rhodes, Greece, October 26-30, 2015. Proceedings (pp.423-442). Springer Verlag [10.1007/978-3-319-26148-5_28].

Preference queries with ceteris paribus semantics for linked data

Maurino A.
2015

Abstract

User preferences play a central role in supporting complex and multifactorial decision processes. Every personalized information filtering system should exploit a preferences model of the user in order to match her interests as much as possible. In a Linked Open Data (LOD) setting, the problem is twofold. On the one hand, there is the need of a standard way to represent complex preferences. On the other hand, we need tools able to query LOD datasets by taking into account user’s preferences. In this paper, we propose a vocabulary to represent statements formulated in terms of ceteris paribus semantics. We then show (i) how to represent a CP-net by means of this vocabulary and (ii) how to embed such compact preference model in a SPARQL 1.1 query in order to access semantic data in a personalized way.
paper
Ceteris paribus; CP-nets; Linked data; Preference queries; SPARQL; User preferences;
English
International Conferences on On the Move to Meaningful Internet Systems, OTM 2015 - October 26-30, 2015
2015
Debruyne, C; Panetto, H; Meersman, R; Dillon, T; Weichhart, G; An, Y; Ardagna, CA
On the Move to Meaningful Internet Systems: OTM 2015 Conferences Confederated International Conferences: CoopIS, ODBASE, and C&TC 2015, Rhodes, Greece, October 26-30, 2015. Proceedings
9783319261478
2015
9415
423
442
none
Rosati, J., Di Noia, T., Lukasiewicz, T., De Leone, R., Maurino, A. (2015). Preference queries with ceteris paribus semantics for linked data. In On the Move to Meaningful Internet Systems: OTM 2015 Conferences Confederated International Conferences: CoopIS, ODBASE, and C&TC 2015, Rhodes, Greece, October 26-30, 2015. Proceedings (pp.423-442). Springer Verlag [10.1007/978-3-319-26148-5_28].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/607041
Citazioni
  • Scopus 6
  • ???jsp.display-item.citation.isi??? ND
Social impact