Skip to main content

AE-UPCP: Seeking Potential Membership Users by Audience Expansion Combining User Preference with Consumption Pattern

  • Conference paper
  • First Online:
Book cover Database Systems for Advanced Applications (DASFAA 2021)

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

Included in the following conference series:

  • 2698 Accesses

Abstract

Many online video websites or platforms provide membership service, such as YouTube, Netflix and iQIYI. Identifying potential membership users and giving timely marketing activities can promote membership conversion and improve website revenue. Audience expansion is a viable way, where existing membership users are treated as seed users, and users similar to seed users are expanded as potential memberships. However, existing methods have limitations in measuring user similarity only according to user preference, and do not take into account consumption pattern which refers to aspects that users focus on when purchasing membership service. So we propose an Audience Expansion method combining User Preference and Consumption Pattern (AE-UPCP) for seeking potential membership users. An autoencoder is designed to extract user personalized preference and CNN is used to learn consumption pattern. We utilize attention mechanism and propose a fusing unit to combine user preference with consumption pattern to calculate user similarity realizing audience expansion of membership users. We conduct extensive study on real datasets demonstrating the advantages of our proposed model.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

    https://tianchi.aliyun.com/dataset/dataDetail?dataId=56.

References

  1. Shen, J., Geyik, S. C., Dasdan, A.: Effective audience extension in online advertising. In: KDD, pp. 2099–2108 (2015)

    Google Scholar 

  2. Ma, Q., Wen, M., Xia, Z., Chen, D.: A sub-linear, massive-scale look-alike audience extension system a massive-scale look-alike audience extension. In: BigMine, pp. 51–67 (2016)

    Google Scholar 

  3. Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. In: NAACL, pp. 4171–4186. NAACL (2019)

    Google Scholar 

  4. Vaswani, A., Shazeer, N., Parmar, N., et al.: Attention is all you need. In: NIPS, pp. 5998–6008 (2017)

    Google Scholar 

  5. Ma, Q., Wagh, E., Wen, J., Xia, Z., Ormandi, R., Chen, D.: Score look-alike audiences. In: ICDM, pp. 647–654 (2016)

    Google Scholar 

  6. McMahan, H.B., Holt, G., Sculley, D., Young, M., et al.: Ad click prediction: a view from the trenches. In: KDD, pp. 1222–1230 (2013)

    Google Scholar 

  7. Rendle, S.: Factorization achines. In: ICDM, pp. 995–1000 (2010)

    Google Scholar 

  8. Ke, G., Meng, Q., Finley, T., et al.: LightGBM: a highly efficient gradient boosting decision tree. In: NIPS, pp. 3146–3154 (2017)

    Google Scholar 

  9. Cheng, H. T., Koc, L., Harmsen, J., Shaked, T., et al.: Wide & deep learning for recommender systems. In: RecSys, pp. 7–10 (2016)

    Google Scholar 

  10. Guo, H., Tang, R., Ye, Y., Li, Z., He, X.: DeepFM: a factorization-machine based neural network for CTR prediction. In: IJCAI, pp. 1725–1731 (2017)

    Google Scholar 

  11. Zhou, G., Zhu, X., Song, C., Fan, Y., et al.: Deep interest network for click-through rate prediction. In: KDD, pp. 1059–1068 (2018)

    Google Scholar 

  12. Zhou, G., Mou, N., Fan, Y., et al.: Deep interest evolution network for click-through rate prediction. In: AAAI, pp. 5941–5948 (2019)

    Google Scholar 

  13. Feng, Y., Lv, F., Shen, W., Wang, M., et al.: Deep session interest network for click-through rate prediction. In: IJCAI, pp. 2301–2307 (2019)

    Google Scholar 

  14. Dong, X., Yu, L., Wu, Z., et al.: A hybrid collaborative filtering model with deep structure for recommender systems. In: AAAI, pp. 1309–1315 (2017)

    Google Scholar 

  15. Wang, S., Cao, J., Yu, P.: Deep learning for spatio-temporal data mining: a survey. IEEE Trans. Knowl. Data Eng. (2020). https://doi.org/10.1109/TKDE.2020.3025580

  16. Vincent, P., Larochelle, H., Lajoie, I., Bengio, Y., et al.: Stacked denoising autoencoders: learning useful representations in a deep network with a local denoising criterion. J. Mach. Learn. Res. 11, 3371–3408 (2010)

    MathSciNet  MATH  Google Scholar 

  17. Kim, Y.: Convolutional neural networks for sentence classification. In: EMNLP, pp. 1746–1751 (2014)

    Google Scholar 

  18. Cho, K., Merrienboer, B. V., Gulcehre, C., et al.: Learning phrase representations using RNN encoder-decoder for statistical machine translation. In: EMNLP, pp. 1724–1734 (2014)

    Google Scholar 

Download references

Acknowledgements

This work is supported by National Natural Science Foundation of China (No. 62072282), Industrial Internet Innovation and Development Project in 2019 of China, Shandong Provincial Key Research and Development Program (Major Scientific and Technological Innovation Project) (No. 2019JZZY010105). This work is also supported in part by US NSF under Grants III-1763325, III-1909323, and SaTC-1930941.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhaohui Peng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xu, X. et al. (2021). AE-UPCP: Seeking Potential Membership Users by Audience Expansion Combining User Preference with Consumption Pattern. In: Jensen, C.S., et al. Database Systems for Advanced Applications. DASFAA 2021. Lecture Notes in Computer Science(), vol 12682. Springer, Cham. https://doi.org/10.1007/978-3-030-73197-7_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-73197-7_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-73196-0

  • Online ISBN: 978-3-030-73197-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics