This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing
Maximum Reliable Tree for Social Network Search
Sydney, New South Wales Australia
December 12-December 14
ISBN: 978-0-7695-4612-4
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.
Index Terms:
Social Network Search, Maximum Reliable Tree, Min-Spanning Tree, Ranking Measure, Graph Search
Citation:
Wookey Lee, James Jung-Hun Lee, Justin Jong-Su Song, Chris Soo-Hyun Eom, "Maximum Reliable Tree for Social Network Search," dasc, pp.1243-1249, 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing, 2011
Usage of this product signifies your acceptance of the Terms of Use.