Abstract
Online social network services have become indispensable in people’s daily life. The analysis of data in social network services often involves data mining techniques. However, the quick increase of users in such services posts challenges to develop effective data mining algorithms to deal with large social network data. In this paper, we propose a data-mining algorithm to get the shortest path between nodes in a social network. Based on HBase[1], this algorithm analyzes the social network model, and uses the intermediary degrees and degree central algorithm to optimize the output from cloud platform. With a simulated social network, we validate the efficiency of the algorithm.
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 callDisclaimer: 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.
