Maximum Reliable Tree for Social Network Search

As the overall size of the social networks has been exponentially expanding, the technological advance of efficient social networks search can flourish in the academic sphere, business corporations, and public institutions. Additionally, facing environmental upheaval in the field of information fusion and consilience, an effective development of various social network searches is gaining significance. In this research, we propose the use of the Maximum Reliable Tree algorithm that is newly developed based on a graph-based method, as a generic technique which facilitates effective social network search and that can be the most reliable social network search method for the promptly appearing smart phone technologies. We presented the method´s excellence in performance by demonstrating core arguments in formal descriptions, and illustrating experimental results.