CoEA: A Cooperative-Competitive Evolutionary Algorithm for Bidirectional Recommendations

2021 
In recent decades, recommender systems have been well studied and widely applied. However, most recommenders unilaterally optimize the results from the buying customers’ views without considering expectations of other participants, e.g, merchants. Unfortunately, the expectations of customers and merchants in recommendation are different or even conflicted. Especially for popular group-trading markets, customers and merchants are competing in trading, i.e., customers want to meet their preferences or obtain gains with personal favorite items, while merchants want to recommend wholesale items with setting group-trading terms or conditions. In addition, some practical constraints are not fully considered by prior systems. In this paper, we propose a Cooperative-Competitive Evolutionary Algorithm (i.e., CoEA) for the bidirectional recommendations in group-trading markets. Specifically, we respectively formalizes two sub-problems with designed objectives for two-sided participants in markets, and integrate the cooperative-competitive optimizations into one framework. Secondly, CoEA designs an binary encoding matrix for individual representation to integrate the two sub-problems. Further, by assembling game evolution process, CoEA designs cooperative-competitive evolution operators, i.e., the cooperative crossover and competitive mutation, which guide the solutions to equilibrium by respectively bridging communication between two populations of sub-problems and optimizing distinctive objective in each population. Finally, we construct two real applications involving bidirectional recommendations, i.e., the group buying and P2P lending, and conduct extensive experiments with the real-world datasets. By comparing CoEA with several representative recommendation algorithms and evolutionary algorithms, the experimental results clearly demonstrate the effectiveness of CoEA.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []