Context-aware nearest neighbor query on social networks

Authors:
Yazhe Wang;Baihua Zheng
Affiliations:
Singapore Management University;Singapore Management University
Venue:
SocInfo'11 Proceedings of the Third international conference on Social informatics
Year:
2011

Citing 17
Cited 0

Partitioned signature files: design issues and performance evaluation

ACM Transactions on Information Systems (TOIS)
Optimal weight assignment for signature generation

ACM Transactions on Database Systems (TODS)
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t

SIAM Journal on Computing
Efficient Signature File Methods for Text Retrieval

IEEE Transactions on Knowledge and Data Engineering
Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation

IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps

IEEE Transactions on Knowledge and Data Engineering
Keyword Searching and Browsing in Databases using BANKS

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Distance labeling in graphs

Journal of Algorithms
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Bidirectional expansion for keyword search on graph databases

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Distance indexing on road networks

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
BLINKS: ranked keyword searches on graphs

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Scalable network distance browsing in spatial databases

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proximity-preserving labeling schemes

Journal of Graph Theory
Efficiently indexing shortest paths by exploiting symmetry in graphs

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
TEDI: efficient shortest path query answering on graphs

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
An effective 3-in-1 keyword search method over heterogeneous data sources

Information Systems

Quantified Score

Hi-index	0.00

Visualization

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.