參考文獻 |
[1] F. Benevenuto, T. Rodrigues, M. Cha, and V. Almeida, “Characterizing user behavior in online social networks,” in Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement, ser. IMC ’09, Chicago, Illinois, USA: ACM, 2009, pp. 49–62, isbn: 978-1-60558-771-4. doi: 10.1145/1644893.1644900. [Online]. Available: http://doi.acm.org/10.1145/1644893.1644900.
[2] Y. Chi, T. Jiang, D. He, and R. Meng, “Towards an integrated clickstream data analysis framework for understanding web users’ information behavior,” iConference 2017 Proceedings, 2017.
[3] Z. S. Zubi and M. Raiani, “Using web logs dataset via web mining for user behavior understanding,” Int J Comput Comm, vol. 8, pp. 103–111, 2014.
[4] Y. Wang, N. Law, E. Hemberg, and U.-M. O’Reilly, “Using detailed access trajectories for learning behavior analysis,” in Proceedings of the 9th International Conference on Learning Analytics & Knowledge, ser. LAK19, Tempe, AZ, USA: ACM, 2019, pp. 290–299, isbn: 978-1-4503-6256-6. doi: 10 . 1145 / 3303772 . 3303781. [Online]. Available: http://doi.acm.org/10.1145/3303772.3303781.
[5] G. Wang, X. Zhang, S. Tang, C. Wilson, H. Zheng, and B. Y. Zhao, “Clickstream user behavior models,” ACM Trans. Web, vol. 11, no. 4, 21:1–21:37, Jul. 2017, issn: 1559-1131. doi: 10.1145/3068332. [Online]. Available: http://doi.acm.org/10. 1145/3068332.
[6] K. Ma, R. Jiang, M. Dong, Y. Jia, and A. Li, “Neural network based web log analysis for web intrusion detection,” in Security, Privacy, and Anonymity in Computation, Communication, and Storage, G. Wang, M. Atiquzzaman, Z. Yan, and K.-K. R. Choo, Eds., Cham: Springer International Publishing, 2017, pp. 194–204, isbn: 978-3-319-72395-2.
[7] C.-Y. Lien, Predicting Users?Demographic Information and Personality Through Browsing History. 2018. [Online]. Available: https://github.com/ncu-dart/Lab-Publications/raw/master/Thesis2018_Cheng_You_Lien.pdf.
[8] G.-J. Bai, Predicting Users?Browsing Tendency During Holidays by Matrix Factorization based Multi-objective Method. 2018. [Online]. Available: https://github.com/ncu- dart/Lab- Publications/raw/master/Thesis2018_Guo_Jhen_Bai.pdf.
[9] T.-R. Chen, Clickstream open dataset. [Online]. Available: https://ncu-dart.github.io/#CS_open_dataset.
[10] S. Ruder, “An overview of multi-task learning in deep neural networks,” CoRR, vol. abs/1706.05098, 2017. arXiv: 1706.05098. [Online]. Available: http://arxiv. org/abs/1706.05098.
[11] G. Zhou, N. Mou, Y. Fan, Q. Pi, W. Bian, C. Zhou, X. Zhu, and K. Gai, “Deep interest evolution network for click-through rate prediction,” CoRR, vol. abs/1809.03672, 2018. arXiv: 1809 . 03672. [Online]. Available: http : / / arxiv . org / abs / 1809 . 03672.
[12] Google, Chrome.history. [Online]. Available: https://developer.chrome.com/ extensions/history#transition_types.
[13] J. Chung, Ç. Gülçehre, K. Cho, and Y. Bengio, “Empirical evaluation of gated recurrent neural networks on sequence modeling,” CoRR, vol. abs/1412.3555, 2014. arXiv: 1412.3555. [Online]. Available: http://arxiv.org/abs/1412.3555.
[14] S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural Comput., vol. 9, no. 8, pp. 1735–1780, Nov. 1997, issn: 0899-7667. doi: 10.1162/neco.1997. 9.8.1735. [Online]. Available: http://dx.doi.org/10.1162/neco.1997.9.8.1735.
[15] D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings, 2015. [Online]. Available: http://arxiv.org/abs/1412.6980.
[16] S. L. Smith, P. Kindermans, and Q. V. Le, “Don’t decay the learning rate, increase the batch size,” CoRR, vol. abs/1711.00489, 2017. arXiv: 1711.00489. [Online]. Available: http://arxiv.org/abs/1711.00489.
[17] S. Kullback and R. A. Leibler, “On information and sufficiency,” Ann. Math. Statist., vol. 22, no. 1, pp. 79–86, Mar. 1951. doi: 10.1214/aoms/1177729694. [Online]. Available: https://doi.org/10.1214/aoms/1177729694. |