Blind chance: on potential trust friends query in mobile social networks

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Potential-Trust-Friends-Query is an important query in mobile social network, as it enables users to discover and interact with others happen to be in their physical vicinity. In our context, we attempt to find top-k mobile users for such query. We propose a novel trust scoring model that encompasses profile similarity, social closeness and interest similarity. Moveover, we devise a current-user-history-record (CUHR) index structure to support dynamic updates and efficient query processing. Based on CUHR index, we propose a query processing algorithm that exploits candidate generation-and-verification framework to answer queries. Extensive experiments was conducted on the real data set to illustrate the efficiency of our methods. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zhang, J., & Meng, X. (2013). Blind chance: on potential trust friends query in mobile social networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7923 LNCS, pp. 557–563). Springer Verlag. https://doi.org/10.1007/978-3-642-38562-9_56

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free