{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T17:17:12Z","timestamp":1777483032475,"version":"3.51.4"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2014,4]]},"abstract":"<jats:p>Web portal services have become an important medium to deliver digital content (e.g. news, advertisements, etc.) to Web users in a timely fashion. To attract more users to various content modules on the Web portal, it is necessary to design a recommender system that can effectively achieve Web portal content optimization by automatically estimating content item attractiveness and relevance to user interests. The state-of-the-art online learning methodology adapts dedicated pointwise models to independently estimate the attractiveness score for each candidate content item. Although such pointwise models can be easily adapted for online recommendation, there still remain a few critical problems. First, this pointwise methodology fails to use invaluable user preferences between content items. Moreover, the performance of pointwise models decreases drastically when facing the problem of sparse learning samples. To address these problems, we propose exploring a new dynamic pairwise learning methodology for Web portal content optimization in which we exploit dynamic user preferences extracted based on users' actions on portal services to compute the attractiveness scores of content items. In this article, we introduce two specific pairwise learning algorithms, a straightforward graph-based algorithm and a formalized Bayesian modeling one. Experiments on large-scale data from a commercial Web portal demonstrate the significant improvement of pairwise methodologies over the baseline pointwise models. Further analysis illustrates that our new pairwise learning approaches can benefit personalized recommendation more than pointwise models, since the data sparsity is more critical for personalized content optimization.<\/jats:p>","DOI":"10.1145\/2493259","type":"journal-article","created":{"date-parts":[[2014,4,28]],"date-time":"2014-04-28T15:24:14Z","timestamp":1398698654000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Exploiting User Preference for Online Learning in Web Content Optimization Systems"],"prefix":"10.1145","volume":"5","author":[{"given":"Jiang","family":"Bian","sequence":"first","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Long","sequence":"additional","affiliation":[{"name":"LinkedIn"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihong","family":"Li","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taesup","family":"Moon","sequence":"additional","affiliation":[{"name":"University of California, Berkerley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anlei","family":"Dong","sequence":"additional","affiliation":[{"name":"Yahoo! Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Chang","sequence":"additional","affiliation":[{"name":"Yahoo! Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,4,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526713"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835894"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of NIPS.","author":"Agarwal D.","unstructured":"D. Agarwal , B.-C. Chen , P. Elango , N. Motgi , S.-T. Park , R. Ramakrishnan , S. Roy , and J. Zachariah . 2008. Online models for content optimization . In Proceedings of NIPS. D. Agarwal, B.-C. Chen, P. Elango, N. Motgi, S.-T. Park, R. Ramakrishnan, S. Roy, and J. Zachariah. 2008. Online models for content optimization. In Proceedings of NIPS."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348350"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242575"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/050623905"},{"key":"e_1_2_1_7_1","unstructured":"D. Billsus and M. Pazzani. 2007. Adaptive news access. In The Adaptive Web - Methods and Strategies of Web Personalization.   D. Billsus and M. Pazzani. 2007. Adaptive news access. In The Adaptive Web - Methods and Strategies of Web Personalization."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454009"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(01)00320-2"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557138"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242610"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063907"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of ICML.","author":"Freund Y.","unstructured":"Y. Freund , R. D. Iyer , R. E. Schapire , and Y. Singer . 1998. An efficient boosting algorithm for combining preferences . In Proceedings of ICML. Y. Freund, R. D. Iyer, R. E. Schapire, and Y. Singer. 1998. An efficient boosting algorithm for combining preferences. In Proceedings of ICML."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988738"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312682"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of IJCAI.","author":"Hofmann T.","unstructured":"T. Hofmann and J. Puzicha . 1999. Latent class models for collaborative filtering . In Proceedings of IJCAI. T. Hofmann and J. Puzicha. 1999. Latent class models for collaborative filtering. In Proceedings of IJCAI."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009051"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336669"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"M. J. Kearns and U. V. Vazirani. 1994. An Introduction to Computational Learning Theory. MIT Press.   M. J. Kearns and U. V. Vazirani. 1994. An Introduction to Computational Learning Theory. MIT Press.","DOI":"10.7551\/mitpress\/3897.001.0001"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245126"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557072"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_2_1_28_1","volume-title":"Learning to Rank for Information Retrieval. Foundations and Trends in Information Retrieval","author":"Liu T.-Y.","unstructured":"T.-Y. Liu . 2009. Learning to Rank for Information Retrieval. Foundations and Trends in Information Retrieval , Springer . T.-Y. Liu. 2009. Learning to Rank for Information Retrieval. Foundations and Trends in Information Retrieval, Springer."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of AAAI.","author":"Melville P.","unstructured":"P. Melville , R. J. Mooney , and R. Nagarajan . 2002. Content-boosted collaborative filtering for improved recommendations . In Proceedings of AAAI. P. Melville, R. J. Mooney, and R. Nagarajan. 2002. Content-boosted collaborative filtering for improved recommendations. In Proceedings of AAAI."},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of UAI.","author":"Rendle S.","unstructured":"S. Rendle , C. Freudenthaler , Z. Gantner , and L. Schmidt-Thieme . 2009. BPR: Bayesian personalized ranking from implicit feedback . In Proceedings of UAI. S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme. 2009. BPR: Bayesian personalized ranking from implicit feedback. In Proceedings of UAI."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772773"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of NIPS.","author":"Srebro N.","unstructured":"N. Srebro , J. Rennie , and T. Jaakkola . 2005. Maximum-margin matrix factorization . In Proceedings of NIPS. N. Srebro, J. Rennie, and T. Jaakkola. 2005. Maximum-margin matrix factorization. In Proceedings of NIPS."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526725"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2365952.2365972"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148257"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1177\/002224377801500302"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of SDM.","author":"Xiong L.","unstructured":"L. Xiong , X. Chen , T.-K. Huang , J. Schneider , and J. G. Carbonell . 2010. Temoral collaborative filtering with Bayesian probabilistic tensor factorization . In Proceedings of SDM. L. Xiong, X. Chen, T.-K. Huang, J. Schneider, and J. G. Carbonell. 2010. Temoral collaborative filtering with Bayesian probabilistic tensor factorization. In Proceedings of SDM."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009959"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076054"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009053"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277752"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277792"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183672"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2493259","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2493259","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:32Z","timestamp":1750231712000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2493259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["10.1145\/2493259"],"URL":"https:\/\/doi.org\/10.1145\/2493259","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4]]},"assertion":[{"value":"2012-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-04-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}