Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Exploring latent browsing graph for question answering recommendation

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

In this paper, we develop a framework of Question Answering Pages (referred to as QA pages) recommendation. Our proposed framework consists of the two modules: the off-line module to determine the importance of QA pages and the on-line module for on-line QA page recommendation. In the off-line module, we claim that the importance of QA pages could be discovered from user click streams. If the QA pages are of higher importance, many users will click and spend their time on these QA pages. Moreover, the relevant relationships among QA pages are captured by the browsing behavior on these QA pages. As such, we exploit user click streams to model the browsing behavior among QA pages as QA browsing graph structures. The importance of QA pages is derived from our proposed QA browsing graph structures. However, we observe that the QA browsing graph is sparse and that most of the QA pages do not link to other QA pages. This is referred to as a sparsity problem. To overcome this problem, we utilize the latent browsing relations among QA pages to build a QA Latent Browsing Graph. In light of QA latent browsing graph, the importance score of QA pages (referred to as Latent Browsing Rank) and the relevance score of QA pages (referred to as Latent Browsing Recommendation Rank) are proposed. These scores demonstrate the use of a QA latent browsing graph not only to determine the importance of QA pages but also to recommend QA pages. We conducted extensive empirical experiments on Yahoo! Asia Knowledge Plus to evaluate our proposed framework.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agichtein, E., Castillo, C., Donato, D., Gionis, A., Mishne, G.: Finding high-quality content in social media. In: Proceedings of the First ACM International Conference on Web Search and Web Data Mining, pp. 183–194. ACM (2008)

  2. Bertino, E., Ferrari, E., Perego, A.: A general framework for web content filtering. World Wide Web 13(3), 215–249 (2010)

    Article  Google Scholar 

  3. Bian, J., Liu, Y., Agichtein, E., Zha, H.: Finding the right facts in the crowd: factoid question answering over social media. In: Proceeding of the Seventeenth International Conference on World Wide Web, pp. 467–476. ACM (2008)

  4. Bian, J., Liu, Y., Zhou, D., Agichtein, E., Zha, H.: Learning to recognize reliable users and content in social media with coupled mutual reinforcement. In: Proceedings of the Eighteenth International Conference on World Wide Web, pp. 51–60. ACM (2009)

  5. Gyongyi, Z., Koutrika, G., Pedersen, J., Garcia-Molina, H.: Questioning Yahoo! Answers. In: Proceeding of the Seventeenth International Conference on World Wide Web (2008)

  6. He, J., Li, M., Zhang, H.-J., Tong, H., Zhang, C.: Manifold-ranking based image retrieval. In: Proceedings of the Twelfth International Conference on Multimedia, pp. 9–16. ACM (2004)

  7. Jeon, J., Croft, W.B., Lee, J.H., Park, S.: A framework to predict the quality of answers with non-textual features. In: Proceedings of the 29th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 228–235. ACM (2006)

  8. Kleinberg, J.: Authoritative sources in a hyperlinked environment. J. ACM (JACM) 46(5), 604–632 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Langville, A., Meyer, C.: Deeper inside pagerank. Internet Math. 1(3), 335–380 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Leung, C., Chan, S., Chung, F., Ngai, G.: A probabilistic rating inference framework for mining user preferences from reviews. World Wide Web 14(1), 1–29 (2011)

    Article  Google Scholar 

  11. Liu, Y., Gao, B., Liu, T.-Y., Zhang, Y., Ma, Z., He, S., Li, H.: Browserank: letting web users vote for page importance. In: Proceedings of the 31st International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 451–458. ACM (2008)

  12. Onuma, K., Tong, H., Faloutsos, C.: Tangent: a novel, ‘surprise me’, recommendation algorithm. In: Proceedings of the Fifteenth ACM International Conference on Knowledge Discovery and Data Mining, pp. 657–666. ACM (2009)

  13. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web (1998)

  14. Pak, A., Chung, C.: A wikipedia matching approach to contextual advertising. World Wide Web 13(3), 251–274 (2010)

    Article  Google Scholar 

  15. Pan, J., Yang, H., Faloutsos, C., Duygulu, P.: Automatic multimedia cross-modal correlation discovery. In: Proceedings of the tenth ACM International Conference on Knowledge Discovery and Data Mining, pp. 653–658. ACM (2004)

  16. Rao, W., Chen, L.: A distributed full-text top-k document dissemination system in distributed hash tables. World Wide Web 14(5–6), 545–572 (2011)

    Article  Google Scholar 

  17. Robertson, S.: Overview of the okapi projects. J. Doc. 53(1), 3–7 (1997)

    Article  Google Scholar 

  18. Stewart, W.: Introduction to the numerical solution of Markov chains. Princeton University Press (1994)

  19. Sun, J., Qu, H., Chakrabarti, D., Faloutsos, C.: Neighborhood formation and anomaly detection in bipartite graphs. In: Proceedings of the Fifth IEEE International Conference on Data Mining, pp. 418–425 (2005)

  20. Suryanto, M.A., Lim, E.P., Sun, A., Chiang, R.H.L.: Quality-aware collaborative question answering: methods and evaluation. In: Proceedings of the Second ACM International Conference on Web Search and Data Mining, pp. 142–151. ACM (2009)

Download references

Author information

Authors and Affiliations

  1. National Chiao Tung University, Hsinchu, Taiwan

    Meng-Fen Chiang & Wen-Chih Peng

  2. University of Illinois at Chicago, Chicago, IL, 60607, USA

    Philip S. Yu

Authors
  1. Meng-Fen Chiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wen-Chih Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Philip S. Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wen-Chih Peng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chiang, MF., Peng, WC. & Yu, P.S. Exploring latent browsing graph for question answering recommendation. World Wide Web 15, 603–630 (2012). https://doi.org/10.1007/s11280-011-0146-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-011-0146-0

Keywords

Search

Navigation