Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimizing web search using social annotations
Proceedings of the 16th international conference on World Wide Web
A large-scale evaluation and analysis of personalized search strategies
Proceedings of the 16th international conference on World Wide Web
Can social bookmarking improve web search?
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Exploring folksonomy for personalized search
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Efficient top-k querying over social-tagging networks
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Building community-centric information exploration applications on social content sites
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
On social networks and collaborative recommendation
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Personalization of tagging systems
Information Processing and Management: an International Journal
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Personalized social search based on the user's social network
Proceedings of the 18th ACM conference on Information and knowledge management
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Retrieving top-k prestige-based relevant spatial web objects
Proceedings of the VLDB Endowment
CubeLSI: An effective and efficient method for searching resources in social tagging systems
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Information retrieval in folksonomies: search and ranking
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Partitioned multi-indexing: bringing order to social search
Proceedings of the 21st international conference on World Wide Web
Context-aware top-K processing using views
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
We consider in this paper top-k query answering in social applications, with a focus on social tagging. This problem requires a significant departure from socially agnostic techniques. In a network- aware context, one can (and should) exploit the social links, which can indicate how users relate to the seeker and how much weight their tagging actions should have in the result build-up. We propose algorithms that have the potential to scale to current applications. While the problem has already been considered in previous literature, this was done either under strong simplifying assumptions or under choices that cannot scale to even moderate-size real-world applications. We first revisit a key aspect of the problem, which is accessing the closest or most relevant users for a given seeker. We describe how this can be done on the fly (without any pre- computations) for several possible choices -- arguably the most natural ones -- of proximity computation in a user network. Based on this, our top-k algorithm is sound and complete, addressing the applicability issues of the existing ones. Moreover, it performs significantly better in general and is instance optimal in the case when the search relies exclusively on the social weight of tagging actions. To further address the efficiency needs of online applications, for which the exact search, albeit optimal, may still be expensive, we then consider approximate algorithms. Specifically, these rely on concise statistics about the social network or on approximate shortest-paths computations. Extensive experiments on real-world data from Twitter show that our techniques can drastically improve response time, without sacrificing precision.