Skip to main content
SpringerLink
Log in

Context-Aware Nearest Neighbor Query on Social Networks

  • Conference paper
Social Informatics (SocInfo 2011)

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

Included in the following conference series:

  • 1754 Accesses

Abstract

Social networking has grown rapidly over the last few years, and social networks contain a huge amount of content. However, it can be not easy to navigate the social networks to find specific information. In this paper, we define a new type of queries, namely context-aware nearest neighbor (CANN) search over social network to retrieve the nearest node to the query node that matches the context specified. CANN considers both the structure of the social network, and the profile information of the nodes. We design a hyper-graph based index structure to support approximated CANN search efficiently.

We would like to acknowledge that this research/project was carried out at the Living Analytics Research Centre (LARC), sponsored by Singapore National Research Foundation and Interactive & Digital Media Programme Office, Media Development Authority.

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

Access this chapter

Log in via an institution
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.

References

  1. Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput. 28, 210–236 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  3. Erwig, M.: The graph Voronoi diagram with applications. Networks 36(3), 156–163 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gaboille, C., Peleg, D., Pérennes, S., Raz, R.: Distance labeling in graphs. Journal of Algorithms 53(1), 85–112 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: SODA, pp. 156–165 (2005)

    Google Scholar 

  6. Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: ALENEX, pp. 100–111 (2004)

    Google Scholar 

  7. He, H., Wang, H., Yang, J., Yu, P.S.: Blinks: ranked keyword searches on graphs. In: SIGMOD, pp. 305–316 (2007)

    Google Scholar 

  8. Hu, H., Lee, D.L., Lee, V.C.S.: Distance indexing on road networks. In: VLDB, pp. 894–905 (2006)

    Google Scholar 

  9. Hulgeri, A., Nakhe, C.: Keyword searching and browsing in databases using banks. In: ICDE, pp. 431–443 (2002)

    Google Scholar 

  10. Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. TKDE 10(3), 409–432 (1998)

    Google Scholar 

  11. Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. TKDE 14(5), 1029–1046 (2002)

    Google Scholar 

  12. Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp. 505–516 (2005)

    Google Scholar 

  13. Lee, D., Leng, C.: Partitioned signature file: Design considerations and performance evaluation. TOIS 7(2), 158–180 (1989)

    Article  Google Scholar 

  14. Lee, D.L., Kim, Y.M., Patel, G.: Efficient signature file methods for text retrieval. TKDE 7(3), 423–435 (1995)

    Google Scholar 

  15. Leng, C., Lee, D.: Optimal weight assignment for signature generation. TODS 17(2), 346–373 (1992)

    Article  Google Scholar 

  16. Li, G., Feng, J., Chin Ooi, B., Wang, J., Zhou, L.: An effective 3-in-1 keyword search method over heterogeneous data sources. Inf. Syst. 36, 248–266 (2011)

    Article  Google Scholar 

  17. Burcher, N.: http://www.nickburcher.com/2010/03/facebook-usage-statistics-march-2010.html

  18. Peleg, D.: Proximity-preserving labeling schemes. J. Graph Theory 33, 167–176 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  19. Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD, pp. 43–54 (2008)

    Google Scholar 

  20. Wei, F.: TEDI: efficient shortest path query answering on graphs. In: SIGMOD, pp. 99–110 (2010)

    Google Scholar 

  21. Xiao, Y., Wu, W., Pei, J., Wang, W., He, Z.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: EDBT, pp. 493–504 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Singapore Management University, Singapore

    Yazhe Wang & Baihua Zheng

Authors
  1. Yazhe Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Baihua Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Engineering, Nanyang Technological University (NTU), Block N4, Nanyang Avenue, 639798, Singapore

    Anwitaman Datta

  2. University of Massachusetts Amherst, Thompson Hall, 200 Hicks Way, 01003, Amherst, MA, USA

    Stuart Shulman

  3. Singapore Management University, Singapore

    Baihua Zheng

  4. Graduate Institute of Networking and Multimedia, Department of Computer Science and Information Engineering, National Taiwan University,, Roosevelt Rd., 10617, Taipei, Taiwan

    Shou-De Lin

  5. School of Computer Engineering, Nanyang Technological University, Block N4, Nanyang Avenue, 639798, Singapore

    Aixin Sun

  6. School of Information Systems, Singapore Management University, 80 Stamford Rd, 178902, Singapore

    Ee-Peng Lim

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Y., Zheng, B. (2011). Context-Aware Nearest Neighbor Query on Social Networks. In: Datta, A., Shulman, S., Zheng, B., Lin, SD., Sun, A., Lim, EP. (eds) Social Informatics. SocInfo 2011. Lecture Notes in Computer Science, vol 6984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24704-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24704-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24703-3

  • Online ISBN: 978-3-642-24704-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation