Abstract

A consumer review network (CRN) is a social network among the members of a consumer review website where the relationships are formed based on the mutual ratings of the existing reviews of the participating members. The relationship is positive (negative) i.e. trust-based (distrust-based) when most of the reviews are given high (low) ratings. In a CRN, the consumers may not be interested in all product categories. The influence maximization in such a network demands seed set selection in such a way that the number of influenced consumers (with interest in the advertised product category) will be maximum. Formally, this is referred to as the targeted influence maximization (TIM) problem. Moreover, as the CRN is treated as a signed social network, the polarity of the social relationships impacts the influence propagation. As per the present state of the art, none of the existing solutions for TIM have considered the network as a signed one and are thus not suitable for CRN. In this paper, a metaheuristic discrete genetic-learning-enabled particle swarm optimization algorithm combined with a trustworthiness-heuristic-based local search strategy has been proposed for targeted positive influence maximization in CRNs. The existing spread estimation function has been replaced by a computationally efficient positive influence spread estimation function. The experiment has been conducted on two real-life CRNs and compared with the existing notable algorithm for necessary validation of the proposed solution.

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.