{"title":"上下文感知偏好传播的基础","authors":"P. Ciaccia, D. Martinenghi, Riccardo Torlone","doi":"10.1145/3375713","DOIUrl":null,"url":null,"abstract":"Preferences are a fundamental ingredient in a variety of fields, ranging from economics to computer science, for deciding the best choices among possible alternatives. Contexts provide another important aspect to be considered in the selection of the best choices, since, very often, preferences are affected by context. In particular, the problem of preference propagation from more generic to more specific contexts naturally arises. Such a problem has only been addressed in a very limited way and always resorts to practical, ad hoc approaches. To fill this gap, in this article, we analyze preference propagation in a principled way and adopt an abstract context model without making any specific assumptions on how preferences are stated. Our framework only requires that the contexts form a partially ordered set and that preferences define a strict partial order on the objects of interest. We first formalize the basic properties that any propagation process should satisfy. We then introduce an algebraic model for preference propagation that relies on two abstract operators for combining preferences, and, under mild assumptions, we prove that the only possible interpretations for such operators are the well-known Pareto and Prioritized composition. We then study several propagation methods based on such operators and precisely characterize them in terms of the stated properties. We finally identify a method meeting all the requirements, on the basis of which we provide an efficient algorithm for preference propagation.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"40 1","pages":"1 - 43"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Foundations of Context-aware Preference Propagation\",\"authors\":\"P. Ciaccia, D. Martinenghi, Riccardo Torlone\",\"doi\":\"10.1145/3375713\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Preferences are a fundamental ingredient in a variety of fields, ranging from economics to computer science, for deciding the best choices among possible alternatives. Contexts provide another important aspect to be considered in the selection of the best choices, since, very often, preferences are affected by context. In particular, the problem of preference propagation from more generic to more specific contexts naturally arises. Such a problem has only been addressed in a very limited way and always resorts to practical, ad hoc approaches. To fill this gap, in this article, we analyze preference propagation in a principled way and adopt an abstract context model without making any specific assumptions on how preferences are stated. Our framework only requires that the contexts form a partially ordered set and that preferences define a strict partial order on the objects of interest. We first formalize the basic properties that any propagation process should satisfy. We then introduce an algebraic model for preference propagation that relies on two abstract operators for combining preferences, and, under mild assumptions, we prove that the only possible interpretations for such operators are the well-known Pareto and Prioritized composition. We then study several propagation methods based on such operators and precisely characterize them in terms of the stated properties. We finally identify a method meeting all the requirements, on the basis of which we provide an efficient algorithm for preference propagation.\",\"PeriodicalId\":17199,\"journal\":{\"name\":\"Journal of the ACM (JACM)\",\"volume\":\"40 1\",\"pages\":\"1 - 43\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the ACM (JACM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3375713\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the ACM (JACM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3375713","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Foundations of Context-aware Preference Propagation
Preferences are a fundamental ingredient in a variety of fields, ranging from economics to computer science, for deciding the best choices among possible alternatives. Contexts provide another important aspect to be considered in the selection of the best choices, since, very often, preferences are affected by context. In particular, the problem of preference propagation from more generic to more specific contexts naturally arises. Such a problem has only been addressed in a very limited way and always resorts to practical, ad hoc approaches. To fill this gap, in this article, we analyze preference propagation in a principled way and adopt an abstract context model without making any specific assumptions on how preferences are stated. Our framework only requires that the contexts form a partially ordered set and that preferences define a strict partial order on the objects of interest. We first formalize the basic properties that any propagation process should satisfy. We then introduce an algebraic model for preference propagation that relies on two abstract operators for combining preferences, and, under mild assumptions, we prove that the only possible interpretations for such operators are the well-known Pareto and Prioritized composition. We then study several propagation methods based on such operators and precisely characterize them in terms of the stated properties. We finally identify a method meeting all the requirements, on the basis of which we provide an efficient algorithm for preference propagation.