A deniable and efficient question and answer service over ad hoc social networks
- 421 Downloads
When people are connected together over ad hoc social networks, it is possible to ask questions and retrieve answers using the wisdom of the crowd. However, locating a suitable candidate for answering a specific unique question within larger ad hoc groups is non-trivial, especially if we wish to respect the privacy of users by providing deniability. All members of the network wish to source the best possible answers from the network, while at the same time controlling the levels of attention required to generate them by the collective group of individuals and/or the time taken to read all the answers. Conventional expert retrieval approaches rank users for a given query in a centralised indexing process, associating users with material they have previously published. Such an approach is antithetical to privacy, so we have looked to distribute the routing of questions and answers, converting the indexing process into one of building a forwarding table. Starting from the simple operation of flooding the question to everyone, we compare a number of different routing options, where decisions must be made based on past performance and exploitation of the knowledge of our immediate neighbours. We focus on fully decentralised protocols using ant-inspired tactics to route questions towards members of the network who may be able to answer them well. Simultaneously, privacy concerns are acknowledged by allowing both question asking and answering to be plausibly deniable. We have found that via our routing method, it is possible to improve answer quality and also reduce the total amount of user attention required to generate those answers.
KeywordsExpert retrieval Ad hoc social networks Expert search Stigmergy Privacy via plausible deniability Real time Q&A routing
This work was supported by the Engineering and Physical Sciences Research Council, grant EP/F064330/1. We would like to thank Des Watson and the anonymous reviewers for their help in polishing this article.
- Aardvark. (2009). http://vark.com.
- Anvik, J., Hiew, L., & Murphy, G. C. (2006). Who should fix this bug? In Proceedings of the 28th international conference on software engineering, ICSE ‘06 (pp. 361–370). New York, NY, USA: ACM. doi: 10.1145/1134285.1134336.
- Arif, A. S., & Stuerzlinger, W. (2009). Analysis of text entry performance metrics. In Proceedings of the IEEE TIC-STH 2009 (pp. 100–105). IEEE.Google Scholar
- Balog, K., Bogers, T., Azzopardi, L., de Rijke, M., & van den Bosch, A. (2007). Broad expertise retrieval in sparse data environments. In Proceedings of the 30th annual international ACM SIGIR conference on research and development in information retrieval, SIGIR ‘07 (pp. 551–558). New York, NY, USA: ACM. doi: 10.1145/1277741.1277836.
- Barabási, A. L. (2005). The origin of bursts and heavy tails in human dynamics. Nature, 435, 207–211. doi: 10.1038/nature03459.
- Caro, G. D., Ducatelle, F., & Gambardella, L. M. (2005). Swarm intelligence for routing in mobile ad hoc networks. In Proceedings of the 2005 IEEE swarm intelligence symposium (SIS).Google Scholar
- Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001). Freenet: A distributed anonymous information storage and retrieval system. In International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability (pp. 46–66). Berkeley, CA : Springer-Verlag New York, Inc.Google Scholar
- Cosley, D., Frankowski, D., Terveen, L. G., & Riedl, J. (2007). Suggestbot: Using intelligent task routing to help people find work in wikipedia. Intelligent user interfaces, 3(4), 32–41. doi: 10.1145/1216295.1216309. http://dl.acm.org/citation.cfm?doid=1216295.1216309.
- Craswell, N., Hawking, D., Vercoustre, A. M., & Wilkins, P. (2001). P@noptic expert: Searching for experts not just for documents. In Ausweb (pp. 21–25).Google Scholar
- Dearman, D., & Truong, K. N. (2010). Why users of yahoo! answers do not answer questions. In Proceedings of the 28th international conference on human factors in computing systems, CHI ‘10 (pp. 329–332). New York, NY, USA: ACM. doi: 10.1145/1753326.1753376.
- Demartini, G. (2007). Finding experts using wikipedia. In Finding experts on the web with semantics (pp. 33–41).Google Scholar
- Erdős, P., & Rényi, A. (1959). On random graphs (Vol. 6, pp. 290–297). Debrecen: i. Publicationes Mathematicae.Google Scholar
- Gyongyi, Z., Koutrika, G., Pedersen, J., & Garcia-Molina, H. (2007). Questioning yahoo! answers. Technical report 2007-35, Stanford InfoLab. URL: http://ilpubs.stanford.edu:8090/819.
- Haase, P., Siebes, R., & van Harmelen, F. (2008). Expertise-based peer selection in peer-to-peer networks. Knowledge and Information Systems, 15(1), 75–107. doi: 10.1007/s10115-006-0055-1.
- Jelasity, M., & Montresor, A. (2004). Epidemic-style proactive aggregation in large overlay networks. In Proceedings of the 24th international conference on distributed computing systems (ICDCS ‘04) (pp. 102–109). Washington, DC, USA: IEEE Computer Society.Google Scholar
- Jeon, G. Y., Kim, Y. M., & Chen, Y. (2010). Re-examining price as a predictor of answer quality in an online Q&A site. In CHI ‘10 proceedings of the 28th international conference on human factors in computing systems (pp. 325–328). ACM. doi: 10.1145/1753326.1753375.
- Kacimi, M., Ortolani, S., & Crispo, B. (2009). Anonymous opinion exchange over untrusted social networks. In SNS ‘9 (pp. 26–32). New York, NY, USA: ACM. doi: 10.1145/1578002.1578007.
- Karat, C. M., Halverson, C., Horn, D., & Karat, J. (1999). Patterns of entry and correction in large vocabulary continuous speech recognition systems. In CHI ‘99 proceedings of the SIGCHI conference on human factors in computing systems: The CHI is the limit (pp. 568–575). New York, NY, USA: ACM. doi: 10.1145/302979.303160.
- Kurian, J., & Sarac, K. (2010). A survey on the design, applications, and enhancements of application-layer overlay networks. ACM Computing Surveys, 43(5), 1–5:34. doi: 10.1145/1824795.1824800.
- Li, W., Zhang, C., & Hu, S. (2010). G-finder: routing programming questions closer to the experts. In OOPSLA ‘10 proceedings of the ACM international conference on object oriented programming systems languages and applications (pp. 62–73). New York, NY, USA: ACM. doi: 10.1145/1869459.1869466.
- Liu, X., Croft, W. B., & Koll, M. (2005). Finding experts in community-based question-answering services. In CIKM ‘05 proceedings of the 14th ACM international conference on information and knowledge management (pp. 315–316). New York, NY, USA: ACM. doi: 10.1145/1099554.1099644.
- Macdonald, C., & Ounis, I. (2006). Voting for candidates: Adapting data fusion techniques for an expert search task. In CIKM ‘06 proceedings of the 15th ACM international conference on Information and knowledge management (pp. 387–396). New York, NY, USA: ACM. doi: 10.1145/1183614.1183671.
- Macdonald, C., Hannah, D., & Ounis, I. (2008). High quality expertise evidence for expert search. In European colloquium on IR research (pp. 283–295). doi: 10.1007/978-3-540-78646-7_27.
- Michlmayr, E. (2006). Ant algorithms for search in unstructured peer-to-peer networks. In ICDEW ‘06 proceedings of the 22nd international conference on data engineering workshops (p. 142). IEEE Computer Society, Washington, DC, USA. doi: 10.1109/ICDEW.2006.29.
- Palme, J. (1984). You have 134 unread mail do you want to read them now? In Proceedings of the IFIP WG 6.5 working conference on computer-based message services (pp. 175–184). New York, NY, USA: Elsevier North-Holland.Google Scholar
- Planetsim. (2009). Object oriented simulation framework for overlay networks. http://projects-deim.urv.cat/trac/planetsim.
- Reiter, M. K., & Rubin, A. D. (1998). Crowds: Anonymity for web transactions. In ACM transactions on information and system security, 1(1), 66–92. http://citeseer.nj.nec.com/284739.html.
- Ringel, M. M., Teevan, J., & Panovich, K. (2010). What do people ask their social networks, and why? A survey study of status message q&a behavior. In CHI ‘10 human factors in computing systems (pp. 1739–1748). ACM.Google Scholar
- Roth, M., & Wicker, S. (2003). Termite: Ad-hoc networking with stigmergy. In GLOBECOM ‘03 global telecommunications conference, 2003 (Vol. 5, pp. 2937–2941). IEEE.Google Scholar
- Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001). Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM ‘01 (pp. 149–160). New York, NY, USA: ACM. doi: 10.1145/383059.383071.
- Stutzbach, D., & Rejaie, R. (2006). Understanding churn in peer-to-peer networks. In IMC ‘06 proceedings of the 6th ACM SIGCOMM conference on internet measurement (pp. 189–202). New York, NY, USA: ACM. doi: 10.1145/1177080.1177105.
- Tang, C., Xu, Z., & Mahalingam, M. (2002). Peersearch: Efficient information retrieval in peer-to-peer networks. Tech. Rep. HPL-2002-198, HP Laboratories Palo Alto.Google Scholar
- Yahoo! (2009). Answers. http://answers.yahoo.co.
- Yahoo! Labs. (2009). Comprehensive questions and answers version 1.0.Google Scholar
- Yang, B., & Garcia-Molina, H. (2002). Improving search in peer-to-peer networks.Distributed Computing Systems. In International conference on 0:5. doi: 10.1109/ICDCS.2002.1022237.
- Zhang, D., & Lee, W. S. (2003). Question classification using support vector machines. In SIGIR ‘03 (pp. 26–32). New York, NY, USA: ACM. doi: 10.1145/860435.860443.
- Zhou, Y., Cong, G., Cui, B., Jensen, C. S., & Yao, J. (2009). Routing questions to the right users in online communities. In International conference on data engineering (pp. 700–711). doi: 10.1109/ICDE.2009.44.