Paper Info
Title
Maximum Reliable Tree for Social Network Search
Abstract
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.
Year
DOI
Venue
2011
10.1109/DASC.2011.201
DASC
Keywords
Field
DocType
ranking measure,smart phone technologies,efficient social networks search,various social network search,social network,business corporation,effective social network search,social network search,reliable social network search,maximum reliable tree algorithm,effective development,min-spanning tree,maximum reliable tree,graph search,academic sphere,internet,graph theory,graph based method,social networking (online),public institutions,business corporations,graph-based method,algorithm design and analysis,spanning tree,search engine,algorithm design,search engines,web pages,reliability
Data science,Graph theory,Social network,Algorithm design,Web page,Consilience,Computer science,Public institution,Artificial intelligence,Excellence,Machine learning,The Internet
Conference
ISBN
Citations 
PageRank 
978-1-4673-0006-3
2
0.44
References 
Authors
19
4
Name
Order
Citations
PageRank
Wookey Lee119629.22
Jung Hun Lee221.79
Justin JongSu Song3555.16
Chris Soo-Hyun Eom4313.41