Abstract
SummaryFriendship prediction is an important aspect of a social network. Social network users rely a lot on friendship suggestion as it helps them in improving their network of friends. Moreover it has a huge impact in analyzing whom one is influenced by. In order to know this information it is not only essential to identify the potential friends, but also rank them to quantify their influence. To do this, we propose a learning to rank framework using the most popular machine learning technique, LambdaMART with a new boosting algorithm. Our framework provides unparalleled values of normalized discounted cumulative gain measure. We also analyze which feature of the social network is helpful in getting these nonpareil values. Our boosting algorithm yields an analytical solution for the over‐fitting problem with the increasing number of iterations, thereby augmenting the robustness of the framework.
Sign-in/Register to access full text options 
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 callMore From: Concurrency and Computation: Practice and Experience
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.
