Abstract

In group-oriented recommendation filed, the design of a commonly acceptable recommendation list is a tough task. Traditional group recommendation algorithms often realize group recommendation list aggregation according to item ranking or item score of group members' recommendation lists. The factors considered in these algorithms are relatively one-sided. This paper puts forward a new HAaB aggregation algorithm for list aggregation, which considers the item ranking as well as the item score of the members' recommendation lists. Experimental results show that HAaB algorithm can obviously outperform the traditional group recommendation algorithms when recommending for various common combinations of groups.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.