Abstract
Friend recommendation is one of the primary functions in social networking services. Suggesting friends has been done by calculating node-to-node similarity based on topological location in a network or contents on a user's profile. However, this recommendation does not reflect the interest of the user. In this paper, we propose a friend recommendation problem in which the source user wants to get more attention from a special target. The goal of our friend recommendation is finding a set of nodes, which maximizes user's influence on the target. To deliver this problem, we introduce information propagation model on online social networks and define two measures: influence and reluctance. Based on the model, we suggest an IKA(Incremental Katz Approximation) algorithm to effectively recommend relevant users. Our method is compared with topology-based friend recommendation method on synthetic graph datasets, and we show interesting friend recommendation behaviors depending on the topological location of users.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.