Dynamically constructing user profiles with similarity-based online incremental clustering
International Journal of Advanced Intelligence Paradigms
A framework for rank computation and aggregation in fuzzy environments
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Opportunistic trust based P2P services framework for disconnected MANETs
ATC'10 Proceedings of the 7th international conference on Autonomic and trusted computing
Intelligent search in social communities of smartphone users
Distributed and Parallel Databases
| Hi-index | 0.00 |
Recently, there has been an increasing interest in a social network. In a social network, nodes and links represent participants and their friendships, respectively. We have designed and implemented a query propagation mechanism and its applications to realize a social network composed by cellular phone users. In these applications, users can retrieve information from their friends or their friends' friends by propagating the query in the network. To propagate a query in a wide range and improve the query success ratio, most users who receive the query must relay it to all their friends. However, this increases communication packets. In this paper, we propose a query routing method to decrease the number of communication packets by using user profiles.