Abstract
We describe Aardvark, a social search engine. With Aardvark, users ask a question, either by instant message, e-mail, Web input, text message, or voice. Aardvark then routes the question to the person in the user's extended social network most likely to be able to answer that question. As compared to a traditional Web search engine, where the challenge lies in finding the right
document
to satisfy a user's information need, the challenge in a social search engine like Aardvark lies in finding the right
person
to satisfy a user's information need. Further, while trust in a traditional search engine is based on authority, in a social search engine like Aardvark, trust is based on intimacy. We describe how these considerations inform the architecture, algorithms, and user interface of Aardvark, and how they are reflected in the behavior of Aardvark users.
Publisher
Association for Computing Machinery (ACM)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Bootless Application of Greedy Re-ranking Algorithms in Fair Neural Team Formation;Communications in Computer and Information Science;2023
2. OpeNTF: A Benchmark Library for Neural Team Formation;Proceedings of the 31st ACM International Conference on Information & Knowledge Management;2022-10-17
3. Understanding expert finding systems: domains and techniques;Social Network Analysis and Mining;2018-08-30
4. Design for Networked Learning;The Future of Ubiquitous Learning;2015-07-29
5. E-Portfolios in Support of Informal Learning;International Journal of Human Capital and Information Technology Professionals;2014-07