|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| 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
| ASCII Text | x | ||
| Wookey Lee, James Jung-Hun Lee, Justin Jong-Su Song, Chris Soo-Hyun Eom, "Maximum Reliable Tree for Social Network Search," Dependable, Autonomic and Secure Computing, IEEE International Symposium on, pp. 1243-1249, 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing, 2011. | |||
| BibTex | x | ||
| @article{ 10.1109/DASC.2011.201, author = {Wookey Lee and James Jung-Hun Lee and Justin Jong-Su Song and Chris Soo-Hyun Eom}, title = {Maximum Reliable Tree for Social Network Search}, journal ={Dependable, Autonomic and Secure Computing, IEEE International Symposium on}, volume = {0}, year = {2011}, isbn = {978-0-7695-4612-4}, pages = {1243-1249}, doi = {http://doi.ieeecomputersociety.org/10.1109/DASC.2011.201}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Dependable, Autonomic and Secure Computing, IEEE International Symposium on TI - Maximum Reliable Tree for Social Network Search SN - 978-0-7695-4612-4 SP1243 EP1249 A1 - Wookey Lee, A1 - James Jung-Hun Lee, A1 - Justin Jong-Su Song, A1 - Chris Soo-Hyun Eom, PY - 2011 KW - Social Network Search KW - Maximum Reliable Tree KW - Min-Spanning Tree KW - Ranking Measure KW - Graph Search VL - 0 JA - Dependable, Autonomic and Secure Computing, IEEE International Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DASC.2011.201
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.
