Abstract
News personalized recommendation has long been a favourite domain for recommender research. Traditional approaches strive to satisfy the users by constructing the users’ preference profiles. Naturally, most of recent methods use users’ reading history (content-based) or access pattern (collaborative filtering based) to recommend proper news articles to them. Besides, some researches encapsule the news content and access pattern in a recommender by vector space model. In this paper, we propose to use a hypergraph ranking for obtaining the preference rough, and then utilize the binary decision tree for eliminating the definition subjectivity of hypergraph. In this way, we can combine the content attributes on news content attributes, users and user’s access pattern in a unified hypergraph and get more accuracy results, whereas we needn’t to construct the user profile and select the possible important attributes empirically. Finally, we designed several experiments compared to the state-of-the-art methods on a real world dataset, and the results demonstrate that our approach significantly improves the accuracy, diversity, and coverage metrics in mass data.
Supported by the open fund project of Guangdong Key Laboratory of Big Data Analysis and Processing (2017006).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Agarwal, S., Branson, K., Belongie, S.: Higher order learning with graphs. In: Proceedings of the 23rd International Conference on Machine Learning, pp. 17–24. ACM (2006)
Balabanović, M., Shoham, Y.: Fab: content-based, collaborative recommendation. Commun. ACM 40(3), 66–72 (1997)
Best, C., van der Goot, E., de Paola, M., Garcia, T., Horby, D.: Europe media monitor-EMM. JRC Technical Note No. I 2 (2002)
Billsus, D., Pazzani, M.J.: A personal news agent that talks, learns and explains. In: Proceedings of the Third Annual Conference on Autonomous Agents, pp. 268–275. ACM (1999)
Breese, J., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative filtering. In: Proceedings of the Fourteenth conference on Uncertainty in Artificial Intelligence, pp. 43–52. Morgan Kaufmann Publishers Inc. (1998)
Bu, J., et al.: Music recommendation by unified hypergraph: combining social media information and music content. In: Proceedings of the International Conference on Multimedia, pp. 391–400. ACM (2010)
Bulo, S.R., Pelillo, M.: A game-theoretic approach to hypergraph clustering. In: NIPS, vol. 22, pp. 1571–1579 (2009)
Chu, W., Park, S.T.: Personalized recommendation on dynamic content using predictive bilinear models. In: Proceedings of the 18th International Conference on World Wide Web, pp. 691–700. ACM (2009)
Claypool, M., Gokhale, A., Miranda, T., Murnikov, P., Netes, D., Sartin, M.: Combining content-based and collaborative filters in an online newspaper. In: Proceedings of ACM SIGIR Workshop on Recommender Systems, vol. 60. Citeseer (1999)
Cota, R., Ferreira, A., Nascimento, C., Gonçalves, M., Laender, A.: An unsupervised heuristic-based hierarchical method for name disambiguation in bibliographic citations. J. Am. Soc. Inf. Sci. Technol. 61(9), 1853–1870 (2010)
Das, A.S., Datar, M., Garg, A., Rajaram, S.: Google news personalization: scalable online collaborative filtering. In: Proceedings of the 16th International Conference on World Wide Web, pp. 271–280. ACM (2007)
Gabrilovich, E., Dumais, S., Horvitz, E.: Newsjunkie: providing personalized newsfeeds via analysis of information novelty. In: Proceedings of the 13th International Conference on World Wide Web, pp. 482–490. ACM (2004)
Li, L., Li, T.: News recommendation via hypergraph learning: encapsulation of user behavior and news content. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 305–314. ACM (2013)
Li, L., Wang, D., Li, T., Knox, D., Padmanabhan, B.: SCENE: a scalable two-stage personalized news recommendation system. In: ACM Conference on Information Retrieval (SIGIR) (2011)
Li, L., Chu, W., Langford, J., Schapire, R.E.: A contextual-bandit approach to personalized news article recommendation. In: Proceedings of the 19th International Conference on World Wide Web, pp. 661–670. ACM (2010)
Liu, J., Dolan, P., Pedersen, E.R.: Personalized news recommendation based on click behavior. In: Proceedings of the 15th International Conference on Intelligent User Interfaces, pp. 31–40. ACM (2010)
Pazzani, M., Billsus, D.: Learning and revising user profiles: the identification of interesting web sites. Mach. Learn. 27(3), 313–331 (1997)
Schafer, J., Konstan, J., Riedi, J.: Recommender systems in e-commerce. In: Proceedings of the 1st ACM Conference on Electronic Commerce, pp. 158–166. ACM (1999)
Shardanand, U., Maes, P.: Social information filtering: algorithms for automating “word of mouth”. In: Proceedings of the SIGCHI Conference on Human factors in Computing Systems, pp. 210–217. ACM Press/Addison-Wesley Publishing Co. (1995)
Sun, L., Ji, S., Ye, J.: Hypergraph spectral learning for multi-label classification. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 668–676. ACM (2008)
Zhou, D., Huang, J., Schölkopf, B.: Learning with hypergraphs: clustering, classification, and embedding. Adv. Neural Inf. Process. Syst. 19, 1601 (2007)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Gu, W., Xie, X., Mao, Y., He, Y. (2018). Optimization of Hypergraph Based News Recommendation by Binary Decision Tree. In: Peng, Y., Yu, K., Lu, J., Jiang, X. (eds) Intelligence Science and Big Data Engineering. IScIDE 2018. Lecture Notes in Computer Science(), vol 11266. Springer, Cham. https://doi.org/10.1007/978-3-030-02698-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-02698-1_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-02697-4
Online ISBN: 978-3-030-02698-1
eBook Packages: Computer ScienceComputer Science (R0)