Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Blind Chance: On Potential Trust Friends Query in Mobile Social Networks

  • Conference paper
Web-Age Information Management (WAIM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7923))

Included in the following conference series:

  • 3438 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Amir, A., Efrat, A., Myllymaki, J., Palaniappan, L.: Buddy track - Efficient proximity detection among mobile friends. In: INFOCOM, pp. 489–511 (2004)

    Google Scholar 

  2. Yiu, M., Hou, L., Saltenis, S., Tzoumas, K.: Efficient proximity detection among mobile users via self-tuning policies. In: VLDB, pp. 985–996 (2010)

    Google Scholar 

  3. Sidlauskas, D., Saltenis, S., Jensen, C.S.: Parallel main-memory indexing for moving-object query and update workloads. In: SIGMOD, pp. 37–48 (2012)

    Google Scholar 

  4. Cong, G., Jensen, C.S., Wu, D.: Efficient retrieval of the top-k most relevant spatial web objects. VLDBJ. 2(1), 337–348 (2009)

    Google Scholar 

  5. Han, J., Kamber, M.: Data ming: Concept and techniques, 2nd edn. Morgan Kaufmann (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, J., Meng, X. (2013). Blind Chance: On Potential Trust Friends Query in Mobile Social Networks. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds) Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38562-9_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38562-9_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38561-2

  • Online ISBN: 978-3-642-38562-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics