You have 134 unread mail] do you want to read them now?
Proc. of the IFIP WG 6.5 working conference on Computer-based message services
Ant-based load balancing in telecommunications networks
Adaptive Behavior
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Patterns of entry and correction in large vocabulary continuous speech recognition systems
Proceedings of the SIGCHI conference on Human Factors in Computing Systems
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Epidemic-Style Proactive Aggregation in Large Overlay Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Finding experts in community-based question-answering services
Proceedings of the 14th ACM international conference on Information and knowledge management
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
Proceedings of the 28th international conference on Software engineering
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Voting for candidates: adapting data fusion techniques for an expert search task
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
SuggestBot: using intelligent task routing to help people find work in wikipedia
Proceedings of the 12th international conference on Intelligent user interfaces
Broad expertise retrieval in sparse data environments
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Expertise-based peer selection in Peer-to-Peer networks
Knowledge and Information Systems
Routing Questions to the Right Users in Online Communities
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Anonymous opinion exchange over untrusted social networks
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
Re-examining price as a predictor of answer quality in an online q&a site
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Why users of yahoo!: answers do not answer questions
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
What do people ask their social networks, and why?: a survey study of status message q&a behavior
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
High quality expertise evidence for expert search
ECIR'08 Proceedings of the IR research, 30th European conference on Advances in information retrieval
A survey on the design, applications, and enhancements of application-layer overlay networks
ACM Computing Surveys (CSUR)
G-Finder: routing programming questions closer to the experts
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
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.