Open Access Open Access  Restricted Access Subscription or Fee Access

QSS: Question and Answer System Based on Social Networks for Non-Factual Queries

S. Sruthi, V.N. Rajavarman


Mobile Q&A systems, where mobile nodes access the Q&A systems through Internet, are very promising considering the rapid increase of mobile users and the convenience of practical use. However, such systems cannot directly use the previous centralized methods or broadcasting methods, which generate high cost of mobile Internet access, node overload, and high server bandwidth cost with the tremendous number of mobile users. Proposing a distributed Social-based mobile Q&A System (QSS) with low overhead and system cost as well as quick response to question askers. QSS enables mobile users to forward questions to potential answerers in their friend lists in a decentralized manner for a number of hops before resorting to the server. It leverages lightweight knowledge engineering techniques to accurately identify friends who are able to and willing to answer questions, thus reducing the search and computation costs of mobile nodes. It will give quick response for non-factual queries as well as colloquial languages


Centralized, Broadcasting, QsS, Non-Factual Queries, Colloquial

Full Text:



Google,, 2013.

Bing,, 2013.

B.M. Evans and E.H. Chi, “An Elaborated Model of Social Search,” J. Information Processing and Management, vol. 46, pp. 656-678, 2009.

L. Terveen, W. Hill, B. Amento, D. McDonald, and J. Creter, “PHOAKS: A System for Sharing Recommendations,” Comm. ACM, vol. 40, pp. 59-62, 1997.

M.S. Ackerman, “Augmenting Organizational Memory: A Field Study of Answer Garden,” ACM Trans. Information Systems, vol. 16, pp. 203-224, 1998.

L.G. Terveen, P.G. Selfridge, and M.D. Long, “Living Design Memory: Framework, Implementation, Lessons Learned,” Human-Computer Interaction, vol. 10, pp. 1-37, 1995.

E. Amitay, D. Carmel, N. Har’El, S. Ofek Koifman, A. Soffer, S. Yogev, and N. Golbandi, “Social Search and Discovery Using a Unified Approach,” Proc. 20th ACM Conf. Hypertext and Hypermedia (HT ’09), 2009.

D. Carmel, N. Zwerdling, I. Guy, S. Ofek-Koifman, N. Har’el, I. Ronen, E. Uziel, S. Yogev, and S. Chernov, “Personalized Social Search Based on the User’s Social Network,” Proc. 18th ACM Conf. Information and Knowledge Management (CIKM ’09), 2009.

S. Kolay and A. Dasdan, “The Value of Socially Tagged URLs for a Search Engine,” Proc. 18th Int’l Conf. World Wide Web (WWW ’09), 2009.

S. Bao, G. Xue, X. Wu, Y. Yu, B. Fei, and Z. Su, “Optimizing Web Search Using Social Annotations,” Proc. 16th Int’l Conf. World Wide Web (WWW ’07), 2007.

H.H. Chen, L. Gou, X. Zhang, and C.L. Giles, “CollabSeer: A Search Engine for Collaboration Discovery,” Proc. 11th Ann. Int’l ACM/IEEE Joint Conf. Digital Libraries (JCDL ’11), 2011.

C.Y. Lin, N. Cao, S.X. Liu, S. Papadimitriou, J. Sun, and X. Yan, “Smallblue: Social Network Analysis for Expertise Search and Collective Intelligence,” Proc. IEEE 25th Int’l Conf. In Data Engineering (ICDE ’09), 2009.

H. Kautz, B. Selman, and M. Shah, “Referral Web: Combining Social Networks and Collaborative Filtering,” Comm. ACM, vol. 40, pp. 63-65, 1997.

D.W. McDonald and M.S. Ackerman, “Expertise Recommender: A Flexible Recommendation System and Architecture,” Proc. ACM Conf. Computer Supported Cooperative Work (CSCW ’00), 2000.

Yahoo answer,, 2013., 2013.

F. Harper, D. Raban, S. Rafaeli, and J. Konstan, “Predictors of Answer Quality in Online Q&A Sites,” Proc. SIGCHI Conf. Human Factors in Computing Systems (SIGCHI ’08), 2008.

M.R. Morris, J. Teevan, and K. Panovich, “What Do People Ask Their Social Networks, and Why?: A Survey Study of Status Message Q&A Behavior,” Proc. SIGCHI Conf. Human Factors in Computing Systems (CHI ’10), 2010.

J. Teevan, M.R. Morris, and K. Panovich, “Factors Affecting Response Quantity, Quality, and Speed for Questions Asked via Social Network Status Messages,” Proc. ICWSM, 2011.

R.W. White, M. Richardson, and Y. Liu, “Effects of Community Size and Contact Rate in Synchronous Social Q&A,” Proc. SIGCHI Conf. Human Factors in Computing Systems, 2011.

M. Richardson and R.W. White, “Supporting Synchronous Social q&a Throughout the Question Lifecycle,” Proc. 20th Int’l Conf. World Wide Web (WWW ’11), 2011.

D. Horowitz and S.D. Kamvar, “The Anatomy of a Large-Scale Social Search Engine,” Proc. 19th Int’l Conf. World Wide Web (WWW ’10), 2010.

Twitter,, 2013.

Mobile internet stats roundup,, 2013.

Facebook may be growing too fast,, 2013.

A. Mtibaa, M. May, C. Diot, and M. Ammar, “Peoplerank: Social Opportunistic Forwarding,” Proc. IEEE INFOCOM, 2010.

J. Raacke and J. Bonds-Raacke, “MySpace and Facebook: Applying the Uses and Gratifications Theory to Exploring Friend-Networking Sites,” CyberPsychology & Behavior, vol. 11, p. 169, 2008.

M.R. Morris, J. Teevan, and K. Panovich, “A Comparison of Information Seeking Using Search Engines and Social Networks,” Proc. Fourth Int’l AAAI Conf. Weblogs and Social Media (ICSWM ’10), 2010.

Z. Li, H. Shen, G. Liu, and J. Li, “SOS: A Distributed Context- Aware Question Answering System Based on Social Networks,” Proc. IEEE 32nd Int’l Conf. Distributed Computing Systems (ICDCS ’12), 2012.

Readwriteweb,, 2013.

R.M. Smullyan, First-Order Logic. Dover Publications, 1995.

K. Toutanova and C.D. Manning, “Enriching the Knowledge Sources Used in a Maximum Entropy Part-of-Speech Tagger,” Proc. Joint SIGDAT Conf. Empirical Methods in Natural Language Processing and Very Large Corpora (SIGDAT ’00), 2000.

C. Manning and H. Schuetze, Foundations of Statistical Natural Language Processing. The MIT Press, June 1999.

N. Lao, T. Mitchell, and W.W. Cohen, “Random Walk Inference and Learning in a Large Scale Knowledge Base,” Proc. Conf. Empirical Methods in Natural Language Processing (EMNLP ’11), 2011.

M. Kirsten and S. Wrobel, “Extending K-Means Clustering to First-Order Representations,” Proc. Inductive Logic Programming 10th Int’l Conf. (ICILP ’00), 2000.

Z. Li, H. Shen, and K. Sapra, “Leveraging Social Networks to Combat Collusion in Reputation Systems for Peer-to-Peer Networks,” Proc. IEEE Int’l Parallel and Distributed Processing Symp. (IPDPS ’11), 2011.

Z. Li and H. Shen, “SOAP: A Social Network Aided Personalized and Effective Spam Filter to Clean Your E-mail box,” Proc. IEEE INFOCOM, 2011.

C. Binzel and D. Fehr, “How Social Distance Affects Trust and Cooperation: Experimental Evidence in a Slum,” Proc. ERF 16th Annual Conference: Shocks, Vulnerability and Therapy, 2009.

E-commerce,, 2013.

S. Chakrabarti, “Dynamic Personalized Pagerank in Entity- Relation Graphs,” Proc. 16th Int’l Conf. World Wide Web (WWW ’07), 2007.

M.F. Bulut, Y.S. Yilmaz, and M. Demirbas, “Crowdsourcing Location-Based Queries,” Proc. IEEE Int’l Conf. Pervasive Computing and Comm. Workshops (PERCOMW ’11), 2011.

B.M. Evans, S. Kairam, and P. Pirolli, “Exploring the Cognitive Consequences of Social Search,” Proc. CHI ’09 Extended Abstracts on Human Factors in Computing Systems (CHI EA ’09), 2009.

B. Hecht, J. Teevan, M.R. Morris, and D. Liebling, “Search Buddies: Bringing Search Engines into the Conversation,” Proc. ICWSM, 2012.

C. Lampe, J. Vitak, R. Gray, and N.B. Ellison, “Perceptions of Facebook’s Value as an Information Source,” Proc. SIGCHI Conf. Human Factors in Computing Systems (CHI ’12), 2012.

O. Escalante, T. P_erez, J. Solano, and I. Stojmenovic, “Sparse Structures for Searching and Broadcasting Algorithms over Internet Graphs and Peer-to Peer Computing Systems,” Peer-to-Peer Networking and Applications, 2011.

S. Ioannidis and P. Marbach, “On the Design of Hybrid Peer-to- Peer Systems,” Proc. ACM SIGMETRICS Int’l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS ’08), 2008.

R. Ahmed and R. Boutaba, “Plexus: A Scalable Peer-to-Peer Protocol Enabling Efficient Subset Search,” IEEE/ACM Trans. Networking (TON), vol. 17, no. 1, pp. 130-143, Feb. 2009.

M. Yang and Y. Yang, “An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing,” IEEE Trans. Computers, vol. 59, no. 9, pp. 1158-1171, Sept. 2010.

H.-W. Ferng and I. Christanto, “A Globally Overlaid Hierarchical p2p-Sip Architecture with Route Optimization,” IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 11, pp. 1826-1833, Nov. 2011.

H. Shen and K. Hwang, “Locality-Preserving Clustering and Discovery of Resources in Wide-Area Distributed Computational Grids,” IEEE Trans. Computers, vol. 61, no. 4, pp. 458-473, Apr. 2012.

H. Shen and C. Xu, “Hash-Based Proximity Clustering for Efficient Load Balancing in Heterogeneous DHT Networks,” J. Parallel and Distributed Computing, vol. 68, no. 5, pp. 686-702, May 2008.

H. Shen and C. Xu, “Locality-Aware and Churn-Resilient Load Balancing Algorithms in Structured Peer-to-Peer Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, pp. 849- 862, June 2007.

H. Chandler, H. Shen, L. Zhao, J. Stokes, and J. Li, “Toward P2PBased

Multimedia Sharing in User Generated Contents,” IEEE Trans. Parallel and Distributed Systems, vol. 23, no. 5, pp. 966-975,


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.