File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Fairness-Aware Group Recommendation with Pareto-Efficiency

TitleFairness-Aware Group Recommendation with Pareto-Efficiency
Authors
Issue Date2017
PublisherACM.
Citation
The 11th ACM Conference on Recommender Systems, Como, Italy, 27-31 August 2017, p. 107-115 How to Cite?
AbstractGroup recommendation has attracted significant research efforts for its importance in benefiting a group of users. This paper investigates the Group Recommendation problem from a novel aspect, which tries to maximize the satisfaction of each group member while minimizing the unfairness between them. In this work, we present several semantics of the individual utility and propose two concepts of social welfare and fairness for modeling the overall utilities and the balance between group members. We formulate the problem as a multiple objective optimization problem and show that it is NP-Hard in different semantics. Given the multiple-objective nature of fairness-aware group recommendation problem, we provide an optimization framework for fairness-aware group recommendation from the perspective of Pareto Efficiency. We conduct extensive experiments on real-world datasets and evaluate our algorithm in terms of standard accuracy metrics. The results indicate that our algorithm achieves superior performances and considering fairness in group recommendation can enhance the recommendation accuracy.
Persistent Identifierhttp://hdl.handle.net/10722/245454
ISBN
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLin, X-
dc.contributor.authorZhang, M-
dc.contributor.authorZhang, Y-
dc.contributor.authorGu, Z-
dc.contributor.authorLiu, Y-
dc.contributor.authorMa, S-
dc.date.accessioned2017-09-18T02:11:00Z-
dc.date.available2017-09-18T02:11:00Z-
dc.date.issued2017-
dc.identifier.citationThe 11th ACM Conference on Recommender Systems, Como, Italy, 27-31 August 2017, p. 107-115-
dc.identifier.isbn978-1-4503-4652-8-
dc.identifier.urihttp://hdl.handle.net/10722/245454-
dc.description.abstractGroup recommendation has attracted significant research efforts for its importance in benefiting a group of users. This paper investigates the Group Recommendation problem from a novel aspect, which tries to maximize the satisfaction of each group member while minimizing the unfairness between them. In this work, we present several semantics of the individual utility and propose two concepts of social welfare and fairness for modeling the overall utilities and the balance between group members. We formulate the problem as a multiple objective optimization problem and show that it is NP-Hard in different semantics. Given the multiple-objective nature of fairness-aware group recommendation problem, we provide an optimization framework for fairness-aware group recommendation from the perspective of Pareto Efficiency. We conduct extensive experiments on real-world datasets and evaluate our algorithm in terms of standard accuracy metrics. The results indicate that our algorithm achieves superior performances and considering fairness in group recommendation can enhance the recommendation accuracy.-
dc.languageeng-
dc.publisherACM.-
dc.relation.ispartofRecSys '17 Proceedings of the Eleventh ACM Conference on Recommender Systems-
dc.titleFairness-Aware Group Recommendation with Pareto-Efficiency-
dc.typeConference_Paper-
dc.identifier.emailGu, Z: zqgu@hku.hk-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1145/3109859.3109887-
dc.identifier.scopuseid_2-s2.0-85030459584-
dc.identifier.hkuros278398-
dc.identifier.spage107-
dc.identifier.epage115-
dc.identifier.isiWOS:000426967000019-
dc.publisher.placeNew York, NY-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats