Abstract
PurposeUsing social networks to identify users with traits similar to those of the target user has proven highly effective in the development of personalized recommendation systems. Existing methods treat all dimensions of user data as a whole, despite the fact that most of the information related to different dimensions is discrete. This has prompted researchers to adopt the skyline query for such search functions. Unfortunately, researchers have run into problems of instability in the number of users identified using this approach.Design/methodology/approachWe thus propose the m-representative skyline queries to provide control over the number of similar users that are returned. We also developed an R-tree-based algorithm to implement the m-representative skyline queries.FindingsBy using the R-tree based algorithm, the processing speed of the m-representative skyline queries can now be accelerated. Experiment results demonstrate the efficacy of the proposed approach.Originality/valueNote that with this new way of finding similar users in the social network, the performance of the personalized recommendation systems is expected to be enhanced.
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.