Min-wise independent permutations (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Syntactic clustering of the Web
Selected papers from the sixth international conference on World Wide Web
A small approximately min-wise independent family of hash functions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Random Evolution in Massive Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
PocketLens: Toward a personal recommender system
ACM Transactions on Information Systems (TOIS)
Social matching: A framework and research agenda
ACM Transactions on Computer-Human Interaction (TOCHI)
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
A study of the short message service of a nationwide cellular network
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
The link-prediction problem for social networks
Journal of the American Society for Information Science and Technology
Survey: Urban pervasive applications: Challenges, scenarios and case studies
Computer Science Review
EsPRESSO: Efficient privacy-preserving evaluation of sample set similarity
Journal of Computer Security
Hi-index | 0.00 |
In this paper we propose a fully decentralized approach for recommending new contacts in the social network of mobile phone users. With respect to existing solutions, our approach is characterized by some distinguishing features. In particular, the application we propose does not assume any centralized coordination: it transparently collects and processes user information that is accessible in any mobile phone, such as the log of calls, the list of contacts or the inbox/outbox of short messages and exchanges it with other users. This information is used to recommend new friendships to other users. Furthermore, the information needed to perform recommendation is collected and exchanged between users in a privacy preserving way. Finally, information necessary to implement the application is exchanged transparently and opportunistically, by using the residual space in standard short messages occasionally exchanged between users. As a consequence, we do not ask users to change their habits in using SMS.