The Community for Technology Leaders
2013 IEEE 16th International Conference on Computational Science and Engineering (2009)
Vancouver, Canada
Aug. 29, 2009 to Aug. 31, 2009
ISBN: 978-0-7695-3823-5
pp: 1074-1081
ABSTRACT
In online social networks (OSNs), user connections can be represented as a network. The network formed has distinct properties that distinguish it from other network topologies. In this work, we consider an unstructured keyword based social network topology where each edge has a trust value associated with it to represent the mutual relationship between the corresponding nodes. Users have keywords as their profile attributes that have policies associated with them to define abstractly the flow of keyword information and the accessibility to other users in the network. We also address privacy concerns as outlined in works on future OSN architectures.This paper makes two key contributions. First, we develop an information flow model to disseminate keyword information when users add keywords as their profile attributes. Second, for keyword based queries, we design and develop a search algorithm to find users with the specified keywords in their profile attributes. It is based on a linear combination of topological distance and trust metrics. It is also dynamic in nature such that it adapts itself for each individual node during the search process. We observe an improvement in orders of magnitude when the search algorithm is compared to breadth first search.
INDEX TERMS
Information Flow Model, Information Search, Social Networks
CITATION
Ankush Garg, Prantik Bhattacharyya, Charles U. Martel, S. Felix Wu, "Information Flow and Search in Unstructured Keyword Based Social Networks", 2013 IEEE 16th International Conference on Computational Science and Engineering, vol. 04, no. , pp. 1074-1081, 2009, doi:10.1109/CSE.2009.92
88 ms
(Ver 3.3 (11022016))