Skip to main content

Dual Role Neural Graph Auto-encoder for CQA Recommendation

  • Conference paper
  • First Online:
Web and Big Data (APWeb-WAIM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12317))

  • 1658 Accesses

Abstract

Matching between questions and suitable users is an appealing and challenging problem in the research area of community question answering (CQA). Usually, different from the traditional recommendation systems where a user has only a single role, each user in CQA can play two different roles (dual roles) simultaneously: as a requester and as an answerer. For different roles, users usually have varying interests and expertise in different topics and knowledge domains, which is rarely addressed in the previous methods. Besides, based on an explicit single link between two users, existing methods cannot capture implicit associations between their possibly similar roles. Therefore, in this paper, we propose the structure of a dual role graph and employ the link prediction approach to make CQA recommendation on the graph. Moreover, we develop a Dual Role Neural Graph auto-encoder (DRNGae) framework, which can: 1) encode the dual role graph structure to capture the implicit dual role correlation by propagating high-order information embeddings of graph neural network; 2) learn variable weights with the dual role feature preferences from dual role content information by self-attention mechanism; 3) reconstruct the graph structure to predict the possible interaction links. Experimental studies on real-world datasets verify our design and prove that our model achieves significantly better performance than baselines in link prediction (95.3% AUC, 96.2% AP on Citeseer dataset) and CQA recommendation (79.5% recall@25, 76.7% ndcg@25 on Yahoo! answer dataset).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://answers.yahoo.com/.

  2. 2.

    http://www.zhihu.com/.

  3. 3.

    https://webscope.sandbox.yahoo.com/

References

  1. van den Berg, R., Kipf, T.N., Welling, M.: Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 (2017)

  2. Chen, H., Li, X., Huang, Z.: Link prediction approach to collaborative filtering. In: Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL 2005), pp. 141–142. IEEE (2005)

    Google Scholar 

  3. Dong, Y., et al.: Link prediction and recommendation across heterogeneous social networks. In: 2012 IEEE 12th International Conference on Data Mining, pp. 181–190. IEEE (2012)

    Google Scholar 

  4. Du, N., Wang, Y., He, N., Sun, J., Song, L.: Time-sensitive recommendation from recurrent user activities. In: Advances in Neural Information Processing Systems, pp. 3492–3500 (2015)

    Google Scholar 

  5. Guo, J., Xu, S., Bao, S., Yu, Y.: Tapping on the potential of Q&A community by recommending answer providers. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 921–930. ACM (2008)

    Google Scholar 

  6. He, X., He, Z., Du, X., Chua, T.S.: Adversarial personalized ranking for recommendation. In: The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, pp. 355–364. ACM (2018)

    Google Scholar 

  7. Hofmann, T.: Unsupervised learning by probabilistic latent semantic analysis. Mach. Learn. 42(1–2), 177–196 (2001)

    Article  Google Scholar 

  8. Ji, T., Wu, Y., Lan, M.: Graph-based dependency parsing with graph neural networks. In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pp. 2475–2485 (2019)

    Google Scholar 

  9. Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)

  10. Kipf, T.N., Welling, M.: Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)

  11. Li, B., King, I.: Routing questions to appropriate answerers in community question answering services. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 1585–1588. ACM (2010)

    Google Scholar 

  12. Li, X., et al.: Beyond RNNs: positional self-attention with co-attention for video question answering. In: The 33rd AAAI Conference on Artificial Intelligence, vol. 8 (2019)

    Google Scholar 

  13. Menon, A.K., Elkan, C.: Link prediction via matrix factorization. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011. LNCS (LNAI), vol. 6912, pp. 437–452. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23783-6_28

    Chapter  Google Scholar 

  14. Pan, S., Hu, R., Long, G., Jiang, J., Yao, L., Zhang, C.: Adversarially regularized graph autoencoder for graph embedding. arXiv preprint arXiv:1802.04407 (2018)

  15. Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701–710. ACM (2014)

    Google Scholar 

  16. Sedhain, S., Menon, A.K., Sanner, S., Xie, L.: Autorec: autoencoders meet collaborative filtering. In: Proceedings of the 24th International Conference on World Wide Web, pp. 111–112. ACM (2015)

    Google Scholar 

  17. Sen, P., Namata, G., Bilgic, M., Getoor, L., Galligher, B., Eliassi-Rad, T.: Collective classification in network data. AI Mag. 29(3), 93–93 (2008)

    Article  Google Scholar 

  18. Tang, L., Liu, H.: Leveraging social media networks for classification. Data Mining Knowl. Discov. 23(3), 447–478 (2011)

    Article  MathSciNet  Google Scholar 

  19. Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, pp. 5998–6008 (2017)

    Google Scholar 

  20. Veličković, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)

  21. Vukotić, V., Raymond, C., Gravier, G.: Bidirectional joint representation learning with symmetrical deep neural networks for multimodal and crossmodal applications. In: Proceedings of the 2016 ACM on International Conference on Multimedia Retrieval, pp. 343–346. ACM (2016)

    Google Scholar 

  22. Xu, F., Ji, Z., Wang, B.: Dual role model for question recommendation in community question answering. In: Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 771–780. ACM (2012)

    Google Scholar 

  23. Yang, J.H., Chen, C.M., Wang, C.J., Tsai, M.F.: HOP-rec: high-order proximity for implicit recommendation. In: Proceedings of the 12th ACM Conference on Recommender Systems, pp. 140–144. ACM (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaoling Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Luo, X., Jin, Y., Ji, T., Wang, X. (2020). Dual Role Neural Graph Auto-encoder for CQA Recommendation. In: Wang, X., Zhang, R., Lee, YK., Sun, L., Moon, YS. (eds) Web and Big Data. APWeb-WAIM 2020. Lecture Notes in Computer Science(), vol 12317. Springer, Cham. https://doi.org/10.1007/978-3-030-60259-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-60259-8_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-60258-1

  • Online ISBN: 978-3-030-60259-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics