Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

10-2011

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 ahyper-graph based index structure to support approximated CANN search efficiently.

Keywords

context-aware nearest neighbor search, social networks, network analytics

Discipline

Communication Technology and New Media | Databases and Information Systems | Numerical Analysis and Scientific Computing

Research Areas

Data Science and Engineering

Publication

Social informatics: Third International Conference, SocInfo 2011, Singapore, October 6-8: Proceedings

Volume

6984

First Page

98

Last Page

112

ISBN

9783642247040

Identifier

10.1007/978-3-642-24704-0_15

Publisher

Springer

City or Country

Cham

Copyright Owner and License

LARC

Additional URL

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

Share

COinS